| Publication | Date of Publication | Type |
|---|
Circuit complexity and functionality: a statistical thermodynamics perspective
Proceedings of the National Academy of Sciences of the United States of America | 2026-03-13 | Paper |
| On the computational hardness needed for quantum cryptography | 2024-09-25 | Paper |
| Taming adaptivity in YOSO protocols: the modular way | 2024-08-02 | Paper |
Triply adaptive UC NIZK
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-16 | Paper |
| Covert learning: how to learn with an untrusted intermediary | 2023-04-13 | Paper |
| Fully deniable interactive encryption | 2022-11-09 | Paper |
| COA-secure obfuscation and applications | 2022-08-30 | Paper |
| Unclonable polymers and their cryptographic applications | 2022-08-30 | Paper |
Universally composable security
Journal of the ACM | 2022-03-31 | Paper |
| Universal composition with global subroutines: capturing global setup within plain UC | 2022-03-23 | Paper |
| Towards multiparty computation withstanding coercion of all parties | 2022-03-23 | Paper |
Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
SIAM Journal on Computing | 2022-02-08 | Paper |
| Universally composable accumulators | 2020-08-05 | Paper |
Fiat-Shamir: from practice to theory
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
| Certifying trapdoor permutations, revisited | 2018-12-11 | Paper |
| Fiat-Shamir and correlation intractability from strong KDM-secure encryption | 2018-07-09 | Paper |
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
SIAM Journal on Computing | 2018-07-04 | Paper |
Task-structured probabilistic I/O automata
Journal of Computer and System Sciences | 2018-04-18 | Paper |
| Optimal-rate non-committing encryption | 2018-02-23 | Paper |
The hunting of the SNARK
Journal of Cryptology | 2018-02-15 | Paper |
| Towards doubly efficient private information retrieval | 2018-01-19 | Paper |
On virtual grey box obfuscation for general circuits
Algorithmica | 2018-01-05 | Paper |
Maintaining authenticated communication in the presence of break-ins
Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 | 2017-09-29 | Paper |
Randomness vs. fault-tolerance
Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 | 2017-09-29 | Paper |
Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Better two-round adaptive multi-party computation
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Chosen-Ciphertext Secure Fully Homomorphic Encryption
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Adaptive succinct garbled RAM or: how to delegate your database
Theory of Cryptography | 2016-12-22 | Paper |
On the existence of extractable one-way functions
SIAM Journal on Computing | 2016-10-28 | Paper |
Toward a game theoretic view of secure computation
Journal of Cryptology | 2016-10-13 | Paper |
From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
Secure computation with honest-looking parties: what if nobody is truly honest? (extended abstract)
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Adaptive hardness and composable security in the plain model from standard assumptions
SIAM Journal on Computing | 2016-09-23 | Paper |
Reusable fuzzy extractors for low-entropy distributions
Advances in Cryptology – EUROCRYPT 2016 | 2016-09-09 | Paper |
Fully succinct garbled RAM
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Universally Composable Authentication and Key-Exchange with Global PKI
Public-Key Cryptography – PKC 2016 | 2016-04-13 | Paper |
On the correlation intractability of obfuscated pseudorandom functions
Theory of Cryptography | 2016-03-23 | Paper |
Selective private function evaluation with applications to private statistics
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing | 2016-03-04 | Paper |
Concurrent secure computation with optimal query complexity
Lecture Notes in Computer Science | 2015-12-10 | Paper |
A simpler variant of universally composable security for standard multiparty computation
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Keying hash functions for message authentication
Advances in Cryptology — CRYPTO ’96 | 2015-11-11 | Paper |
Succinct garbling and indistinguishability obfuscation for RAM programs
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
Theory of Cryptography | 2015-07-06 | Paper |
Obfuscation of probabilistic circuits and applications
Theory of Cryptography | 2015-07-06 | Paper |
On obfuscation with random oracles
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 |
Asynchronous secure computation
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Fast asynchronous Byzantine agreement with optimal resilience
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | 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 |
Secure Key Exchange and Sessions without Credentials
Lecture Notes in Computer Science | 2014-10-14 | Paper |
Resettable zero-knowledge (extended abstract)
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
On strong simulation and composable point obfuscation
Journal of Cryptology | 2014-09-25 | Paper |
Client-server concurrent zero knowledge with constant rounds and guaranteed complexity
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
On virtual grey box obfuscation for general circuits
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
The impossibility of obfuscation with auxiliary input or a universal simulator
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Recursive composition and bootstrapping for SNARKs and proof-carrying data
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Verifiable set operations over outsourced databases
Public-Key Cryptography – PKC 2014 | 2014-03-25 | Paper |
Obfuscation for evasive functions
Theory of Cryptography | 2014-02-18 | Paper |
Refereed delegation of computation
Information and Computation | 2013-12-03 | Paper |
Public-Coin Concurrent Zero-Knowledge in the Global Hash Model
Theory of Cryptography | 2013-03-18 | Paper |
Two protocols for delegation of computation
Lecture Notes in Computer Science | 2012-11-06 | Paper |
Universally composable security with local adversaries
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Efficient password authenticated key exchange via oblivious transfer
Public Key Cryptography – PKC 2012 | 2012-07-20 | Paper |
Leakage-Tolerant Interactive Protocols
Theory of Cryptography | 2012-06-15 | Paper |
Secure computation without authentication
Journal of Cryptology | 2012-01-13 | Paper |
Program obfuscation with leaky hardware
Lecture Notes in Computer Science | 2011-12-02 | Paper |
Towards a game theoretic view of secure computation
Advances in Cryptology – EUROCRYPT 2011 | 2011-05-27 | Paper |
Universally composable symbolic security analysis
Journal of Cryptology | 2011-04-01 | Paper |
The random oracle methodology, revisited.
Journal of the ACM | 2011-02-01 | Paper |
On strong simulation and composable point obfuscation
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
Universally composable two-party and multi-party secure computation
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
On symmetric encryption and point obfuscation
Theory of Cryptography | 2010-02-24 | Paper |
Obfuscation of hyperplane membership
Theory of Cryptography | 2010-02-24 | Paper |
Analyzing security protocols using time-bounded task-PIOAs
Discrete Event Dynamic Systems | 2009-05-29 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2009-05-14 | Paper |
Amplifying Collision Resistance: A Complexity-Theoretic Treatment
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
Towards a Theory of Extractable Functions
Theory of Cryptography | 2009-03-03 | Paper |
Non-malleable Obfuscation
Theory of Cryptography | 2009-03-03 | Paper |
Just fast keying
ACM Transactions on Information and System Security | 2008-12-21 | Paper |
Modeling Computational Security in Long-Lived Systems
CONCUR 2008 - Concurrency Theory | 2008-11-25 | Paper |
Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
Lecture Notes in Computer Science | 2008-09-09 | Paper |
Extractable Perfectly One-Way Functions
Automata, Languages and Programming | 2008-08-19 | Paper |
How to Protect Yourself without Perfect Shredding
Automata, Languages and Programming | 2008-08-19 | Paper |
Obtaining Universally Compoable Security: Towards the Bare Bones of Trust
Advances in Cryptology – ASIACRYPT 2007 | 2008-05-15 | Paper |
Universally Composable Password-Based Key Exchange
Lecture Notes in Computer Science | 2008-05-06 | Paper |
Obfuscating Point Functions with Multibit Output
Advances in Cryptology – EUROCRYPT 2008 | 2008-04-15 | Paper |
Secure Computation Without Authentication
Advances in Cryptology – CRYPTO 2005 | 2008-03-17 | Paper |
Advances in Cryptology - CRYPTO 2003
Lecture Notes in Computer Science | 2007-11-28 | Paper |
Advances in Cryptology - CRYPTO 2003
Lecture Notes in Computer Science | 2007-11-28 | Paper |
Chosen‐Ciphertext Security from Identity‐Based Encryption
SIAM Journal on Computing | 2007-10-22 | Paper |
Advances in Cryptology - EUROCRYPT 2004
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Mitigating Dictionary Attacks on Password-Protected Local Storage
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Universally Composable Security with Global Setup
Theory of Cryptography | 2007-08-30 | Paper |
A forward-secure public-key encryption scheme
Journal of Cryptology | 2007-08-20 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2007-02-12 | Paper |
On the limitations of universally composable two-party computation without set-up assumptions
Journal of Cryptology | 2006-08-14 | Paper |
| Exposure-resilient functions and all-or-nothing transforms | 2006-03-01 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Adaptive versus non-adaptive security of multi-party protocols
Journal of Cryptology | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2086716 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2009960 (Why is no real title available?) | 2003-11-26 | Paper |
| scientific article; zbMATH DE number 2009949 (Why is no real title available?) | 2003-11-26 | Paper |
| scientific article; zbMATH DE number 1962757 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1947510 (Why is no real title available?) | 2003-07-09 | Paper |
| scientific article; zbMATH DE number 1942418 (Why is no real title available?) | 2003-06-30 | Paper |
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
SIAM Journal on Computing | 2003-01-05 | Paper |
| scientific article; zbMATH DE number 1842484 (Why is no real title available?) | 2002-12-08 | Paper |
On the statistical properties of Diffie-Hellman distributions
Israel Journal of Mathematics | 2002-11-12 | Paper |
| scientific article; zbMATH DE number 1775406 (Why is no real title available?) | 2002-09-24 | Paper |
| scientific article; zbMATH DE number 1775427 (Why is no real title available?) | 2002-08-01 | Paper |
| scientific article; zbMATH DE number 1775397 (Why is no real title available?) | 2002-08-01 | Paper |
| scientific article; zbMATH DE number 1722683 (Why is no real title available?) | 2002-03-21 | Paper |
| scientific article; zbMATH DE number 1722690 (Why is no real title available?) | 2002-03-21 | Paper |
| scientific article; zbMATH DE number 1263237 (Why is no real title available?) | 2002-02-03 | Paper |
| scientific article; zbMATH DE number 1263238 (Why is no real title available?) | 2002-02-03 | Paper |
Security and composition of multiparty cryptographic protocols
Journal of Cryptology | 2000-11-27 | Paper |
| scientific article; zbMATH DE number 1418290 (Why is no real title available?) | 2000-07-19 | Paper |
Randomness versus fault-tolerance
Journal of Cryptology | 2000-05-08 | Paper |
Maintaining authenticated communication in the presence of break-ins
Journal of Cryptology | 2000-05-08 | Paper |
| scientific article; zbMATH DE number 1406798 (Why is no real title available?) | 2000-03-01 | Paper |
Bandwidth Allocation with Preemption
SIAM Journal on Computing | 1999-10-28 | Paper |
An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
Advances in Cryptology — EUROCRYPT ’99 | 1999-10-05 | Paper |
| scientific article; zbMATH DE number 1304090 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1256784 (Why is no real title available?) | 1999-03-01 | Paper |
Bounding the Power of Preemption in Randomized Scheduling
SIAM Journal on Computing | 1998-09-20 | Paper |
| scientific article; zbMATH DE number 1088253 (Why is no real title available?) | 1998-03-17 | Paper |
| scientific article; zbMATH DE number 1088228 (Why is no real title available?) | 1997-11-17 | Paper |
On Certain Exponential Sums and the Distribution of Diffie-Hellman Triples
Journal of the London Mathematical Society | 1997-09-15 | Paper |
Lower bounds for sampling algorithms for estimating the average
Information Processing Letters | 1997-02-28 | Paper |
More on BPP and the polynomial-time hierarchy
Information Processing Letters | 1997-02-27 | Paper |
Bounds on tradeoffs between randomness and communication complexity
Computational Complexity | 1993-10-18 | Paper |
