| Publication | Date of Publication | Type |
|---|
| Certifying private probabilistic mechanisms | 2024-12-13 | Paper |
| Deniable encryption in a Quantum world | 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 | 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 IP = PSPACE | 2019-10-15 | Paper |
| Population Stability | 2019-09-19 | Paper |
| Delegating Computation | 2018-08-02 | Paper |
| The Complexity of Problems in P Given Correlated Instances | 2018-05-03 | Paper |
| The hunting of the SNARK | 2018-02-15 | Paper |
| The edited truth | 2018-01-19 | Paper |
| The Computational Benefit of Correlated Instances | 2017-05-19 | Paper |
| The Hidden Graph Model | 2017-05-19 | Paper |
| On the possibilities and limitations of pseudodeterministic algorithms | 2017-05-16 | Paper |
| On the Cryptographic Applications of Random Functions (Extended Abstract) | 2017-04-10 | Paper |
| A “Paradoxical” Solution to The Signature Problem | 2017-04-10 | Paper |
| Corrigendum to: ``Efficient probabilistic checkable proofs and applications to approximation | 2016-09-01 | Paper |
| Time-lock puzzles from randomized encodings | 2016-04-15 | Paper |
| How to incentivize data-driven collaboration among competing parties | 2016-04-15 | Paper |
| Cryptographic Assumptions: A Position Paper | 2016-03-23 | Paper |
| How to Compute in the Presence of Leakage | 2015-11-04 | Paper |
| Adaptively Secure Coin-Flipping, Revisited | 2015-11-04 | Paper |
| Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation | 2015-07-06 | Paper |
| Aggregate Pseudorandom Functions and Connections to Learning | 2015-07-06 | Paper |
| Efficient probabilistically checkable proofs and applications to approximations | 2015-05-07 | Paper |
| Distributed public key schemes secure against continual leakage | 2014-12-05 | Paper |
| On basing one-way functions on NP-hardness | 2014-11-25 | Paper |
| Resettable zero-knowledge (extended abstract) | 2014-09-26 | Paper |
| On best-possible obfuscation | 2014-09-25 | Paper |
| Erratum for: ``On basing one-way functions on NP-hardness | 2014-08-13 | Paper |
| Reusable garbled circuits and succinct functional encryption | 2014-08-07 | Paper |
| The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator | 2014-08-07 | Paper |
| Leakage-resilient coin tossing | 2014-07-11 | Paper |
| Multi-input Functional Encryption | 2014-05-27 | Paper |
| Multiparty computation secure against continual memory leakage | 2014-05-13 | Paper |
| Functional Signatures and Pseudorandom Functions | 2014-03-25 | Paper |
| How to Run Turing Machines on Encrypted Data | 2013-09-17 | Paper |
| Communication Locality in Secure Multi-party Computation | 2013-03-18 | Paper |
| Bounded-Collusion IBE from Key Homomorphism | 2012-06-15 | Paper |
| Program Obfuscation with Leaky Hardware | 2011-12-02 | Paper |
| Leakage-Resilient Coin Tossing | 2011-10-28 | Paper |
| Collision-Free Hashing from Lattice Problems | 2011-08-19 | Paper |
| Black-Box Circular-Secure Encryption beyond Affine Functions | 2011-05-19 | Paper |
| On the Implementation of Huge Random Objects | 2011-04-04 | Paper |
| Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability | 2010-08-24 | Paper |
| Securing Computation against Continuous Leakage | 2010-08-24 | Paper |
| Public-Key Encryption Schemes with Auxiliary Inputs | 2010-02-24 | Paper |
| Theory of Cryptography | 2009-05-14 | Paper |
| Cryptography without (Hardly Any) Secrets ? | 2009-05-12 | Paper |
| Simultaneous Hardcore Bits and Cryptography against Memory Attacks | 2009-03-03 | Paper |
| Weak Verifiable Random Functions | 2009-03-03 | Paper |
| One-Time Programs | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549691 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549643 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549694 | 2009-01-05 | Paper |
| How to Protect Yourself without Perfect Shredding | 2008-08-19 | Paper |
| Program Obfuscation and One-Time Programs | 2008-04-24 | Paper |
| Secure Computation from Random Error Correcting Codes | 2007-11-29 | Paper |
| On Best-Possible Obfuscation | 2007-08-30 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Secure multi-party computation without agreement | 2006-09-12 | Paper |
| Theory of Cryptography | 2005-12-07 | Paper |
| Property testing and its connection to learning and approximation | 2005-01-25 | Paper |
| Primality testing using elliptic curves | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829810 | 2004-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418784 | 2004-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437112 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418776 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3149676 | 2002-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542514 | 2002-09-17 | Paper |
| Testing monotonicity | 2001-06-12 | Paper |
| On the limits of nonapproximability of lattice problems | 2001-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940698 | 2000-03-01 | Paper |
| An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract) | 1999-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318696 | 1999-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234050 | 1999-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364546 | 1998-06-25 | Paper |
| Fault-tolerant Computation in the Full Information Model | 1998-05-10 | Paper |
| Interactive proofs and the hardness of approximating cliques | 1998-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364558 | 1998-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364545 | 1998-01-07 | Paper |
| The knowledge complexity of interactive proof-systems | 1997-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279565 | 1994-09-20 | Paper |
| Randomness in interactive proofs | 1994-05-08 | Paper |
| The Complexity of Decision Versus Search | 1994-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4011253 | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974093 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3210141 | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5750398 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3210163 | 1990-01-01 | Paper |
| On the power of interaction | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3212276 | 1990-01-01 | Paper |
| The Knowledge Complexity of Interactive Proof Systems | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3830531 | 1989-01-01 | Paper |
| A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3729902 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3724235 | 1986-01-01 | Paper |
| An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information | 1985-01-01 | Paper |
| Probabilistic encryption | 1984-01-01 | Paper |
