Krzysztof Pietrzak

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

The Cost of Adaptivity in Security Games on Graphs.

[BibT_eX]

[DOI]

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

Trojan-Resilience Without Cryptography.

[BibT_eX]

[DOI]

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

Grafting Key Trees: Efficient Key Management for Overlapping Groups.

[BibT_eX]

[DOI]

Michael Walter

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

Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.

[BibT_eX]

[DOI]

Karen Klein

Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

LightPIR: Privacy-Preserving Route Discovery for Payment Channel Networks.

[BibT_eX]

[DOI]

Proceedings of the IFIP Networking Conference, 2021

Inverse-Sybil Attacks in Automated Contact Tracing.

[BibT_eX]

[DOI]

Benedikt Auerbach

Suvradip Chakraborty

Karen Klein

Michael Walter

Michelle Yeo

Proceedings of the Topics in Cryptology - CT-RSA 2021, 2021

Limits on the Adaptive Security of Yao's Garbling.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020

Delayed Authentication: Preventing Replay and Relay Attacks in Private Contact Tracing.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology - INDOCRYPT 2020, 2020

2019

PPAD-Hardness via Iterated Squaring Modulo a Composite.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Keep the Dirt: Tainted TreeKEM, an Efficient and Provably Secure Continuous Group Key Agreement Protocol.

[BibT_eX]

[DOI]

Michael Walter

IACR Cryptol. ePrint Arch., 2019

Finding a Nash equilibrium is no easier than breaking Fiat-Shamir.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Adaptively Secure Proxy Re-encryption.

[BibT_eX]

[DOI]

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

Simple Verifiable Delay Functions.

[BibT_eX]

[DOI]

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Proofs of Catalytic Space.

[BibT_eX]

[DOI]

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Reversible Proofs of Sequential Work.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

2018

SpaceMint: A Cryptocurrency Based on Proofs of Space.

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography and Data Security, 2018

Simple Proofs of Sequential Work.

[BibT_eX]

[DOI]

Bram Cohen

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

Sustained Space Complexity.

[BibT_eX]

[DOI]

Joël Alwen

Jeremiah Blocki

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

On the Memory-Hardness of Data-Independent Password-Hashing Functions.

[BibT_eX]

[DOI]

Proceedings of the 2018 on Asia Conference on Computer and Communications Security, 2018

2017

The Exact Security of PMAC.

[BibT_eX]

[DOI]

Michal Rybár

IACR Cryptol. ePrint Arch., 2017

Position-Based Cryptography and Multiparty Communication Complexity.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Non-Uniform Attacks Against Pseudoentropy.

[BibT_eX]

[DOI]

Maciej Skorski

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 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

Depth-Robust Graphs and Their Cumulative Memory Complexity.

[BibT_eX]

[DOI]

Joël Alwen

Jeremiah Blocki

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

Be Adaptive, Avoid Overcommitting.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Beyond Hellman's Time-Memory Trade-Offs with Applications to Proofs of Space.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016

Robust Multi-Property Combiners for Hash Functions.

[BibT_eX]

[DOI]

Marc Fischlin

Anja Lehmann

IACR Cryptol. ePrint Arch., 2016

A counterexample to the chain rule for conditional HILL entropy.

[BibT_eX]

[DOI]

Comput. Complex., 2016

Pseudoentropy: Lower-Bounds for Chain Rules and Transformations.

[BibT_eX]

[DOI]

Maciej Skórski

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

Standard Security Does Imply Security Against Selective Opening for Markov Distributions.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 13th International Conference, 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

Constrained PRFs for Unbounded Inputs.

[BibT_eX]

[DOI]

Hamza Abusalah

Georg Fuchsbauer

Proceedings of the Topics in Cryptology - CT-RSA 2016 - The Cryptographers' Track at the RSA Conference 2016, San Francisco, CA, USA, February 29, 2016

Offline Witness Encryption.

[BibT_eX]

[DOI]

Hamza Abusalah

Georg Fuchsbauer

Proceedings of the Applied Cryptography and Network Security, 2016

2015

Standard Security Does Imply Security Against Selective Opening for Markov Distributions.

[BibT_eX]

[DOI]

Felix Heuer

IACR Cryptol. ePrint Arch., 2015

Tight Bounds for Keyed Sponges and Truncated CBC.

[BibT_eX]

[DOI]

Stefano Tessaro

IACR Cryptol. ePrint Arch., 2015

Key-Homomorphic Constrained Pseudorandom Functions.

[BibT_eX]

[DOI]

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

The Chain Rule for HILL Pseudoentropy, Revisited.

[BibT_eX]

[DOI]

Maciej Skorski

Proceedings of the Progress in Cryptology - LATINCRYPT 2015, 2015

Condensed Unpredictability.

[BibT_eX]

[DOI]

Maciej Skorski

Alexander Golovnev

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings.

[BibT_eX]

[DOI]

Proceedings of the Computer Security - ESORICS 2015, 2015

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

[BibT_eX]

[DOI]

Stefano Tessaro

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

A Quasipolynomial Reduction for Generalized Selective Decryption on Trees.

[BibT_eX]

[DOI]

Georg Fuchsbauer

Zahra Jafargholi

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Proofs of Space.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators.

[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]

Stefano Tessaro

2014

How to Fake Auxiliary Input.

[BibT_eX]

[DOI]

Dimitar Jetchev

Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Simple Chosen-Ciphertext Security from Low-Noise LPN.

[BibT_eX]

[DOI]

Daniel Masny

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

Key Derivation without Entropy Waste.

[BibT_eX]

[DOI]

Daniel Wichs

Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

The Exact PRF-Security of NMAC and HMAC.

[BibT_eX]

[DOI]

Michal Rybár

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

Adaptive Security of Constrained PRFs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013

A Closer Look at HMAC.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

A Counterexample to the Chain Rule for Conditional HILL Entropy - And What Deniable Encryption Has to Do with It.

[BibT_eX]

[DOI]

Stephan Krenn

Akshay Wadia

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

Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions.

[BibT_eX]

[DOI]

Mario Szegedy

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Learning with Rounding, Revisited - New Reduction, Properties and Applications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012

Digital Signatures with Minimal Overhead.

[BibT_eX]

[DOI]

Mario Szegedy

IACR Cryptol. ePrint Arch., 2012

Commitments and Efficient Zero-Knowledge Proofs from Hard Learning Problems.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Lossy Functions Do Not Amplify Well.

[BibT_eX]

[DOI]

Alon Rosen

Gil Segev

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

Subspace LWE.

[BibT_eX]

[DOI]

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

Hardness Preserving Constructions of Pseudorandom Functions.

[BibT_eX]

[DOI]

Abhishek Jain

Aris Tentes

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

Cryptography from Learning Parity with Noise.

[BibT_eX]

[DOI]

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

Lapin: An Efficient Authentication Protocol Based on Ring-LPN.

[BibT_eX]

[DOI]

Proceedings of the Fast Software Encryption - 19th International Workshop, 2012

Message Authentication, Revisited.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Practical Leakage-Resilient Symmetric Cryptography.

[BibT_eX]

[DOI]

Sebastian Faust

Joachim Schipper

Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2012, 2012

Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011

Parallel Repetition for Leakage Resilience Amplification Revisited.

[BibT_eX]

[DOI]

Abhishek Jain

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

Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience.

[BibT_eX]

[DOI]

Sebastian Faust

François-Xavier Standaert

Daniele Venturi

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Efficient Authentication from Hard Learning Problems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

Leftover Hash Lemma, Revisited.

[BibT_eX]

[DOI]

Yu Yu

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010

An Efficient Parallel Repetition Theorem.

[BibT_eX]

[DOI]

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

Leakage-Resilient Signatures.

[BibT_eX]

[DOI]

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

Non-Malleable Codes.

[BibT_eX]

[DOI]

Daniel Wichs

Proceedings of the Innovations in Computer Science, 2010

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2010

Leakage Resilient ElGamal Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009

A Leakage-Resilient Mode of Operation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

A New Randomness Extraction Paradigm for Hybrid Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

On the Security of Padding-Based Encryption Schemes - or - Why We Cannot Prove OAEP Secure in the Standard Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

2008

Leakage-Resilient Cryptography in the Standard Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Weak Pseudorandom Functions in Minicrypt.

[BibT_eX]

[DOI]

Johan Sjödin

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Robust Multi-property Combiners for Hash Functions Revisited.

[BibT_eX]

[DOI]

Marc Fischlin

Anja Lehmann

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Leakage-Resilient Cryptography.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

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

[BibT_eX]

[DOI]

Prashant Puniya

Proceedings of the Advances in Cryptology, 2008

Compression from Collisions, or Why CRHF Combiners Have a Long Output.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2008

2007

Parallel Repetition of Computationally Sound Protocols Revisited.

[BibT_eX]

[DOI]

Douglas Wikström

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

Intrusion-Resilient Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007

Range Extension for Weak PRFs; The Good, the Bad, and the Ugly.

[BibT_eX]

[DOI]

Johan Sjödin

Proceedings of the Advances in Cryptology, 2007

Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don't Exist.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

Indistinguishability Amplification.

[BibT_eX]

[DOI]

Ueli M. Maurer

Renato Renner

Proceedings of the Advances in Cryptology, 2007

2006

Indistinguishability and composition of random systems.

[BibT_eX]

[DOI]

PhD thesis, 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

A Tight Bound for EMAC.

[BibT_eX]

[DOI]

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

Composition Implies Adaptive Security in Minicrypt.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

Luby-Rackoff Ciphers from Weak Round Functions?

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

2005

Composition Does Not Imply Adaptive Security.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

On the Generic Insecurity of the Full Domain Hash.

[BibT_eX]

[DOI]

Roberto Oliveira