| Publication | Date of Publication | Type |
|---|
| Exponent-VRFs and their applications | 2025-12-02 | Paper |
| Limits on the power of indistinguishability obfuscation and functional encryption | 2025-08-05 | Paper |
| From one-time to two-round reusable multi-signatures without nested forking | 2025-07-25 | Paper |
| How to approximate a set without knowing its size in advance | 2025-05-20 | Paper |
| Backyard cuckoo hashing: constant worst-case operations with a succinct representation | 2025-04-29 | Paper |
| Is ML-based cryptanalysis inherently limited? Simulating cryptographic adversaries via gradient-based methods | 2024-12-13 | Paper |
| Rogue-instance security for batch knowledge proofs | 2024-08-01 | Paper |
Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \(\Sigma\)-protocols
Journal of Cryptology | 2024-07-10 | Paper |
| A fully-constructive discrete-logarithm preprocessing algorithm with an optimal time-space tradeoff | 2024-06-25 | Paper |
| scientific article; zbMATH DE number 7759462 (Why is no real title available?) | 2023-11-02 | Paper |
| Out-of-band authenticated group key exchange: from strong authentication to immediate key delivery | 2023-11-02 | Paper |
Non-malleable vector commitments via local equivocability
Journal of Cryptology | 2023-10-25 | Paper |
| Generic-Group Identity-Based Encryption: A Tight Impossibility Result | 2023-07-03 | Paper |
| Non-malleable vector commitments via local equivocability | 2023-04-13 | Paper |
| Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions | 2022-12-07 | Paper |
| Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols | 2022-03-31 | Paper |
| Accumulators in (and beyond) generic groups: non-trivial batch verification requires interaction | 2022-03-23 | Paper |
| Algebraic distinguishers: from discrete logarithms to decisional Uber assumptions | 2022-03-23 | Paper |
| Generic-group delay functions require hidden-order groups | 2021-12-01 | Paper |
Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
SIAM Journal on Computing | 2021-10-18 | Paper |
Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
Journal of Cryptology | 2021-09-10 | Paper |
Tight tradeoffs in searchable symmetric encryption
Journal of Cryptology | 2021-04-07 | Paper |
Can PPAD hardness be based on standard cryptographic assumptions?
Journal of Cryptology | 2021-04-07 | Paper |
From minicrypt to obfustopia via private-key functional encryption
Journal of Cryptology | 2020-04-28 | Paper |
Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
Theory of Cryptography | 2018-12-11 | Paper |
| Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound | 2018-12-06 | Paper |
| The security of lazy users in out-of-band authentication | 2018-12-06 | Paper |
Deterministic public-key encryption for adaptively-chosen plaintext distributions
Journal of Cryptology | 2018-11-01 | Paper |
| Securing Abe's mix-net against malicious verifiers via witness indistinguishability | 2018-10-17 | Paper |
On constructing one-way permutations from indistinguishability obfuscation
Journal of Cryptology | 2018-09-14 | Paper |
| Out-of-band authentication in group messaging: computational, statistical, optimal | 2018-09-12 | Paper |
Tight tradeoffs in searchable symmetric encryption
Lecture Notes in Computer Science | 2018-09-12 | Paper |
| Anonymous IBE, leakage resilience and circular security from new assumptions | 2018-07-09 | Paper |
Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
Journal of Cryptology | 2018-05-28 | Paper |
| scientific article; zbMATH DE number 6866298 (Why is no real title available?) | 2018-05-03 | Paper |
Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
Journal of Cryptology | 2018-04-26 | Paper |
Incremental deterministic public-key encryption
Journal of Cryptology | 2018-04-26 | Paper |
Function-private functional encryption in the private-key setting
Journal of Cryptology | 2018-04-26 | Paper |
| Strengthening the security of encrypted databases: non-transitive JOINs | 2018-01-19 | Paper |
Can PPAD hardness be based on standard cryptographic assumptions?
Theory of Cryptography | 2018-01-19 | Paper |
Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
From Minicrypt to Obfustopia via private-key functional encryption
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Limits on the power of indistinguishability obfuscation and functional encryption
SIAM Journal on Computing | 2016-12-21 | Paper |
Targeted malleability: homomorphic encryption for restricted computations
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
An optimally fair coin toss
Journal of Cryptology | 2016-09-21 | Paper |
Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
On constructing one-way permutations from indistinguishability obfuscation
Theory of Cryptography | 2016-04-08 | Paper |
From selective to adaptive security in functional encryption
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Function-private functional encryption in the private-key setting
Theory of Cryptography | 2015-07-06 | Paper |
Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
Theory of Cryptography | 2015-07-06 | Paper |
Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
SIAM Journal on Computing | 2015-06-02 | Paper |
Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
SIAM Journal on Computing | 2015-06-02 | Paper |
Better security for deterministic public-key encryption: the auxiliary-input setting
Journal of Cryptology | 2014-09-25 | Paper |
Balls and Bins: Smaller Hash Families and Faster Evaluation
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Nonmalleable extractors with short seeds and applications to privacy amplification
SIAM Journal on Computing | 2014-07-30 | Paper |
Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
Function-private subspace-membership encryption and its applications
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
Balls and bins: smaller hash families and faster evaluation
SIAM Journal on Computing | 2013-09-25 | Paper |
Function-private identity-based encryption: hiding the function in functional encryption
Advances in Cryptology – CRYPTO 2013 | 2013-09-17 | Paper |
Message-Locked Encryption for Lock-Dependent Messages
Advances in Cryptology – CRYPTO 2013 | 2013-09-02 | Paper |
Fully leakage-resilient signatures
Journal of Cryptology | 2013-08-01 | Paper |
Deterministic public-key encryption for adaptively chosen plaintext distributions
Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings | 2013-05-31 | Paper |
More constructions of lossy and correlation-secure trapdoor functions
Journal of Cryptology | 2013-04-15 | Paper |
Public-key cryptosystems resilient to key leakage
SIAM Journal on Computing | 2012-11-29 | Paper |
Incremental Deterministic Public-Key Encryption
Advances in Cryptology – EUROCRYPT 2012 | 2012-06-29 | Paper |
Lossy functions do not amplify well
Theory of Cryptography | 2012-06-15 | Paper |
Sketching in Adversarial Environments
SIAM Journal on Computing | 2012-03-15 | Paper |
Better security for deterministic public-key encryption: the auxiliary-input setting
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Fully Leakage-Resilient Signatures
Advances in Cryptology – EUROCRYPT 2011 | 2011-05-27 | Paper |
Deterministic history-independent strategies for storing information on write-once memories
Theory of Computing | 2011-05-24 | Paper |
Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
Theory of Cryptography | 2011-05-19 | Paper |
Chosen-ciphertext security via correlated products
SIAM Journal on Computing | 2011-04-04 | Paper |
Public-key encryption in the bounded-retrieval model
Advances in Cryptology – EUROCRYPT 2010 | 2010-06-01 | Paper |
More constructions of lossy and correlation-secure trapdoor functions
Public Key Cryptography – PKC 2010 | 2010-05-28 | Paper |
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
Theory of Cryptography | 2010-02-24 | Paper |
Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
Algorithmica | 2010-02-23 | Paper |
Hedged public-key encryption: how to protect against bad randomness
Advances in Cryptology – ASIACRYPT 2009 | 2009-12-15 | Paper |
Public-Key Cryptosystems Resilient to Key Leakage
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
Automata, Languages and Programming | 2009-07-14 | Paper |
An Optimally Fair Coin Toss
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 5485579 (Why is no real title available?) | 2009-01-05 | Paper |
History-Independent Cuckoo Hashing
Automata, Languages and Programming | 2008-08-19 | Paper |
David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
Advances in Cryptology – EUROCRYPT 2008 | 2008-04-15 | Paper |
Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing
Lecture Notes in Computer Science | 2008-03-11 | Paper |
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
Theory of Cryptography | 2008-03-05 | Paper |
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories
Automata, Languages and Programming | 2007-11-28 | Paper |
