| Publication | Date of Publication | Type |
|---|
| CDS composition of multi-round protocols | 2024-12-13 | Paper |
| Nondeterministic interactive refutations for nearest Boolean vector | 2024-11-14 | Paper |
| PPP-completeness and extremal combinatorics | 2024-09-25 | Paper |
| Downward self-reducibility in TFNP | 2024-09-25 | Paper |
| Public-key encryption, local pseudorandom generators, and the low-degree method | 2024-08-01 | Paper |
| Public-key encryption from homogeneous CLWE | 2023-08-14 | Paper |
| One-Way Functions and (Im)perfect Obfuscation | 2023-04-04 | Paper |
| Acyclicity programming for sigma-protocols | 2023-03-31 | Paper |
| Cryptography from one-way communication: on completeness of finite channels | 2023-03-29 | Paper |
| Non-interactive composition of sigma-protocols via Share-then-Hash | 2023-03-29 | Paper |
| Cryptography from Information Loss. | 2023-02-03 | Paper |
| Limits on the efficiency of (ring) LWE based non-interactive key exchange | 2022-10-13 | Paper |
| PPP-Completeness and Extremal Combinatorics | 2022-09-11 | Paper |
| Time- and space-efficient arguments from groups of unknown order | 2022-05-18 | Paper |
| Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration | 2022-04-22 | Paper |
| Public-coin zero-knowledge arguments with (almost) minimal time and space overheads | 2022-03-23 | Paper |
| Pseudorandom functions: three decades later | 2022-01-12 | Paper |
| Limits on the efficiency of (ring) LWE-based non-interactive key exchange | 2021-11-24 | Paper |
| An Algebraic Approach to Nonmalleability | 2021-10-18 | Paper |
| Can PPAD hardness be based on standard cryptographic assumptions? | 2021-04-07 | Paper |
| Finding a Nash equilibrium is no easier than breaking Fiat-Shamir | 2020-01-30 | Paper |
| Securing Abe's mix-net against malicious verifiers via witness indistinguishability | 2018-10-17 | Paper |
| Proofs of Work from worst-case assumptions | 2018-09-12 | Paper |
| An efficiency-preserving transformation from honest-verifier statistical zero-knowledge to statistical zero-knowledge | 2018-07-17 | Paper |
| Functional encryption for bounded collusions, revisited | 2018-01-19 | Paper |
| Can PPAD hardness be based on standard cryptographic assumptions? | 2018-01-19 | Paper |
| Average-case fine-grained hardness | 2017-08-17 | Paper |
| Rational arguments: single round delegation with sublinear verification | 2017-05-19 | Paper |
| Candidate weak pseudorandom functions in \(\mathrm{AC}^0\circ\mathrm{MOD}_2\) | 2017-05-19 | Paper |
| On the existence of extractable one-way functions | 2016-10-28 | Paper |
| A dichotomy for local small-bias generators | 2016-09-21 | Paper |
| Rational sumchecks | 2016-04-08 | Paper |
| Adaptive security with quasi-optimal rate | 2016-03-23 | Paper |
| On the hardness of learning with rounding over small modulus | 2016-03-23 | Paper |
| SPRING: Fast Pseudorandom Functions from Rounded Ring Products | 2015-09-18 | Paper |
| FPGA implementations of SPRING and their countermeasures against side-channel attacks | 2015-07-21 | Paper |
| Non-committing encryption from \(\Phi\)-hiding | 2015-07-06 | Paper |
| The power of negations in cryptography | 2015-07-06 | Paper |
| Public verification of private effort | 2015-07-06 | Paper |
| On the existence of extractable one-way functions | 2015-06-26 | Paper |
| Black-box concurrent zero-knowledge requires \(\tilde{\omega}(\log n)\) rounds | 2015-02-27 | Paper |
| Pseudo-random functions and factoring (extended abstract) | 2014-09-26 | Paper |
| The impossibility of obfuscation with auxiliary input or a universal simulator | 2014-08-07 | Paper |
| Lower Bounds in the Hardware Token Model | 2014-02-18 | Paper |
| Limits on the power of cryptographic cheap talk | 2013-09-02 | Paper |
| Input locality and hardness amplification | 2013-04-15 | Paper |
| More constructions of lossy and correlation-secure trapdoor functions | 2013-04-15 | Paper |
| Public-coin parallel zero-knowledge for NP | 2013-04-15 | Paper |
| Pseudorandom functions and lattices | 2012-06-29 | Paper |
| A dichotomy for local small-bias generators | 2012-06-15 | Paper |
| Lossy functions do not amplify well | 2012-06-15 | Paper |
| Input locality and hardness amplification | 2011-05-19 | Paper |
| Chosen-ciphertext security via correlated products | 2011-04-04 | Paper |
| Optimistic concurrent zero knowledge | 2010-12-07 | Paper |
| New and improved constructions of non-malleable cryptographic protocols | 2010-08-16 | Paper |
| More constructions of lossy and correlation-secure trapdoor functions | 2010-05-28 | Paper |
| Theory of Cryptography | 2009-05-14 | Paper |
| Theory of Cryptography | 2009-05-14 | Paper |
| New and Improved Constructions of Nonmalleable Cryptographic Protocols | 2009-04-30 | Paper |
| Fairness with an Honest Minority and a Rational Majority | 2009-03-03 | Paper |
| On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols | 2009-03-03 | Paper |
| Chosen-Ciphertext Security via Correlated Products | 2009-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549647 | 2009-01-05 | Paper |
| Concurrent Nonmalleable Commitments | 2008-12-22 | Paper |
| SWIFFT: A Modest Proposal for FFT Hashing | 2008-09-18 | Paper |
| On Robust Combiners for Oblivious Transfer and Other Primitives | 2008-05-06 | Paper |
| Constant-round oblivious transfer in the bounded storage model | 2007-05-03 | Paper |
| Theory of Cryptography | 2007-02-12 | Paper |
| Completeness in two-party secure computation: A computational view | 2007-01-24 | Paper |
| Concurrent zero-knowledge. With additional background by Oded Goldreich | 2006-10-27 | Paper |
| Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds | 2003-01-05 | Paper |
| Pseudorandom Functions and Factoring | 2002-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536818 | 2002-07-28 | Paper |
