Yevgeniy Dodis

Proceedings of the 51st Annual Conference on Information Sciences and Systems, 2017

2016

Spooky Encryption and its Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

A Formal Treatment of Backdoored Pseudorandom Generators.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

2015

Message Transmission with Reverse Firewalls - Secure Communication on Corrupted Machines.

[BibT_eX]

[DOI]

Ilya Mironov

Noah Stephens-Davidowitz

IACR Cryptol. ePrint Arch., 2015

Indifferentiability of Confusion-Diffusion Networks.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Non-Malleable Encryption: Simpler, Shorter, Stronger.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Privacy with Imperfect Randomness.

[BibT_eX]

[DOI]

Yanqing Yao

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014

Privacy Amplification and Nonmalleable Extractors Via Character Sums.

[BibT_eX]

[DOI]

SIAM J. Comput., 2014

Privacy and Imperfect Randomness.

[BibT_eX]

[DOI]

Yanqing Yao

IACR Cryptol. ePrint Arch., 2014

Interactive Coding for Interactive Proofs.

[BibT_eX]

[DOI]

Allison Bishop Lewko

IACR Cryptol. ePrint Arch., 2014

Non-malleable Reductions and Applications.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2014

Interactive Encryption and Message Authentication.

[BibT_eX]

[DOI]

Dario Fiore

Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

2013

To Hash or Not to Hash Again? (In)differentiability Results for H<sup>2</sup> and HMAC.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Key Derivation Without Entropy Waste.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Security Analysis of Pseudo-Random Number Generators with Input: /dev/random is not Robust.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Interactive Encryption, Message Authentication, and Anonymous Key Exchange.

[BibT_eX]

[DOI]

Dario Fiore

IACR Cryptol. ePrint Arch., 2013

On the Indifferentiability of Key-Alternating Ciphers.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Amplifying Privacy in Privacy Amplification.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

2012

Robust Fuzzy Extractors and Authenticated Key Agreement From Close Secrets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

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

[BibT_eX]

[DOI]

Richard Cole

Tim Roughgarden

Networks, 2012

Differential Privacy with Imperfect Randomness.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Message Authentication, Revisited.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Counterexamples to Hardness Amplification Beyond Negligible.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Beating Shannon requires BOTH efficient adversaries AND non-zero advantage.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

On Continual Leakage of Discrete Log Representations.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources.

[BibT_eX]

[DOI]

Thomas Ristenpart

Salil P. Vadhan

Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

On the Instantiability of Hash-and-Sign RSA Signatures.

[BibT_eX]

[DOI]

Iftach Haitner

Aris Tentes

Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Overcoming weak expectations.

[BibT_eX]

[DOI]

Yu Yu

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Shannon Impossibility, Revisited.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

Key-insulated symmetric key cryptography and mitigating attacks against cryptographic cloud software.

[BibT_eX]

[DOI]

Proceedings of the 7th ACM Symposium on Information, Compuer and Communications Security, 2012

2011

Signcryption.

[BibT_eX]

[DOI]

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

Storing Secrets on Continually Leaky Devices.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

On the (In)Security of RSA Signatures.

[BibT_eX]

[DOI]

François-Xavier Standaert

Iftach Haitner

Aris Tentes

IACR Cryptol. ePrint Arch., 2011

Leftover Hash Lemma, Revisited.

[BibT_eX]

[DOI]

Yu Yu

IACR Cryptol. ePrint Arch., 2011

Privacy Amplification and Non-malleable Extractors via Character Sums.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Domain Extension for MACs Beyond the Birthday Barrier.

[BibT_eX]

[DOI]

John P. Steinberger

Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

2010

Concealment and Its Applications to Authenticated Encryption.

[BibT_eX]

[DOI]

Proceedings of the Practical Signcryption, 2010

Cryptography Against Continuous Memory Attacks.

[BibT_eX]

[DOI]

Kristiyan Haralambiev

Adriana López-Alt

IACR Cryptol. ePrint Arch., 2010

Efficient Public-Key Cryptography in the Presence of Key Leakage.

[BibT_eX]

[DOI]

Kristiyan Haralambiev

Adriana López-Alt

IACR Cryptol. ePrint Arch., 2010

Public-Key Encryption Schemes with Auxiliary Inputs.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Changing base without losing space.

[BibT_eX]

[DOI]

Mihai Patrascu

Mikkel Thorup

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2010

Practical leakage-resilient identity-based encryption from simple assumptions.

[BibT_eX]

[DOI]

Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010

2009

Forward-Secure Hierarchical IBE with Applications to Broadcast Encryption.

[BibT_eX]

[DOI]

Proceedings of the Identity-Based Cryptography, 2009

Proofs of Retrievability via Hardness Amplification.

[BibT_eX]

[DOI]

Salil P. Vadhan

IACR Cryptol. ePrint Arch., 2009

Salvaging Merkle-Damgard for Practical Applications.

[BibT_eX]

[DOI]

Thomas Ristenpart

Thomas Shrimpton

IACR Cryptol. ePrint Arch., 2009

A Domain Extender for the Ideal Cipher.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model.

[BibT_eX]

[DOI]

Joël Alwen

IACR Cryptol. ePrint Arch., 2009

Public-Key Encryption in the Bounded-Retrieval Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Composability and On-Line Deniability of Authentication.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Security Amplification for InteractiveCryptographic Primitives.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

On cryptography with auxiliary input.

[BibT_eX]

[DOI]

Yael Tauman Kalai

Shachar Lovett

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Survey: Leakage Resilience and the Bounded Retrieval Model.

[BibT_eX]

[DOI]

Joël Alwen

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.

[BibT_eX]

[DOI]

Proceedings of the Fast Software Encryption, 16th International Workshop, 2009

Message Authentication Codes from Unpredictable Block Ciphers.

[BibT_eX]

[DOI]

John P. Steinberger

Proceedings of the Advances in Cryptology, 2009

2008

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Optimistic Fair Exchange in a Multi-user Setting.

[BibT_eX]

[DOI]

Pil Joong Lee

Dae Hyun Yum

J. Univers. Comput. Sci., 2008

Non-Malleable Extractors and Symmetric Key Cryptography from Weak Secrets.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

A New Mode of Operation for Block Ciphers and Length-Preserving MACs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2008

Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

Victor Shoup

Shabsi Walfish

Proceedings of the Advances in Cryptology, 2008

Getting the Best Out of Existing Hash Functions; or What if We Are Stuck with SHA?.

[BibT_eX]

[DOI]

Proceedings of the Applied Cryptography and Network Security, 6th International Conference, 2008

2007

Intrusion-Resilient Key Exchange in the Bounded Retrieval Model.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

Improving the Security of MACs Via Randomized Message Preprocessing.

[BibT_eX]

[DOI]

Proceedings of the Fast Software Encryption, 14th International Workshop, 2007

Feistel Networks Made Public, and Applications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

2006

How much can taxes help selfish routing?

[BibT_eX]

[DOI]

Richard Cole

Tim Roughgarden

J. Comput. Syst. Sci., 2006

Threshold and Proactive Pseudo-Random Permutations.

[BibT_eX]

[DOI]

Aleksandr Yampolskiy

Moti Yung

IACR Cryptol. ePrint Arch., 2006

Verifiable Random Permutations.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2006

Universally Composable Security with Global Setup.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2006

Does Privacy Require True Randomness?.

[BibT_eX]

[DOI]

Carl Bosley

Electron. Colloquium Comput. Complex., 2006

Separating Sources for Encryption and Secret Sharing.

[BibT_eX]

[DOI]

Bartosz Przydatek

Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

On the Relation Between the Ideal Cipher and the Random Oracle Models.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Mercurial Commitments: Minimal Assumptions and Efficient Constructions.

[BibT_eX]

[DOI]

Dario Catalano

Ivan Visconti

Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

On the Impossibility of Extracting Classical Randomness Using a Quantum Computer.

[BibT_eX]

[DOI]

Renato Renner

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2006

2005

Signcryption.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Cryptography and Security, 2005

Minimal Assumptions for Efficient Mercurial Commitments.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2005

Scalable public-key tracing and revoking.

[BibT_eX]

[DOI]

Distributed Comput., 2005

Chosen-Ciphertext Security of Multiple Encryption.

[BibT_eX]

[DOI]

Jonathan Katz

Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Correcting errors without leaking partial information.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

On extractors, error-correction and hiding all partial information.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005

Time Capsule Signature.

[BibT_eX]

[DOI]

Dae Hyun Yum

Proceedings of the Financial Cryptography and Data Security, 2005

Secure Remote Authentication Using Biometric Data.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

On the Generic Insecurity of the Full Domain Hash.

[BibT_eX]

[DOI]

Roberto Oliveira

Proceedings of the Advances in Cryptology, 2005

Merkle-Damgård Revisited: How to Construct a Hash Function.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

2004

ID-Based Encryption for Complex Hierarchies with Applications to Forward Security and Broadcast Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

A Verifiable Random Function With Short Proofs and Keys.

[BibT_eX]

[DOI]

Aleksandr Yampolskiy

IACR Cryptol. ePrint Arch., 2004

Entropic Security and the Encryption of High Entropy Messages.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

Optimal Signcryption from Any Trapdoor Permutation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

On the (Im)possibility of Cryptography with Imperfect Randomness.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Leonid Reyzin

Proceedings of the Advances in Cryptology, 2004

Anonymous Identification in Ad Hoc Groups.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2004

A Generic Construction for Intrusion-Resilient Public-Key Encryption.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology, 2004

Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2004

Multiparty Quantum Coin Flipping.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004

Versatile padding schemes for joint signature and encryption.

[BibT_eX]

[DOI]

Proceedings of the 11th ACM Conference on Computer and Communications Security, 2004

Improved Randomness Extraction from Two Independent Sources.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2004

2003

Breaking and Repairing Optimistic Fair Exchange from PODC 2003.

[BibT_eX]

[DOI]

Leonid Reyzin

IACR Cryptol. ePrint Arch., 2003

Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack.

[BibT_eX]

[DOI]

Nelly Fazio

IACR Cryptol. ePrint Arch., 2003

Concealment and its Applications to Authenticated Encryption.

[BibT_eX]

[DOI]

Jee Hea An

IACR Cryptol. ePrint Arch., 2003

Pricing network edges for heterogeneous selfish users.

[BibT_eX]

[DOI]

Richard Cole

Tim Roughgarden

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

On Extracting Private Randomness over a Public Channel.

[BibT_eX]

[DOI]

Roberto Oliveira

Proceedings of the Approximation, 2003

Strong Key-Insulated Signature Schemes.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography, 2003

Proactive Two-Party Signatures for User Authentication.

[BibT_eX]

[DOI]

Proceedings of the Network and Distributed System Security Symposium, 2003

Proxy Cryptography Revisited.

[BibT_eX]

[DOI]

Anca-Andreea Ivan

Proceedings of the Network and Distributed System Security Symposium, 2003

Intrusion-Resilient Public-Key Encryption.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology, 2003

2002

On the Power of Claw-Free Permutations.

[BibT_eX]

[DOI]

Leonid Reyzin

IACR Cryptol. ePrint Arch., 2002

Key-Insulated Public-Key Cryptosystems.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2002

Efficient Construction of (Distributed) Verifiable Random Functions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2002

On the Security of Joint Signature and Encryption.

[BibT_eX]

[DOI]

Jee Hea An

Tal Rabin

IACR Cryptol. ePrint Arch., 2002

Exposure-Resilience for Free: The Hierarchical ID-based Encryption Case.

[BibT_eX]

[DOI]

Moti Yung

Proceedings of the First International IEEE Security in Storage Workshop, 2002

On the (non)Universality of the One-Time Pad.

[BibT_eX]

[DOI]

Joel Spencer

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Public Key Broadcast Encryption for Stateless Receivers.

[BibT_eX]

[DOI]

Nelly Fazio

Proceedings of the Security and Privacy in Digital Rights Management, 2002

2001

Universal configurations in light-flipping games.

[BibT_eX]

[DOI]

Peter Winkler

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Incremental Codes.

[BibT_eX]

[DOI]

Shai Halevi

Proceedings of the Approximation, 2001

New Imperfect Random Source with Applications to Coin-Flipping.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

On Perfect and Adaptive Security in Exposure-Resilient Cryptography.

[BibT_eX]

[DOI]

Amit Sahai

Proceedings of the Advances in Cryptology, 2001

2000

Exposure-resilient cryptography.

[BibT_eX]

[DOI]

PhD thesis, 2000

Impossibility of Black-Box Reduction from Non-Adaptively to Adaptively Secure Coin-Flipping

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2000

Exposure-Resilient Functions and All-or-Nothing Transforms.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2000

Parallel Reducibility for Information-Theoretically Secure Computation.

[BibT_eX]

[DOI]

Silvio Micali

Proceedings of the Advances in Cryptology, 2000

A Cryptographic Solution to a Game Theoretic Problem.

[BibT_eX]

[DOI]

Shai Halevi

Tal Rabin

Proceedings of the Advances in Cryptology, 2000

1999

Improved Testing Algorithms for Monotonicity.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1999

Design Networks with Bounded Pairwise Distance.

[BibT_eX]

[DOI]

Sanjeev Khanna

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

The 2-Catalog Segmentation Problem.

[BibT_eX]

[DOI]

Venkatesan Guruswami

Sanjeev Khanna

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Space Time Tradeoffs for Graph Properties.

[BibT_eX]

[DOI]

Sanjeev Khanna

Proceedings of the Automata, 1999

Lower Bounds for Oblivious Transfer Reductions.

[BibT_eX]

[DOI]