| Publication | Date of Publication | Type |
|---|
Certifying private probabilistic mechanisms
| 2024-12-13 | Paper |
Deniable encryption in a Quantum world
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
On the pseudo-deterministic query complexity of NP search problems
| 2023-07-12 | Paper |
Pseudo-Deterministic Streaming.
| 2023-02-03 | Paper |
Homomorphic Encryption Standard
Protecting Privacy through Homomorphic Encryption | 2022-11-02 | Paper |
Deniable fully homomorphic encryption from learning with errors
| 2022-04-22 | Paper |
Formalizing data deletion in the context of the right to be forgotten
| 2022-03-23 | Paper |
Pseudo-deterministic proofs
| 2021-06-15 | Paper |
Bipartite perfect matching in pseudo-deterministic NC
| 2020-05-27 | Paper |
Fine-grained complexity meets \(\mathrm{IP} = \mathrm{PSPACE}\)
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Population stability. Regulating size in the presence of an adversary
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
Delegating computation: interactive proofs for muggles
Journal of the ACM | 2018-08-02 | Paper |
The Complexity of Problems in P Given Correlated Instances
| 2018-05-03 | Paper |
The hunting of the SNARK
Journal of Cryptology | 2018-02-15 | Paper |
The edited truth
| 2018-01-19 | Paper |
The Computational Benefit of Correlated Instances
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
The hidden graph model: communication locality and optimal resiliency with adaptive faults
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
On the possibilities and limitations of pseudodeterministic algorithms
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
On the Cryptographic Applications of Random Functions (Extended Abstract)
Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) | 2017-04-10 | Paper |
A “Paradoxical” Solution to The Signature Problem
Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) | 2017-04-10 | Paper |
Corrigendum to: ``Efficient probabilistic checkable proofs and applications to approximation
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Time-lock puzzles from randomized encodings
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
How to incentivize data-driven collaboration among competing parties
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Cryptographic assumptions: a position paper
Theory of Cryptography | 2016-03-23 | Paper |
How to Compute in the Presence of Leakage
SIAM Journal on Computing | 2015-11-04 | Paper |
Adaptively secure coin-flipping, revisited
Automata, Languages, and Programming | 2015-11-04 | Paper |
Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
Theory of Cryptography | 2015-07-06 | Paper |
Aggregate pseudorandom functions and connections to learning
Theory of Cryptography | 2015-07-06 | Paper |
Efficient probabilistically checkable proofs and applications to approximations
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Distributed public key schemes secure against continual leakage
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
On basing one-way functions on NP-hardness
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Resettable zero-knowledge (extended abstract)
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
On best-possible obfuscation
Journal of Cryptology | 2014-09-25 | Paper |
Erratum for: ``On basing one-way functions on NP-hardness
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Reusable garbled circuits and succinct functional encryption
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
The impossibility of obfuscation with auxiliary input or a universal simulator
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Leakage-resilient coin tossing
Distributed Computing | 2014-07-11 | Paper |
Multi-input functional encryption
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
Multiparty computation secure against continual memory leakage
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Functional signatures and pseudorandom functions
Public-Key Cryptography – PKC 2014 | 2014-03-25 | Paper |
How to run Turing machines on encrypted data
Advances in Cryptology – CRYPTO 2013 | 2013-09-17 | Paper |
Communication Locality in Secure Multi-party Computation
Theory of Cryptography | 2013-03-18 | Paper |
Bounded-collusion IBE from key homomorphism
Theory of Cryptography | 2012-06-15 | Paper |
Program obfuscation with leaky hardware
Lecture Notes in Computer Science | 2011-12-02 | Paper |
Leakage-Resilient Coin Tossing
Lecture Notes in Computer Science | 2011-10-28 | Paper |
Collision-free hashing from lattice problems
Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation | 2011-08-19 | Paper |
Black-box circular-secure encryption beyond affine functions
Theory of Cryptography | 2011-05-19 | Paper |
On the implementation of huge random objects
SIAM Journal on Computing | 2011-04-04 | Paper |
Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
Securing computation against continuous leakage
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
Public-key encryption schemes with auxiliary inputs
Theory of Cryptography | 2010-02-24 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2009-05-14 | Paper |
Cryptography without (Hardly Any) Secrets ?
Advances in Cryptology - EUROCRYPT 2009 | 2009-05-12 | Paper |
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
Theory of Cryptography | 2009-03-03 | Paper |
Weak Verifiable Random Functions
Theory of Cryptography | 2009-03-03 | Paper |
One-Time Programs
Lecture Notes in Computer Science | 2009-02-10 | Paper |
scientific article; zbMATH DE number 5485522 (Why is no real title available?)
| 2009-01-05 | Paper |
Verifying and decoding in constant depth
| 2009-01-05 | Paper |
scientific article; zbMATH DE number 5485525 (Why is no real title available?)
| 2009-01-05 | Paper |
How to Protect Yourself without Perfect Shredding
Automata, Languages and Programming | 2008-08-19 | Paper |
Program Obfuscation and One-Time Programs
Topics in Cryptology – CT-RSA 2008 | 2008-04-24 | Paper |
Secure Computation from Random Error Correcting Codes
Advances in Cryptology - EUROCRYPT 2007 | 2007-11-29 | Paper |
On Best-Possible Obfuscation
Theory of Cryptography | 2007-08-30 | Paper |
Distributed Computing
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Secure multi-party computation without agreement
Journal of Cryptology | 2006-09-12 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Property testing and its connection to learning and approximation
Journal of the ACM | 2005-01-25 | Paper |
Primality testing using elliptic curves
Journal of the ACM | 2005-01-25 | Paper |
scientific article; zbMATH DE number 2120513 (Why is no real title available?)
| 2004-12-01 | Paper |
scientific article; zbMATH DE number 1962910 (Why is no real title available?)
| 2004-01-08 | Paper |
scientific article; zbMATH DE number 2013820 (Why is no real title available?)
| 2003-12-07 | Paper |
scientific article; zbMATH DE number 1962902 (Why is no real title available?)
| 2003-08-11 | Paper |
scientific article; zbMATH DE number 1808214 (Why is no real title available?)
| 2002-09-30 | Paper |
scientific article; zbMATH DE number 1775382 (Why is no real title available?)
| 2002-09-17 | Paper |
Testing monotonicity
Combinatorica | 2001-06-12 | Paper |
On the limits of nonapproximability of lattice problems
Journal of Computer and System Sciences | 2001-05-28 | Paper |
scientific article; zbMATH DE number 1406782 (Why is no real title available?)
| 2000-03-01 | 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 708808 (Why is no real title available?)
| 1999-08-30 | Paper |
scientific article; zbMATH DE number 1263180 (Why is no real title available?)
| 1999-07-26 | Paper |
scientific article; zbMATH DE number 1088230 (Why is no real title available?)
| 1998-06-25 | Paper |
Fault-tolerant Computation in the Full Information Model
SIAM Journal on Computing | 1998-05-10 | Paper |
Interactive proofs and the hardness of approximating cliques
Journal of the ACM | 1998-01-21 | Paper |
scientific article; zbMATH DE number 1088241 (Why is no real title available?)
| 1998-01-07 | Paper |
scientific article; zbMATH DE number 1088229 (Why is no real title available?)
| 1998-01-07 | Paper |
The knowledge complexity of interactive proof-systems
Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 | 1997-11-13 | Paper |
scientific article; zbMATH DE number 503243 (Why is no real title available?)
| 1994-09-20 | Paper |
Randomness in interactive proofs
Computational Complexity | 1994-05-08 | Paper |
The Complexity of Decision Versus Search
SIAM Journal on Computing | 1994-04-27 | Paper |
scientific article; zbMATH DE number 66620 (Why is no real title available?)
| 1992-09-27 | Paper |
scientific article; zbMATH DE number 17388 (Why is no real title available?)
| 1992-06-26 | Paper |
scientific article; zbMATH DE number 4191077 (Why is no real title available?)
| 1991-01-01 | Paper |
scientific article; zbMATH DE number 4185024 (Why is no real title available?)
| 1990-01-01 | Paper |
scientific article; zbMATH DE number 4191103 (Why is no real title available?)
| 1990-01-01 | Paper |
On the power of interaction
Combinatorica | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4195163 (Why is no real title available?)
| 1990-01-01 | Paper |
The Knowledge Complexity of Interactive Proof Systems
SIAM Journal on Computing | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4106274 (Why is no real title available?)
| 1989-01-01 | Paper |
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
SIAM Journal on Computing | 1988-01-01 | Paper |
scientific article; zbMATH DE number 3960854 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3954815 (Why is no real title available?)
| 1986-01-01 | Paper |
An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) | 1985-01-01 | Paper |
Probabilistic encryption
Journal of Computer and System Sciences | 1984-01-01 | Paper |
