| Publication | Date of Publication | Type |
|---|
| Certifying giant nonprimes | 2023-11-24 | Paper |
| Practical statistically-sound proofs of exponentiation in any group | 2023-06-28 | Paper |
| \textsc{Hide} \& \textsc{Seek}: privacy-preserving rebalancing on payment channel networks | 2023-05-26 | Paper |
| Trojan-resilience without cryptography | 2023-04-13 | Paper |
| On treewidth, separators and Yao's garbling | 2023-04-13 | Paper |
| Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings | 2022-08-19 | Paper |
| Proofs of Catalytic Space | 2022-07-18 | Paper |
| Simple verifiable delay functions | 2022-07-18 | Paper |
| Delayed authentication: preventing replay and relay attacks in private contact tracing | 2022-07-06 | Paper |
| Limits on the adaptive security of Yao's garbling | 2022-04-22 | Paper |
| Non-Uniform Attacks Against Pseudoentropy | 2020-05-27 | Paper |
| Finding a Nash equilibrium is no easier than breaking Fiat-Shamir | 2020-01-30 | Paper |
| Adaptively secure proxy re-encryption | 2020-01-28 | Paper |
| Non-Malleable Codes | 2018-12-06 | Paper |
| Sustained space complexity | 2018-07-09 | Paper |
| Simple proofs of sequential work | 2018-07-09 | Paper |
| Beyond Hellman's time-memory trade-offs with applications to proofs of space | 2018-03-08 | Paper |
| Efficient authentication from hard learning problems | 2018-02-15 | Paper |
| Position-based cryptography and multiparty communication complexity | 2018-01-19 | Paper |
| Be adaptive, avoid overcommitting | 2017-11-03 | Paper |
| Depth-Robust Graphs and Their Cumulative Memory Complexity | 2017-06-23 | Paper |
| Scrypt Is Maximally Memory-Hard | 2017-06-23 | Paper |
| Pseudoentropy: Lower-Bounds for Chain Rules and Transformations | 2016-12-21 | Paper |
| A counterexample to the chain rule for conditional HILL entropy | 2016-10-28 | Paper |
| Offline Witness Encryption | 2016-10-04 | Paper |
| On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model | 2016-07-15 | Paper |
| New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators | 2016-06-10 | Paper |
| Constrained PRFs for Unbounded Inputs | 2016-04-08 | Paper |
| Generic Security of NMAC and HMAC with Input Whitening | 2016-03-23 | Paper |
| Standard Security Does Imply Security Against Selective Opening for Markov Distributions | 2016-03-23 | Paper |
| Proofs of Space | 2015-12-10 | Paper |
| The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC | 2015-12-10 | Paper |
| A Quasipolynomial Reduction for Generalized Selective Decryption on Trees | 2015-12-10 | Paper |
| Condensed Unpredictability | 2015-10-27 | Paper |
| The Chain Rule for HILL Pseudoentropy, Revisited | 2015-09-17 | Paper |
| Key-Homomorphic Constrained Pseudorandom Functions | 2015-07-06 | Paper |
| Adaptive Security of Constrained PRFs | 2015-01-06 | Paper |
| Robust multi-property combiners for hash functions | 2014-09-25 | Paper |
| The Exact PRF-Security of NMAC and HMAC | 2014-08-07 | Paper |
| Key Derivation without Entropy Waste | 2014-05-27 | Paper |
| Simple Chosen-Ciphertext Security from Low-Noise LPN | 2014-03-25 | Paper |
| How to Fake Auxiliary Input | 2014-02-18 | Paper |
| Learning with Rounding, Revisited | 2013-09-02 | Paper |
| Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions | 2013-09-02 | Paper |
| Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise | 2013-03-19 | Paper |
| A Counterexample to the Chain Rule for Conditional HILL Entropy | 2013-03-18 | Paper |
| Lapin: An Efficient Authentication Protocol Based on Ring-LPN | 2013-01-08 | Paper |
| Practical Leakage-Resilient Symmetric Cryptography | 2012-11-13 | Paper |
| Message Authentication, Revisited | 2012-06-29 | Paper |
| Cryptography from Learning Parity with Noise | 2012-06-15 | Paper |
| Hardness Preserving Constructions of Pseudorandom Functions | 2012-06-15 | Paper |
| Lossy Functions Do Not Amplify Well | 2012-06-15 | Paper |
| Subspace LWE | 2012-06-15 | Paper |
| Parallel repetition of computationally sound protocols revisited | 2012-05-23 | Paper |
| Leftover Hash Lemma, Revisited | 2011-08-12 | Paper |
| Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience | 2011-07-06 | Paper |
| Efficient Authentication from Hard Learning Problems | 2011-05-27 | Paper |
| Parallel Repetition for Leakage Resilience Amplification Revisited | 2011-05-19 | Paper |
| Leakage Resilient ElGamal Encryption | 2010-12-07 | Paper |
| Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks | 2010-08-24 | Paper |
| An Efficient Parallel Repetition Theorem | 2010-02-24 | Paper |
| Leakage-Resilient Signatures | 2010-02-24 | Paper |
| Theory of Cryptography | 2009-05-14 | Paper |
| On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model | 2009-05-12 | Paper |
| A Leakage-Resilient Mode of Operation | 2009-05-12 | Paper |
| A New Randomness Extraction Paradigm for Hybrid Encryption | 2009-05-12 | Paper |
| Indistinguishability Amplification | 2009-03-10 | Paper |
| Compression from Collisions, or Why CRHF Combiners Have a Long Output | 2009-02-10 | Paper |
| Improving the Security of MACs Via Randomized Message Preprocessing | 2008-09-16 | Paper |
| Weak Pseudorandom Functions in Minicrypt | 2008-08-19 | Paper |
| Robust Multi-property Combiners for Hash Functions Revisited | 2008-08-19 | Paper |
| A New Mode of Operation for Block Ciphers and Length-Preserving MACs | 2008-04-15 | Paper |
| Composition Does Not Imply Adaptive Security | 2008-03-17 | Paper |
| On the Generic Insecurity of the Full Domain Hash | 2008-03-17 | Paper |
| Improved Security Analyses for CBC MACs | 2008-03-17 | Paper |
| Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist | 2007-11-29 | Paper |
| Range Extension for Weak PRFs; The Good, the Bad, and the Ugly | 2007-11-29 | Paper |
| Composition Implies Adaptive Security in Minicrypt | 2007-09-24 | Paper |
| Luby-Rackoff Ciphers from Weak Round Functions? | 2007-09-24 | Paper |
| A Tight Bound for EMAC | 2007-09-11 | Paper |
| Parallel Repetition of Computationally Sound Protocols Revisited | 2007-08-30 | Paper |
| Theory of Cryptography | 2007-02-12 | Paper |
| On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4434898 | 2003-11-26 | Paper |
