| Publication | Date of Publication | Type |
|---|
| Sample efficient search to decision for \(k\)LIN | 2026-02-04 | Paper |
| 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
Theory of Cryptography | 2023-08-14 | Paper |
One-Way Functions and (Im)perfect Obfuscation
SIAM Journal on Computing | 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
Lecture Notes in Computer Science | 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
Tutorials on the Foundations of Cryptography | 2022-01-12 | Paper |
Limits on the efficiency of (ring) LWE-based non-interactive key exchange
Journal of Cryptology | 2021-11-24 | Paper |
An Algebraic Approach to Nonmalleability
SIAM Journal on Computing | 2021-10-18 | Paper |
Can PPAD hardness be based on standard cryptographic assumptions?
Journal of Cryptology | 2021-04-07 | Paper |
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 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?
Theory of Cryptography | 2018-01-19 | Paper |
Average-case fine-grained hardness
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Rational arguments: single round delegation with sublinear verification
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Candidate weak pseudorandom functions in \(\mathrm{AC}^0\circ\mathrm{MOD}_2\)
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
On the existence of extractable one-way functions
SIAM Journal on Computing | 2016-10-28 | Paper |
A dichotomy for local small-bias generators
Journal of Cryptology | 2016-09-21 | Paper |
Rational sumchecks
Theory of Cryptography | 2016-04-08 | Paper |
Adaptive security with quasi-optimal rate
Theory of Cryptography | 2016-03-23 | Paper |
On the hardness of learning with rounding over small modulus
Theory of Cryptography | 2016-03-23 | Paper |
SPRING: Fast Pseudorandom Functions from Rounded Ring Products
Fast Software Encryption | 2015-09-18 | Paper |
FPGA implementations of SPRING and their countermeasures against side-channel attacks
Advanced Information Systems Engineering | 2015-07-21 | Paper |
Non-committing encryption from \(\Phi\)-hiding
Theory of Cryptography | 2015-07-06 | Paper |
The power of negations in cryptography
Theory of Cryptography | 2015-07-06 | Paper |
Public verification of private effort
Theory of Cryptography | 2015-07-06 | Paper |
On the existence of extractable one-way functions
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Black-box concurrent zero-knowledge requires \(\tilde{\omega}(\log n)\) rounds
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Pseudo-random functions and factoring (extended abstract)
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
The impossibility of obfuscation with auxiliary input or a universal simulator
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Lower Bounds in the Hardware Token Model
Theory of Cryptography | 2014-02-18 | Paper |
Limits on the power of cryptographic cheap talk
Advances in Cryptology – CRYPTO 2013 | 2013-09-02 | Paper |
Input locality and hardness amplification
Journal of Cryptology | 2013-04-15 | Paper |
More constructions of lossy and correlation-secure trapdoor functions
Journal of Cryptology | 2013-04-15 | Paper |
Public-coin parallel zero-knowledge for NP
Journal of Cryptology | 2013-04-15 | Paper |
Pseudorandom functions and lattices
Advances in Cryptology – EUROCRYPT 2012 | 2012-06-29 | Paper |
A dichotomy for local small-bias generators
Theory of Cryptography | 2012-06-15 | Paper |
Lossy functions do not amplify well
Theory of Cryptography | 2012-06-15 | Paper |
Input locality and hardness amplification
Theory of Cryptography | 2011-05-19 | Paper |
Chosen-ciphertext security via correlated products
SIAM Journal on Computing | 2011-04-04 | Paper |
Optimistic concurrent zero knowledge
Advances in Cryptology - ASIACRYPT 2010 | 2010-12-07 | Paper |
New and improved constructions of non-malleable cryptographic protocols
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
More constructions of lossy and correlation-secure trapdoor functions
Public Key Cryptography – PKC 2010 | 2010-05-28 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2009-05-14 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2009-05-14 | Paper |
New and Improved Constructions of Nonmalleable Cryptographic Protocols
SIAM Journal on Computing | 2009-04-30 | Paper |
Fairness with an Honest Minority and a Rational Majority
Theory of Cryptography | 2009-03-03 | Paper |
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
Theory of Cryptography | 2009-03-03 | Paper |
Chosen-Ciphertext Security via Correlated Products
Theory of Cryptography | 2009-03-03 | Paper |
| scientific article; zbMATH DE number 5485483 (Why is no real title available?) | 2009-01-05 | Paper |
Concurrent Nonmalleable Commitments
SIAM Journal on Computing | 2008-12-22 | Paper |
SWIFFT: A Modest Proposal for FFT Hashing
Fast Software Encryption | 2008-09-18 | Paper |
On Robust Combiners for Oblivious Transfer and Other Primitives
Lecture Notes in Computer Science | 2008-05-06 | Paper |
Constant-round oblivious transfer in the bounded storage model
Journal of Cryptology | 2007-05-03 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Completeness in two-party secure computation: A computational view
Journal of Cryptology | 2007-01-24 | Paper |
Concurrent zero-knowledge. With additional background by Oded Goldreich
Information Security and Cryptography | 2006-10-27 | Paper |
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
SIAM Journal on Computing | 2003-01-05 | Paper |
Pseudorandom Functions and Factoring
SIAM Journal on Computing | 2002-09-29 | Paper |
| scientific article; zbMATH DE number 1759795 (Why is no real title available?) | 2002-07-28 | Paper |
