Stefano Tessaro

Chenzhi Zhu

Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Hiding in Plain Sight: Memory-Tight Proofs via Randomness Programming.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Better than Advertised Security for Non-interactive Threshold Signatures.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

On Seedless PRNGs and Premature Next.

[BibT_eX]

[DOI]

Sandro Coretti

Yevgeniy Dodis

Harish Karthikeyan

Noah Stephens-Davidowitz

Proceedings of the 3rd Conference on Information-Theoretic Cryptography, 2022

VeRSA: Verifiable Registries with Efficient Client Audits from RSA Authenticated Dictionaries.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021

Client-Auditable Verifiable Registries.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Quantum Key-Length Extension.

[BibT_eX]

[DOI]

Fang Song

Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Password Hashing and Preprocessing.

[BibT_eX]

[DOI]

Pooya Farshim

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

The t-wise Independence of Substitution-Permutation Networks.

[BibT_eX]

[DOI]

Tianren Liu

Vinod Vaikuntanathan

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Tight State-Restoration Soundness in the Algebraic Group Model.

[BibT_eX]

[DOI]

Ashrujit Ghoshal

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Tight Security for Key-Alternating Ciphers with Correlated Sub-keys.

[BibT_eX]

[DOI]

Xihu Zhang

Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

Better Security-Efficiency Trade-Offs in Permutation-Based Two-Party Computation.

[BibT_eX]

[DOI]

Yu Long Chen

Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020

PACT: Privacy-Sensitive Protocols And Mechanisms for Mobile Contact Tracing.

[BibT_eX]

[DOI]

Sudheesh Singanamalla

Jacob E. Sunshine

IEEE Data Eng. Bull., 2020

PACT: Privacy Sensitive Protocols and Mechanisms for Mobile Contact Tracing.

[BibT_eX]

[DOI]

Sudheesh Singanamalla

Jacob E. Sunshine

CoRR, 2020

Expected-Time Cryptography: Generic Techniques and Applications to Concrete Soundness.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Towards Defeating Backdoored Random Oracles: Indifferentiability with Bounded Adaptivity.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Super-Linear Time-Memory Trade-Offs for Symmetric Encryption.

[BibT_eX]

[DOI]

Wei Dai

Xihu Zhang

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

On the Query Complexity of Constructing PRFs from Non-adaptive PRFs.

[BibT_eX]

[DOI]

Pratik Soni

Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

On the Memory-Tightness of Hashed ElGamal.

[BibT_eX]

[DOI]

Ashrujit Ghoshal

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

The Memory-Tightness of Authenticated Encryption.

[BibT_eX]

[DOI]

Ashrujit Ghoshal

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019

Tight Time-Memory Trade-Offs for Symmetric Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Seedless Fruit Is the Sweetest: Random Number Generation, Revisited.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Memory-Hard Functions from Cryptographic Primitives.

[BibT_eX]

[DOI]

Binyi Chen

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018

Privacy and Efficiency Tradeoffs for Multiword Top <i>K</i> Search with Linear Additive Rank Scoring.

[BibT_eX]

[DOI]

Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Provable Time-Memory Trade-Offs: Symmetric Cryptography Against Memory-Bounded Adversaries.

[BibT_eX]

[DOI]

Aishwarya Thiruvengadam

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Foundations of Homomorphic Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Naor-Reingold Goes Public: The Complexity of Known-Key Security.

[BibT_eX]

[DOI]

Pratik Soni

Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Revisiting AES-GCM-SIV: Multi-user Security, Faster Key Derivation, and Better Bounds.

[BibT_eX]

[DOI]

Priyanka Bose

Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Pharos: Privacy Hazards of Replicating ORAM Stores.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Extending Database Technology, 2018

The Curse of Small Domains: New Attacks on Format-Preserving Encryption.

[BibT_eX]

[DOI]

Ni Trieu

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

The Multi-user Security of GCM, Revisited: Tight Bounds for Nonce Randomization.

[BibT_eX]

[DOI]

Aishwarya Thiruvengadam

Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017

Indistinguishability Obfuscation from Bilinear Maps and Block-Wise Local PRGs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Understanding the Security Challenges of Oblivious Cloud Storage with Asynchronous Accesses.

[BibT_eX]

[DOI]

Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

Public-Seed Pseudorandom Permutations.

[BibT_eX]

[DOI]

Pratik Soni

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

The Multi-user Security of Double Encryption.

[BibT_eX]

[DOI]

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

Scrypt Is Maximally Memory-Hard.

[BibT_eX]

[DOI]

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

Indistinguishability Obfuscation from Trilinear Maps and Block-Wise Local PRGs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Information-Theoretic Indistinguishability via the Chi-Squared Method.

[BibT_eX]

[DOI]

Wei Dai

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016

How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction.

[BibT_eX]

[DOI]

J. Cryptol., 2016

Simultaneous Secrecy and Reliability Amplification for a General Channel Model.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Oblivious Parallel RAM: Improved Efficiency and Generic Constructions.

[BibT_eX]

[DOI]

Binyi Chen

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Two-Round Man-in-the-Middle Security from LPN.

[BibT_eX]

[DOI]

David Cash

Eike Kiltz

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Contention in Cryptoland: Obfuscation, Leakage and UCE.

[BibT_eX]

[DOI]

Igors Stepanovs

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

TaoStore: Overcoming Asynchronicity in Oblivious Data Storage.

[BibT_eX]

[DOI]

Proceedings of the IEEE Symposium on Security and Privacy, 2016

Provably Robust Sponge-Based PRNGs and KDFs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Hash-Function Based PRFs: AMAC and Its Multi-User Security.

[BibT_eX]

[DOI]

Daniel J. Bernstein

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Message-Recovery Attacks on Feistel-Based Format Preserving Encryption.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015

Tight Bounds for Keyed Sponges and Truncated CBC.

[BibT_eX]

[DOI]

Krzysztof Pietrzak

IACR Cryptol. ePrint Arch., 2015

Obfuscation of Probabilistic Circuits and Applications.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Secret-key cryptography from ideal primitives: A systematic overview.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes.

[BibT_eX]

[DOI]

Proceedings of the Fast Software Encryption - 22nd International Workshop, 2015

The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC.

[BibT_eX]

[DOI]

Krzysztof Pietrzak

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Optimally Secure Block Ciphers from Ideal Primitives.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

Generic Security of NMAC and HMAC with Input Whitening.

[BibT_eX]

[DOI]

Krzysztof Pietrzak

2014

Bounded-Collusion Identity-Based Encryption from Semantically-Secure Public-Key Encryption: Generic Constructions with Short Ciphertexts.

[BibT_eX]

[DOI]

David A. Wilson

Proceedings of the Public-Key Cryptography - PKC 2014, 2014

The Locality of Searchable Symmetric Encryption.

[BibT_eX]

[DOI]

David Cash

Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation.

[BibT_eX]

[DOI]

Igors Stepanovs

Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 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

Poly-Many Hardcore Bits for Any One-Way Function.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Communication Locality in Secure Multi-party Computation - How to Run Sublinear Algorithms in a Distributed Setting.

[BibT_eX]

[DOI]

Elette Boyle

Shafi Goldwasser

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

An equational approach to secure multi-party computation.

[BibT_eX]

[DOI]

Daniele Micciancio

Proceedings of the Innovations in Theoretical Computer Science, 2013

On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Coding - 14th IMA International Conference, 2013

Amplification of Chosen-Ciphertext Security.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2013

Bounds on inference.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012

A Cryptographic Treatment of the Wiretap Channel.

[BibT_eX]

[DOI]

Alexander Vardy

IACR Cryptol. ePrint Arch., 2012

Polynomial-Time, Semantically-Secure Encryption Achieving the Secrecy Capacity.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 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

Semantic Security for the Wiretap Channel.

[BibT_eX]

[DOI]

Alexander Vardy

Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

Multi-instance Security and Its Application to Password-Based Cryptography.

[BibT_eX]

[DOI]

Thomas Ristenpart

Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

2011

Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

The equivalence of the random oracle model and the ideal cipher model, revisited.

[BibT_eX]

[DOI]

Thomas Holenstein

Robin Künzler

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

2010

Computational Indistinguishability Amplification.

[BibT_eX]

[DOI]

PhD thesis, 2010

A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch.

[BibT_eX]

[DOI]

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

Random Oracles with(out) Programmability.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009

Abstract Storage Devices.

[BibT_eX]

[DOI]

Robert König

Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Computational Indistinguishability Amplification: Tight Product Theorems for System Composition.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical.

[BibT_eX]

[DOI]

Anja Lehmann

Proceedings of the Advances in Cryptology, 2009

2008

Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2008

2007

Domain Extension of Public Random Functions: Beyond the Birthday Barrier.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

2006

Optimal Resilience for Erasure-Coded Byzantine Distributed Storage.

[BibT_eX]

[DOI]

Christian Cachin

Proceedings of the 2006 International Conference on Dependable Systems and Networks (DSN 2006), 2006

2005

Asynchronous Verifiable Information Dispersal.

[BibT_eX]

[DOI]

Christian Cachin

Proceedings of the Distributed Computing, 19th International Conference, 2005

Asynchronous Veri.able Information Dispersal.

[BibT_eX]

[DOI]

Christian Cachin