| Publication | Date of Publication | Type |
|---|
| 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 | 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 | 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 | 2022-02-08 | Paper |
| Universally composable accumulators | 2020-08-05 | Paper |
| Fiat-Shamir: from practice to theory | 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 | 2018-07-04 | Paper |
| Task-structured probabilistic I/O automata | 2018-04-18 | Paper |
| Optimal-rate non-committing encryption | 2018-02-23 | Paper |
| The hunting of the SNARK | 2018-02-15 | Paper |
| Towards doubly efficient private information retrieval | 2018-01-19 | Paper |
| On virtual grey box obfuscation for general circuits | 2018-01-05 | Paper |
| Maintaining authenticated communication in the presence of break-ins | 2017-09-29 | Paper |
| Randomness vs. fault-tolerance | 2017-09-29 | Paper |
| Equivocating Yao | 2017-08-17 | Paper |
| Better Two-Round Adaptive Multi-party Computation | 2017-06-13 | Paper |
| Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE | 2017-06-13 | Paper |
| Chosen-Ciphertext Secure Fully Homomorphic Encryption | 2017-06-13 | Paper |
| Adaptive Succinct Garbled RAM or: How to Delegate Your Database | 2016-12-22 | Paper |
| On the existence of extractable one-way functions | 2016-10-28 | Paper |
| Toward a game theoretic view of secure computation | 2016-10-13 | Paper |
| From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again | 2016-10-07 | Paper |
| Secure computation with honest-looking parties: what if nobody is truly honest? (extended abstract) | 2016-09-29 | Paper |
| Adaptive hardness and composable security in the plain model from standard assumptions | 2016-09-23 | Paper |
| Reusable Fuzzy Extractors for Low-Entropy Distributions | 2016-09-09 | Paper |
| Fully succinct garbled RAM | 2016-04-15 | Paper |
| Universally Composable Authentication and Key-Exchange with Global PKI | 2016-04-13 | Paper |
| On the Correlation Intractability of Obfuscated Pseudorandom Functions | 2016-03-23 | Paper |
| Selective private function evaluation with applications to private statistics | 2016-03-04 | Paper |
| Concurrent Secure Computation with Optimal Query Complexity | 2015-12-10 | Paper |
| A Simpler Variant of Universally Composable Security for Standard Multiparty Computation | 2015-12-10 | Paper |
| Keying Hash Functions for Message Authentication | 2015-11-11 | Paper |
| Succinct Garbling and Indistinguishability Obfuscation for RAM Programs | 2015-08-21 | Paper |
| Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation | 2015-07-06 | Paper |
| Obfuscation of Probabilistic Circuits and Applications | 2015-07-06 | Paper |
| On Obfuscation with Random Oracles | 2015-07-06 | Paper |
| On the existence of extractable one-way functions | 2015-06-26 | Paper |
| Asynchronous secure computation | 2015-05-07 | Paper |
| Fast asynchronous Byzantine agreement with optimal resilience | 2015-05-07 | Paper |
| Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds | 2015-02-27 | Paper |
| Secure Key Exchange and Sessions without Credentials | 2014-10-14 | Paper |
| Resettable zero-knowledge (extended abstract) | 2014-09-26 | Paper |
| On strong simulation and composable point obfuscation | 2014-09-25 | Paper |
| Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity | 2014-08-07 | Paper |
| On Virtual Grey Box Obfuscation for General Circuits | 2014-08-07 | Paper |
| The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator | 2014-08-07 | Paper |
| Recursive composition and bootstrapping for SNARKS and proof-carrying data | 2014-08-07 | Paper |
| Verifiable Set Operations over Outsourced Databases | 2014-03-25 | Paper |
| Obfuscation for Evasive Functions | 2014-02-18 | Paper |
| Refereed delegation of computation | 2013-12-03 | Paper |
| Public-Coin Concurrent Zero-Knowledge in the Global Hash Model | 2013-03-18 | Paper |
| Two Protocols for Delegation of Computation | 2012-11-06 | Paper |
| Universally Composable Security with Local Adversaries | 2012-09-25 | Paper |
| Efficient Password Authenticated Key Exchange via Oblivious Transfer | 2012-07-20 | Paper |
| Leakage-Tolerant Interactive Protocols | 2012-06-15 | Paper |
| Secure computation without authentication | 2012-01-13 | Paper |
| Program Obfuscation with Leaky Hardware | 2011-12-02 | Paper |
| Towards a Game Theoretic View of Secure Computation | 2011-05-27 | Paper |
| Universally composable symbolic security analysis | 2011-04-01 | Paper |
| The random oracle methodology, revisited | 2011-02-01 | Paper |
| On Strong Simulation and Composable Point Obfuscation | 2010-08-24 | Paper |
| Universally composable two-party and multi-party secure computation | 2010-08-05 | Paper |
| On Symmetric Encryption and Point Obfuscation | 2010-02-24 | Paper |
| Obfuscation of Hyperplane Membership | 2010-02-24 | Paper |
| Analyzing security protocols using time-bounded task-PIOAs | 2009-05-29 | Paper |
| Theory of Cryptography | 2009-05-14 | Paper |
| Amplifying Collision Resistance: A Complexity-Theoretic Treatment | 2009-03-10 | Paper |
| Towards a Theory of Extractable Functions | 2009-03-03 | Paper |
| Non-malleable Obfuscation | 2009-03-03 | Paper |
| Just fast keying | 2008-12-21 | Paper |
| Modeling Computational Security in Long-Lived Systems | 2008-11-25 | Paper |
| Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols | 2008-09-09 | Paper |
| Extractable Perfectly One-Way Functions | 2008-08-19 | Paper |
| How to Protect Yourself without Perfect Shredding | 2008-08-19 | Paper |
| Obtaining Universally Compoable Security: Towards the Bare Bones of Trust | 2008-05-15 | Paper |
| Universally Composable Password-Based Key Exchange | 2008-05-06 | Paper |
| Obfuscating Point Functions with Multibit Output | 2008-04-15 | Paper |
| Secure Computation Without Authentication | 2008-03-17 | Paper |
| Advances in Cryptology - CRYPTO 2003 | 2007-11-28 | Paper |
| Advances in Cryptology - CRYPTO 2003 | 2007-11-28 | Paper |
| Chosen‐Ciphertext Security from Identity‐Based Encryption | 2007-10-22 | Paper |
| Advances in Cryptology - EUROCRYPT 2004 | 2007-09-25 | Paper |
| Mitigating Dictionary Attacks on Password-Protected Local Storage | 2007-09-04 | Paper |
| Universally Composable Security with Global Setup | 2007-08-30 | Paper |
| A forward-secure public-key encryption scheme | 2007-08-20 | Paper |
| Theory of Cryptography | 2007-02-12 | Paper |
| On the limitations of universally composable two-party computation without set-up assumptions | 2006-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3374929 | 2006-03-01 | Paper |
| Theory of Cryptography | 2005-12-07 | Paper |
| Theory of Cryptography | 2005-12-07 | Paper |
| Adaptive versus non-adaptive security of multi-party protocols | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737255 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4434880 | 2003-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4434869 | 2003-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418587 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411535 | 2003-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4409115 | 2003-06-30 | Paper |
| Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4783717 | 2002-12-08 | Paper |
| On the statistical properties of Diffie-Hellman distributions | 2002-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542539 | 2002-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542560 | 2002-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542530 | 2002-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2778854 | 2002-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2778861 | 2002-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234110 | 2002-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234111 | 2002-02-03 | Paper |
| Security and composition of multiparty cryptographic protocols | 2000-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941850 | 2000-07-19 | Paper |
| Randomness versus fault-tolerance | 2000-05-08 | Paper |
| Maintaining authenticated communication in the presence of break-ins | 2000-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940714 | 2000-03-01 | Paper |
| Bandwidth Allocation with Preemption | 1999-10-28 | Paper |
| An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract) | 1999-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250781 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228521 | 1999-03-01 | Paper |
| Bounding the Power of Preemption in Randomized Scheduling | 1998-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364570 | 1998-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364544 | 1997-11-17 | Paper |
| On Certain Exponential Sums and the Distribution of Diffie-Hellman Triples | 1997-09-15 | Paper |
| Lower bounds for sampling algorithms for estimating the average | 1997-02-28 | Paper |
| More on BPP and the polynomial-time hierarchy | 1997-02-27 | Paper |
| Bounds on tradeoffs between randomness and communication complexity | 1993-10-18 | Paper |
