Yevgeniy Dodis

According to our database1, Yevgeniy Dodis authored at least 144 papers between 1999 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Extracting Randomness from Extractor-Dependent Sources.
IACR Cryptol. ePrint Arch., 2019

Fast Message Franking: From Invisible Salamanders to Encryptment.
IACR Cryptol. ePrint Arch., 2019

Seedless Fruit is the Sweetest: Random Number Generation, Revisited.
IACR Cryptol. ePrint Arch., 2019

Security Analysis and Improvements for the IETF MLS Standard for Group Messaging.
IACR Cryptol. ePrint Arch., 2019

2018
Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group Models.
IACR Cryptol. ePrint Arch., 2018

Reusable Non-Interactive Secure Computation.
IACR Cryptol. ePrint Arch., 2018

The Double Ratchet: Security Notions, Proofs, and Modularization for the Signal Protocol.
IACR Cryptol. ePrint Arch., 2018

Provable Security of (Tweakable) Block Ciphers Based on Substitution-Permutation Networks.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017
A New Distribution Sensitive Secure Sketch and a Comparison Between Approaches to Typo-Tolerant Authentication.
IACR Cryptol. ePrint Arch., 2017

Provable Security of Substitution-Permutation Networks.
IACR Cryptol. ePrint Arch., 2017

Unilaterally-Authenticated Key Exchange.
IACR Cryptol. ePrint Arch., 2017

Random Oracles and Non-Uniformity.
IACR Cryptol. ePrint Arch., 2017

How to Eat Your Entropy and Have it Too: Optimal Recovery Strategies for Compromised RNGs.
Algorithmica, 2017

Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

A New Distribution-Sensitive Secure Sketch and Popularity-Proportional Hashing.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Basing cryptography on biometrics and other noisy data.
Proceedings of the 51st Annual Conference on Information Sciences and Systems, 2017

2016
Spooky Encryption and its Applications.
IACR Cryptol. ePrint Arch., 2016

A Formal Treatment of Backdoored Pseudorandom Generators.
IACR Cryptol. ePrint Arch., 2016

2015
Message Transmission with Reverse Firewalls - Secure Communication on Corrupted Machines.
IACR Cryptol. ePrint Arch., 2015

Indifferentiability of Confusion-Diffusion Networks.
IACR Cryptol. ePrint Arch., 2015

Non-Malleable Encryption: Simpler, Shorter, Stronger.
IACR Cryptol. ePrint Arch., 2015

Privacy with Imperfect Randomness.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
Privacy Amplification and Nonmalleable Extractors Via Character Sums.
SIAM J. Comput., 2014

Privacy and Imperfect Randomness.
IACR Cryptol. ePrint Arch., 2014

Interactive Coding for Interactive Proofs.
IACR Cryptol. ePrint Arch., 2014

Non-malleable Reductions and Applications.
Electronic Colloquium on Computational Complexity (ECCC), 2014

Interactive Encryption and Message Authentication.
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

2013
To Hash or Not to Hash Again? (In)differentiability Results for H2 and HMAC.
IACR Cryptol. ePrint Arch., 2013

Key Derivation Without Entropy Waste.
IACR Cryptol. ePrint Arch., 2013

Security Analysis of Pseudo-Random Number Generators with Input: /dev/random is not Robust.
IACR Cryptol. ePrint Arch., 2013

Interactive Encryption, Message Authentication, and Anonymous Key Exchange.
IACR Cryptol. ePrint Arch., 2013

On the Indifferentiability of Key-Alternating Ciphers.
IACR Cryptol. ePrint Arch., 2013

Amplifying Privacy in Privacy Amplification.
IACR Cryptol. ePrint Arch., 2013

Non-malleable Codes from Additive Combinatorics.
Electronic Colloquium on Computational Complexity (ECCC), 2013

Overcoming Weak Expectations.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

2012
Robust Fuzzy Extractors and Authenticated Key Agreement From Close Secrets.
IEEE Trans. Inf. Theory, 2012

Bottleneck links, variable demand, and the tragedy of the commons.
Networks, 2012

Differential Privacy with Imperfect Randomness.
IACR Cryptol. ePrint Arch., 2012

Message Authentication, Revisited.
IACR Cryptol. ePrint Arch., 2012

Counterexamples to Hardness Amplification Beyond Negligible.
IACR Cryptol. ePrint Arch., 2012

Beating Shannon requires BOTH efficient adversaries AND non-zero advantage.
IACR Cryptol. ePrint Arch., 2012

On Continual Leakage of Discrete Log Representations.
IACR Cryptol. ePrint Arch., 2012

Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

On the Instantiability of Hash-and-Sign RSA Signatures.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Shannon Impossibility, Revisited.
Proceedings of the Information Theoretic Security - 6th International Conference, 2012

To Hash or Not to Hash Again? (In)Differentiability Results for H 2 and HMAC.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

Key-insulated symmetric key cryptography and mitigating attacks against cryptographic cloud software.
Proceedings of the 7th ACM Symposium on Information, Compuer and Communications Security, 2012

2011
Signcryption.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Storing Secrets on Continually Leaky Devices.
IACR Cryptol. ePrint Arch., 2011

On the (In)Security of RSA Signatures.
IACR Cryptol. ePrint Arch., 2011

Leftover Hash Lemma, Revisited.
IACR Cryptol. ePrint Arch., 2011

Privacy Amplification and Non-malleable Extractors via Character Sums.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Domain Extension for MACs Beyond the Birthday Barrier.
Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

2010
Concealment and Its Applications to Authenticated Encryption.
Proceedings of the Practical Signcryption, 2010

Cryptography Against Continuous Memory Attacks.
IACR Cryptol. ePrint Arch., 2010

Efficient Public-Key Cryptography in the Presence of Key Leakage.
IACR Cryptol. ePrint Arch., 2010

Public-Key Encryption Schemes with Auxiliary Inputs.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Changing base without losing space.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks.
Proceedings of the Advances in Cryptology, 2010

Practical leakage-resilient identity-based encryption from simple assumptions.
Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010

2009
Forward-Secure Hierarchical IBE with Applications to Broadcast Encryption.
Proceedings of the Identity-Based Cryptography, 2009

Proofs of Retrievability via Hardness Amplification.
IACR Cryptol. ePrint Arch., 2009

Salvaging Merkle-Damgard for Practical Applications.
IACR Cryptol. ePrint Arch., 2009

A Domain Extender for the Ideal Cipher.
IACR Cryptol. ePrint Arch., 2009

Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model.
IACR Cryptol. ePrint Arch., 2009

Public-Key Encryption in the Bounded-Retrieval Model.
IACR Cryptol. ePrint Arch., 2009

Composability and On-Line Deniability of Authentication.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Security Amplification for InteractiveCryptographic Primitives.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

On cryptography with auxiliary input.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Survey: Leakage Resilience and the Bounded Retrieval Model.
Proceedings of the Information Theoretic Security, 4th International Conference, 2009

Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6.
Proceedings of the Fast Software Encryption, 16th International Workshop, 2009

Message Authentication Codes from Unpredictable Block Ciphers.
Proceedings of the Advances in Cryptology, 2009

2008
Optimistic Fair Exchange in a Multi-user Setting.
J. UCS, 2008

Non-Malleable Extractors and Symmetric Key Cryptography from Weak Secrets.
IACR Cryptol. ePrint Arch., 2008

Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors.
IACR Cryptol. ePrint Arch., 2008

A New Mode of Operation for Block Ciphers and Length-Preserving MACs.
Proceedings of the Advances in Cryptology, 2008

Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs.
Proceedings of the Advances in Cryptology, 2008

Getting the Best Out of Existing Hash Functions; or What if We Are Stuck with SHA?.
Proceedings of the Applied Cryptography and Network Security, 6th International Conference, 2008

2007
Intrusion-Resilient Key Exchange in the Bounded Retrieval Model.
Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

Improving the Security of MACs Via Randomized Message Preprocessing.
Proceedings of the Fast Software Encryption, 14th International Workshop, 2007

Feistel Networks Made Public, and Applications.
Proceedings of the Advances in Cryptology, 2007

2006
How much can taxes help selfish routing?
J. Comput. Syst. Sci., 2006

Threshold and Proactive Pseudo-Random Permutations.
IACR Cryptol. ePrint Arch., 2006

Verifiable Random Permutations.
IACR Cryptol. ePrint Arch., 2006

Universally Composable Security with Global Setup.
IACR Cryptol. ePrint Arch., 2006

Does Privacy Require True Randomness?.
Electronic Colloquium on Computational Complexity (ECCC), 2006

Separating Sources for Encryption and Secret Sharing.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

On the Relation Between the Ideal Cipher and the Random Oracle Models.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Mercurial Commitments: Minimal Assumptions and Efficient Constructions.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

On the Impossibility of Extracting Classical Randomness Using a Quantum Computer.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets.
Proceedings of the Advances in Cryptology, 2006

2005
Signcryption.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Minimal Assumptions for Efficient Mercurial Commitments.
IACR Cryptol. ePrint Arch., 2005

Scalable public-key tracing and revoking.
Distributed Comput., 2005

Chosen-Ciphertext Security of Multiple Encryption.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Correcting errors without leaking partial information.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

On extractors, error-correction and hiding all partial information.
Proceedings of the IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005

Time Capsule Signature.
Proceedings of the Financial Cryptography and Data Security, 2005

Secure Remote Authentication Using Biometric Data.
Proceedings of the Advances in Cryptology, 2005

On the Generic Insecurity of the Full Domain Hash.
Proceedings of the Advances in Cryptology, 2005

Merkle-Damgård Revisited: How to Construct a Hash Function.
Proceedings of the Advances in Cryptology, 2005

2004
ID-Based Encryption for Complex Hierarchies with Applications to Forward Security and Broadcast Encryption.
IACR Cryptol. ePrint Arch., 2004

A Verifiable Random Function With Short Proofs and Keys.
IACR Cryptol. ePrint Arch., 2004

Entropic Security and the Encryption of High Entropy Messages.
IACR Cryptol. ePrint Arch., 2004

Optimal Signcryption from Any Trapdoor Permutation.
IACR Cryptol. ePrint Arch., 2004

On the (Im)possibility of Cryptography with Imperfect Randomness.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data.
Proceedings of the Advances in Cryptology, 2004

Anonymous Identification in Ad Hoc Groups.
Proceedings of the Advances in Cryptology, 2004

A Generic Construction for Intrusion-Resilient Public-Key Encryption.
Proceedings of the Topics in Cryptology, 2004

Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes.
Proceedings of the Advances in Cryptology, 2004

Multiparty Quantum Coin Flipping.
Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004

Versatile padding schemes for joint signature and encryption.
Proceedings of the 11th ACM Conference on Computer and Communications Security, 2004

Improved Randomness Extraction from Two Independent Sources.
Proceedings of the Approximation, 2004

2003
Breaking and Repairing Optimistic Fair Exchange from PODC 2003.
IACR Cryptol. ePrint Arch., 2003

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data.
IACR Cryptol. ePrint Arch., 2003

Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack.
IACR Cryptol. ePrint Arch., 2003

Concealment and its Applications to Authenticated Encryption.
IACR Cryptol. ePrint Arch., 2003

Pricing network edges for heterogeneous selfish users.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

On Extracting Private Randomness over a Public Channel.
Proceedings of the Approximation, 2003

Strong Key-Insulated Signature Schemes.
Proceedings of the Public Key Cryptography, 2003

Proactive Two-Party Signatures for User Authentication.
Proceedings of the Network and Distributed System Security Symposium, 2003

Proxy Cryptography Revisited.
Proceedings of the Network and Distributed System Security Symposium, 2003

Intrusion-Resilient Public-Key Encryption.
Proceedings of the Topics in Cryptology, 2003

2002
On the Power of Claw-Free Permutations.
IACR Cryptol. ePrint Arch., 2002

Key-Insulated Public-Key Cryptosystems.
IACR Cryptol. ePrint Arch., 2002

Efficient Construction of (Distributed) Verifiable Random Functions.
IACR Cryptol. ePrint Arch., 2002

On the Security of Joint Signature and Encryption.
IACR Cryptol. ePrint Arch., 2002

Exposure-Resilience for Free: The Hierarchical ID-based Encryption Case.
Proceedings of the First International IEEE Security in Storage Workshop, 2002

On the (non)Universality of the One-Time Pad.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Public Key Broadcast Encryption for Stateless Receivers.
Proceedings of the Security and Privacy in Digital Rights Management, 2002

2001
Universal configurations in light-flipping games.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Incremental Codes.
Proceedings of the Approximation, 2001

New Imperfect Random Source with Applications to Coin-Flipping.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

On Perfect and Adaptive Security in Exposure-Resilient Cryptography.
Proceedings of the Advances in Cryptology, 2001

2000
Exposure-resilient cryptography.
PhD thesis, 2000

Impossibility of Black-Box Reduction from Non-Adaptively to Adaptively Secure Coin-Flipping
Electronic Colloquium on Computational Complexity (ECCC), 2000

Exposure-Resilient Functions and All-or-Nothing Transforms.
Proceedings of the Advances in Cryptology, 2000

Parallel Reducibility for Information-Theoretically Secure Computation.
Proceedings of the Advances in Cryptology, 2000

A Cryptographic Solution to a Game Theoretic Problem.
Proceedings of the Advances in Cryptology, 2000

1999
Improved Testing Algorithms for Monotonicity.
Electronic Colloquium on Computational Complexity (ECCC), 1999

Design Networks with Bounded Pairwise Distance.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

The 2-Catalog Segmentation Problem.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Space Time Tradeoffs for Graph Properties.
Proceedings of the Automata, 1999

Lower Bounds for Oblivious Transfer Reductions.
Proceedings of the Advances in Cryptology, 1999


  Loading...