| Publication | Date of Publication | Type |
|---|
| State machine replication under changing network conditions | 2023-08-25 | Paper |
| An analysis of the algebraic group model | 2023-08-21 | Paper |
| Subset predicate encryption and its applications | 2023-08-02 | Paper |
| Boosting the Security of Blind Signature Schemes | 2023-05-26 | Paper |
| \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions | 2023-05-12 | Paper |
| Algebraic adversaries in the universal composability framework | 2023-05-12 | Paper |
| Efficient 3-party distributed ORAM | 2022-12-16 | Paper |
| Universally composable relaxed password authenticated key exchange | 2022-11-09 | Paper |
| Spreading the privacy blanket: differentially oblivious shuffling for differential privacy | 2022-11-09 | Paper |
| Efficient, Reusable Fuzzy Extractors from LWE | 2022-06-15 | Paper |
| On the security of time-lock puzzles and timed commitments | 2022-03-23 | Paper |
| Asynchronous Byzantine agreement with subquadratic communication | 2021-12-01 | Paper |
| Introduction to Modern Cryptography | 2020-11-16 | Paper |
| Optimizing authenticated garbling for faster secure two-party computation | 2020-06-30 | Paper |
| Synchronous consensus with optimal asynchronous fallback guarantees | 2020-04-30 | Paper |
| Feasibility and infeasibility of secure computation with malicious PUFs | 2020-04-28 | Paper |
| Constant-round group key exchange from the Ring-LWE assumption | 2020-02-25 | Paper |
| Covert security with public verifiability: faster, leaner, and simpler | 2020-02-04 | Paper |
| (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens | 2019-06-20 | Paper |
| Simple and efficient two-server ORAM | 2019-01-23 | Paper |
| More is less: perfectly secure oblivious algorithms in the multi-server setting | 2019-01-23 | Paper |
| Provable security of (tweakable) block ciphers based on substitution-permutation networks | 2018-09-12 | Paper |
| Faster Secure Two-Party Computation in the Single-Execution Setting | 2017-06-23 | Paper |
| Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited | 2017-06-13 | Paper |
| Selective-Opening Security in the Presence of Randomness Failures | 2017-01-06 | Paper |
| A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation | 2016-10-21 | Paper |
| 10-Round Feistel is Indifferentiable from an Ideal Cipher | 2016-07-15 | Paper |
| How Fair is Your Protocol? | 2016-03-23 | Paper |
| Hash Functions from Defective Ideal Ciphers | 2016-03-02 | Paper |
| Efficient and secure authenticated key exchange using weak passwords | 2015-12-07 | Paper |
| Adaptively secure broadcast, revisited | 2015-09-11 | Paper |
| Distributing the setup in universally composable multi-party computation | 2015-09-03 | Paper |
| Multi-Client Verifiable Computation with Stronger Security Guarantees | 2015-07-06 | Paper |
| Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds | 2015-07-06 | Paper |
| Reliable broadcast in radio networks | 2015-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191615 | 2014-10-06 | Paper |
| On the efficiency of local decoding procedures for error-correcting codes | 2014-09-26 | Paper |
| Complete characterization of security notions for probabilistic private-key encryption | 2014-09-26 | Paper |
| Feasibility and Infeasibility of Secure Computation with Malicious PUFs | 2014-08-07 | Paper |
| Amortizing Garbled Circuits | 2014-08-07 | Paper |
| Efficient Three-Party Computation from Cut-and-Choose | 2014-08-07 | Paper |
| Multi-input Functional Encryption | 2014-05-27 | Paper |
| Verifiable Oblivious Storage | 2014-03-25 | Paper |
| (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens | 2014-02-18 | Paper |
| Complete Fairness in Secure Two-Party Computation | 2014-02-17 | Paper |
| Authenticated broadcast with a partially compromised public-key infrastructure | 2014-02-11 | Paper |
| One-round multi-party communication complexity of distinguishing sums | 2014-01-10 | Paper |
| Functional Encryption from (Small) Hardware Tokens | 2013-12-10 | Paper |
| Round-optimal password-based authenticated key exchange | 2013-11-15 | Paper |
| Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose | 2013-09-17 | Paper |
| Predicate encryption supporting disjunctions, polynomial equations, and inner products | 2013-06-27 | Paper |
| Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption | 2013-04-19 | Paper |
| Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS | 2013-04-19 | Paper |
| Feasibility and Completeness of Cryptographic Tasks in the Quantum World | 2013-03-18 | Paper |
| Universally Composable Synchronous Computation | 2013-03-18 | Paper |
| Multi-Client Non-interactive Verifiable Computation | 2013-03-18 | Paper |
| Byzantine Agreement with a Rational Adversary | 2012-11-01 | Paper |
| Collusion-Preserving Computation | 2012-09-25 | Paper |
| Constant-Round Multi-party Private Set Union Using Reversed Laurent Series | 2012-07-20 | Paper |
| Fair Computation with Rational Players | 2012-06-29 | Paper |
| On the Security of the “Free-XOR” Technique | 2012-06-15 | Paper |
| Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces | 2012-06-08 | Paper |
| Partial fairness in secure two-party computation | 2012-05-23 | Paper |
| Which languages have 4-round zero-knowledge proofs? | 2012-05-23 | Paper |
| Two-server password-only authenticated key exchange | 2012-05-11 | Paper |
| Constant-Round Private Function Evaluation with Linear Complexity | 2011-12-02 | Paper |
| Round-Optimal Password-Based Authenticated Key Exchange | 2011-05-19 | Paper |
| Limits of Computational Differential Privacy in the Client/Server Setting | 2011-05-19 | Paper |
| Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions | 2011-05-19 | Paper |
| Impossibility of Blind Signatures from One-Way Permutations | 2011-05-19 | Paper |
| On Achieving the “Best of Both Worlds” in Secure Multiparty Computation | 2011-05-17 | Paper |
| A Group Signature Scheme from Lattice Assumptions | 2010-12-07 | Paper |
| Lower bounds on the efficiency of encryption and digital signature schemes | 2010-08-16 | Paper |
| Partial Fairness in Secure Two-Party Computation | 2010-06-01 | Paper |
| Secure Network Coding over the Integers | 2010-05-28 | Paper |
| Bounds on the efficiency of black-box commitment schemes | 2010-03-10 | Paper |
| Efficient Rational Secret Sharing in Standard Communication Networks | 2010-02-24 | Paper |
| On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations | 2009-12-15 | Paper |
| Proofs of Storage from Homomorphic Identification Protocols | 2009-12-15 | Paper |
| Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices | 2009-12-15 | Paper |
| Signature Schemes with Bounded Leakage Resilience | 2009-12-15 | Paper |
| Collusion-Free Multiparty Computation in the Mediated Model | 2009-10-20 | Paper |
| Improving the round complexity of VSS in point-to-point networks | 2009-07-15 | Paper |
| Ring signatures: Stronger definitions, and constructions without random oracles | 2009-06-30 | Paper |
| Reducing complexity assumptions for statistically-hiding commitment | 2009-06-30 | Paper |
| Handling expected polynomial-time strategies in simulation-based security proofs | 2009-06-08 | Paper |
| Topics in Cryptology – CT-RSA 2004 | 2009-05-07 | Paper |
| Signing a Linear Subspace: Signature Schemes for Network Coding | 2009-03-24 | Paper |
| On expected constant-round protocols for Byzantine agreement | 2009-03-11 | Paper |
| Universally-Composable Two-Party Computation in Two Rounds | 2009-03-10 | Paper |
| Complete Fairness in Multi-party Computation without an Honest Majority | 2009-03-03 | Paper |
| Digital Signatures | 2009-02-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549592 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549726 | 2009-01-05 | Paper |
| Rational Secret Sharing, Revisited | 2008-11-27 | Paper |
| How to Encrypt with a Malicious Random Number Generator | 2008-09-18 | Paper |
| Improving the Round Complexity of VSS in Point-to-Point Networks | 2008-08-19 | Paper |
| Reducing Complexity Assumptions for Statistically-Hiding Commitment | 2008-05-06 | Paper |
| Universally Composable Password-Based Key Exchange | 2008-05-06 | Paper |
| Aggregate Message Authentication Codes | 2008-04-24 | Paper |
| Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products | 2008-04-15 | Paper |
| Efficient Cryptographic Protocols Based on the Hardness of Learning Parity with Noise | 2008-03-07 | Paper |
| Which Languages Have 4-Round Zero-Knowledge Proofs? | 2008-03-05 | Paper |
| Universally Composable Multi-party Computation with an Unreliable Common Reference String | 2008-03-05 | Paper |
| Bridging Game Theory and Cryptography: Recent Results and Future Directions | 2008-03-05 | Paper |
| Efficient signature schemes with tight reductions to the Diffie-Hellman problems | 2007-12-06 | Paper |
| Universally Composable Multi-party Computation Using Tamper-Proof Hardware | 2007-11-29 | Paper |
| Round-Efficient Secure Computation in Point-to-Point Networks | 2007-11-29 | Paper |
| Advances in Cryptology - CRYPTO 2003 | 2007-11-28 | Paper |
| Chosen‐Ciphertext Security from Identity‐Based Encryption | 2007-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5310362 | 2007-10-11 | Paper |
| Advances in Cryptology - EUROCRYPT 2004 | 2007-09-25 | Paper |
| Parallel and Concurrent Security of the HB and HB + Protocols | 2007-09-24 | Paper |
| Two-Server Password-Only Authenticated Key Exchange | 2007-09-24 | Paper |
| On Expected Constant-Round Protocols for Byzantine Agreement | 2007-09-04 | Paper |
| Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions | 2007-08-30 | Paper |
| A forward-secure public-key encryption scheme | 2007-08-20 | Paper |
| Scalable protocols for authenticated group key exchange | 2007-05-24 | Paper |
| Theory of Cryptography | 2007-02-12 | Paper |
| Security in Communication Networks | 2006-10-10 | Paper |
| Characterization of security notions for probabilistic private-key encryption | 2006-08-14 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Information Security and Cryptology - ICISC 2003 | 2005-12-27 | Paper |
| Topics in Cryptology – CT-RSA 2005 | 2005-12-08 | Paper |
| Theory of Cryptography | 2005-12-07 | Paper |
| Theory of Cryptography | 2005-12-07 | Paper |
| Theory of Cryptography | 2005-12-07 | Paper |
| Bounds on the Efficiency of Generic Cryptographic Constructions | 2005-10-28 | Paper |
| Advances in Cryptology – CRYPTO 2004 | 2005-08-23 | Paper |
| Incremental Unforgeable Encryption | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737236 | 2004-08-11 | Paper |
| The mathematics and statistics of voting power | 2004-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4434877 | 2003-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4434880 | 2003-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418524 | 2003-08-10 | Paper |
| Poststratification Without Population Level Information on the Poststratifying Variable With Application to Political Polling | 2003-08-07 | Paper |
| Strong Key-Insulated Signature Schemes | 2003-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414266 | 2003-07-24 | Paper |
| Threshold Cryptosystems Based on Factoring | 2003-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4408421 | 2003-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3149675 | 2002-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536198 | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2778842 | 2002-03-21 | Paper |
