Yevgeniy Dodis

Yevgeniy Dodis's AcademicInfluence.com Rankings

Yevgeniy Dodis

Computer Science

#9726

World Rank

#10203

Historical Rank

Database

#6689

World Rank

#6924

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Yevgeniy Dodis Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Yevgeniy Dodis's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data (2004) (2697)
On the Security of Joint Signature and Encryption (2002) (600)
Merkle-Damgård Revisited: How to Construct a Hash Function (2005) (541)
Proofs of Retrievability via Hardness Amplification (2009) (489)
Key-Insulated Public Key Cryptosystems (2002) (400)
A Verifiable Random Function with Short Proofs and Keys (2005) (392)
Universally Composable Security with Global Setup (2007) (347)
Public Key Broadcast Encryption for Stateless Receivers (2002) (323)
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model (2009) (302)
Anonymous Identification in Ad Hoc Groups (2004) (293)
Proxy Cryptography Revisited (2003) (273)
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors (2008) (273)
Strong Key-Insulated Signature Schemes (2003) (264)
Public Key Cryptography - PKC 2006 (2006) (257)
Secure Remote Authentication Using Biometric Data (2005) (255)
Pricing network edges for heterogeneous selfish users (2003) (241)
Proxy cryptography revisted (2003) (236)
Cryptography against Continuous Memory Attacks (2010) (223)
Robust Fuzzy Extractors and Authenticated Key Agreement From Close Secrets (2006) (217)
On cryptography with auxiliary input (2009) (213)
Public-Key Encryption in the Bounded-Retrieval Model (2010) (210)
Exposure-Resilient Functions and All-or-Nothing Transforms (2000) (209)
How much can taxes help selfish routing? (2003) (199)
Public-Key Encryption Schemes with Auxiliary Inputs (2010) (196)
Practical leakage-resilient identity-based encryption from simple assumptions (2010) (191)
Efficient Public-Key Cryptography in the Presence of Key Leakage (2010) (189)
Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes (2004) (185)
Correcting errors without leaking partial information (2005) (174)
Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack (2003) (167)
Non-malleable extractors and symmetric key cryptography from weak secrets (2009) (164)
ID-based encryption for complex hierarchies with applications to forward security and broadcast encryption (2004) (162)
Improved Testing Algorithms for Monotonicity (1999) (161)
A Cryptographic Solution to a Game Theoretic Problem (2000) (161)
Chosen-Ciphertext Security of Multiple Encryption (2005) (158)
Breaking and repairing optimistic fair exchange from PODC 2003 (2003) (139)
Non-malleable codes from additive combinatorics (2014) (138)
Design networks with bounded pairwise distance (1999) (129)
Security analysis of pseudo-random number generators with input: /dev/random is not robust (2013) (113)
Leftover Hash Lemma, Revisited (2011) (111)
Efficient Construction of (Distributed) Verifiable Random Functions (2003) (110)
Entropic Security and the Encryption of High Entropy Messages (2005) (104)
Spooky Encryption and Its Applications (2016) (102)
Message Authentication, Revisited (2012) (101)
Salvaging Merkle-Damgard for Practical Applications (2009) (100)
On the Generic Insecurity of the Full Domain Hash (2005) (100)
On the (im)possibility of cryptography with imperfect randomness (2004) (96)
Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks (2010) (94)
On Perfect and Adaptive Security in Exposure-Resilient Cryptography (2001) (92)
Non-malleable Reductions and Applications (2015) (91)
The Double Ratchet: Security Notions, Proofs, and Modularization for the Signal Protocol (2019) (90)
Intrusion-Resilient Public-Key Encryption (2003) (89)
Overcoming weak expectations (2012) (87)
Multiparty quantum coin flipping (2003) (81)
Optimistic Fair Exchange in a Multi-user Setting (2007) (79)
Storing Secrets on Continually Leaky Devices (2011) (76)
Improved Randomness Extraction from Two Independent Sources (2004) (71)
Privacy Amplification and Non-malleable Extractors via Character Sums (2011) (71)
Composability and On-Line Deniability of Authentication (2009) (70)
Intrusion-Resilient Key Exchange in the Bounded Retrieval Model (2007) (70)
A Formal Treatment of Backdoored Pseudorandom Generators (2015) (69)
Proactive Two-Party Signatures for User Authentication (2003) (68)
On the (non)universality of the one-time pad (2002) (67)
On the Indifferentiability of Key-Alternating Ciphers (2013) (65)
Parallel Reducibility for Information-Theoretically Secure Computation (2000) (64)
Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6 (2009) (63)
Message Transmission with Reverse Firewalls - Secure Communication on Corrupted Machines (2016) (61)
Exposure-resilient cryptography (2000) (60)
Scalable public-key tracing and revoking (2003) (59)
Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited (2017) (59)
Survey: Leakage Resilience and the Bounded Retrieval Model (2009) (58)
A Generic Construction for Intrusion-Resilient Public-Key Encryption (2004) (58)
Changing base without losing space (2010) (57)
Random Oracles and Non-Uniformity (2018) (53)
Security Analysis and Improvements for the IETF MLS Standard for Group Messaging (2020) (50)
Lower Bounds for Oblivious Transfer Reductions (1999) (50)
To Hash or Not to Hash Again? (In)differentiability Results for H2 and HMAC (2012) (49)
Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources (2012) (48)
Algorithmic Game Theory: Cryptography and Game Theory (2007) (47)
A Domain Extender for the Ideal Cipher (2010) (47)
On the Power of Claw-Free Permutations (2002) (44)
Message Authentication Codes from Unpredictable Block Ciphers (2009) (44)
A New Mode of Operation for Block Ciphers and Length-Preserving MACs (2008) (43)
Key Derivation without Entropy Waste (2014) (42)
Fast Message Franking: From Invisible Salamanders to Encryptment (2018) (42)
On Continual Leakage of Discrete Log Representations (2013) (42)
Bottleneck links, variable demand, and the tragedy of the commons (2006) (41)
On Extracting Private Randomness over a Public Channel (2003) (40)
Concealment and Its Applications to Authenticated Encryption (2003) (38)
Mercurial Commitments: Minimal Assumptions and Efficient Constructions (2006) (36)
How to Eat Your Entropy and Have it Too: Optimal Recovery Strategies for Compromised RNGs (2017) (35)
Versatile padding schemes for joint signature and encryption (2004) (34)
Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group Models (2018) (34)
On the Relation Between the Ideal Cipher and the Random Oracle Models (2006) (33)
Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs (2008) (31)
Does Privacy Require True Randomness? (2007) (31)
Reusable Non-Interactive Secure Computation (2019) (31)
Indifferentiability of Confusion-Diffusion Networks (2016) (31)
Domain Extension for MACs Beyond the Birthday Barrier (2011) (31)
Differential Privacy with Imperfect Randomness (2012) (30)
Fuzzy Extractors ∗ (2007) (29)
Shannon Impossibility, Revisited (2012) (29)
Feistel Networks Made Public, and Applications (2007) (28)
Optimal Signcryption from Any Trapdoor Permutation (2004) (28)
Exposure-resilience for free: the hierarchical ID-based encryption case (2002) (28)
On the Instantiability of Hash-and-Sign RSA Signatures (2012) (26)
Non-malleable Encryption: Simpler, Shorter, Stronger (2016) (25)
A New Distribution-Sensitive Secure Sketch and Popularity-Proportional Hashing (2017) (24)
Getting the Best Out of Existing Hash Functions; or What if We Are Stuck with SHA? (2008) (22)
Universal configurations in light-flipping games (2001) (22)
Time Capsule Signature (2005) (21)
Key-insulated symmetric key cryptography and mitigating attacks against cryptographic cloud software (2012) (21)
Fuzzy Extractors and Cryptography, or How to Use Your Fingerprints (2003) (21)
Counterexamples to Hardness Amplification Beyond Negligible (2012) (18)
Fuzzy Extractors A Brief Survey of Results from 2004 to 2006 (2008) (18)
On extractors, error-correction and hiding all partial information (2005) (18)
Provable Security of (Tweakable) Block Ciphers Based on Substitution-Permutation Networks (2018) (18)
On the Price of Concurrency in Group Ratcheting Protocols (2020) (17)
Threshold and Proactive Pseudo-Random Permutations (2006) (17)
Space Time Tradeoffs for Graph Properties (1999) (16)
Amplifying Privacy in Privacy Amplification (2014) (15)
Modular Design of Secure Group Messaging Protocols and the Security of MLS (2021) (15)
1 Cryptography and Game Theory (14)
Improving the Security of MACs Via Randomized Message Preprocessing (2007) (14)
Pricing Networks with Selfish Routing (2003) (14)
The 2-catalog segmentation problem (1999) (14)
Privacy with Imperfect Randomness (2015) (13)
Security Amplification for InteractiveCryptographic Primitives (2009) (13)
New Imperfect Random Source with Applications to Coin-Flipping (2001) (13)
Impossibility of Black-Box Reduction from Non-Adaptively to Adaptively Secure Coin-Flipping (2000) (12)
Provable Security of Substitution-Permutation Networks (2017) (12)
Secure Remote Authentication Using Biometrics (2005) (10)
Interactive Encryption and Message Authentication (2014) (9)
Public Key Cryptography - PKC 2006: 9th International Conference on Theory and Practice in Public-Key Cryptography, New York, NY, USA, April 24-26, 2006. ... (Lecture Notes in Computer Science) (2006) (9)
Parallel Signcryption with OAEP, PSS-R, and other Feistel Paddings (2003) (9)
Seedless Fruit is the Sweetest: Random Number Generation, Revisited (2019) (8)
PhD thesis: Exposure-resilient cryptography (2000) (8)
Separating Sources for Encryption and Secret Sharing (2006) (7)
Public key cryptography - PKC 2006 : 9th International Conference on Theory and Practice in Public Key Cryptography, New York, NY, USA, April 24-26, 2006 : proceedings (2006) (7)
Signcryption ( Short Survey ) (2005) (7)
Forward-Secure Hierarchical IBE with Applications to Broadcast Encryption (2009) (7)
Speak Much, Remember Little: Cryptography in the Bounded Storage Model, Revisited (2021) (6)
Fully scalable public-key traitor tracing (2003) (6)
On the (In)Security of RSA Signatures (2011) (6)
Extracting Randomness from Extractor-Dependent Sources (2020) (6)
Theory of Cryptography (2015) (6)
Theory of Cryptography (2015) (5)
How to Eat Your Entropy and Have it Too: Optimal Recovery Strategies for Compromised RNGs (2014) (5)
Updatable Public Key Encryption in the Standard Model (2021) (5)
Self-Destruct Non-Malleability (2014) (5)
Unilaterally-Authenticated Key Exchange (2017) (4)
T5: Hashing Five Inputs with Three Compression Calls (2021) (4)
Interactive Encryption, Message Authentication, and Anonymous Key Exchange (2013) (4)
Fault-Tolerant Leader Election and Collective Coin-Flipping in the Full Information Model (2020) (4)
Privacy and Imperfect Randomness (2014) (3)
Towards Defeating Backdoored Random Oracles: Indifferentiability with Bounded Adaptivity (2020) (3)
Interactive Coding for Interactive Proofs (2016) (3)
A new design criteria for hash-functions (2005) (3)
On the Impossibility of Extracting Classical Randomness Using a Quantum Computer (2006) (3)
Problem Set 1 (2002) (2)
Multicast Key Agreement, Revisited (2021) (2)
Authentication in the Bounded Storage Model (2022) (2)
Online Linear Extractors for Independent Sources (2021) (2)
No Time to Hash: On Superefficient Entropy Accumulation (2021) (2)
Fully-simulatable multiparty computation (2004) (2)
Master's thesis: Space-time tradeoffs for graph properties (1998) (2)
cient Construction of ( Distributed ) Veri £ able Random Functions (2002) (2)
Public-Key Encryption Schemes with Auxiliary Inputs. Theory of Cryptography (2010) (2)
Forward Secret Encrypted RAM: Lower Bounds and Applications (2021) (2)
Verifiable Random Permutations (2006) (2)
Lecture 2: Optimality of One-time MACs and Shannon Impossibility (2013) (1)
Rotatable Zero Knowledge Sets: Post Compromise Secure Auditable Dictionaries with application to Key Transparency (2022) (1)
Incremental Codes (2001) (1)
G22.3033-013 Exposure-resilient Cryptography (2007) (1)
Software-Based Attestation (2011) (1)
On the Worst-Case Inefficiency of CGKA (2022) (1)
Minimal Assumptions for Efficient Mercurial Commitments (2005) (1)
Basing cryptography on biometrics and other noisy data (2017) (1)
Doubly-Affine Extractors, and their Applications (2021) (1)
The cost of cryptography (2013) (1)
Space-time Tradeoos for Graph Properties (1999) (1)
Public-Key Encryption Schemes with Auxiliary Inputs . Theory of Cryptography Citation (2009) (1)
Beating Shannon requires BOTH efficient adversaries AND non-zero advantage (2012) (0)
Bidirectionally-Secure Cryptosystems (0)
Minimal Assumption for Indistinguishable Encryption (2012) (0)
PublicKey BroadcastEncryptionfor StatelessReceivers (0)
Speaker Identification and Verification (SIV) (2011) (0)
Space-time Tradeoos for Graph Properties Space-time Tradeoos for Graph Properties (1999) (0)
Lecture 12: Computational Key Derivation (2013) (0)
Small-Box Cryptography (2022) (0)
Designated Verifier Nizks (2009) (0)
Salvaging Merkle-Damgfor Practical Applications (2009) (0)
Revisiting Collision and Local Opening Analysis of 1 ABR Hash 2 (2022) (0)
Space-Time Tradeoffs for Graph Properties by Yevgeniy Dodis (0)
Pricing networks with selfish routing (survey) (2003) (0)
Definition of Leakage-resilient Cca Encryption (2009) (0)
End-to-End Encrypted Zoom Meetings: Proving Security and Strengthening Liveness (2023) (0)
Non-malleable Reductions and Applications ( Full version ) (2014) (0)
Lecture 16: Special Purpose Extractors (2013) (0)
Subgroup Cryptosystems (2011) (0)
Encapsulated Search Index: Public-Key, Sub-linear, Distributed, and Delegatable (2022) (0)
Lecture 6: Encryption/Extraction (2013) (0)
Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography (2006) (0)
Lecture 15: Privacy Amplication against Active Attackers (2013) (0)
An Alternative to Arithmetic Coding with Local Decodability (2010) (0)
Forward-Secure Encryption with Fast Forwarding (2022) (0)
Lecture 3: Privacy and Weak Sources (2013) (0)
On randomness, codes and extractors in cryptography (2015) (0)
A New Distribution Sensitive Secure Sketch and a Comparison Between Approaches to Typo-Tolerant Authentication (2017) (0)
Revisiting Collision and Local Opening Analysis of ABR Hash (2022) (0)
On Seedless PRNGs and Premature Next (2022) (0)

This paper list is powered by the following services:

What Schools Are Affiliated With Yevgeniy Dodis?

Yevgeniy Dodis is affiliated with the following schools:

New York University

Yevgeniy Dodis's Academic­Influence.com Rankings

Why Is Yevgeniy Dodis Influential?

Yevgeniy Dodis's Published Works

Published Works

What Schools Are Affiliated With Yevgeniy Dodis?

Yevgeniy Dodis's AcademicInfluence.com Rankings