| Publication | Date of Publication | Type |
|---|
| Anamorphic encryption, revisited | 2024-11-12 | Paper |
| Bitcoin as a Transaction Ledger: A Composable Treatment | 2024-04-21 | Paper |
| Deniable authentication when signing keys leak | 2023-12-12 | Paper |
| Practical provably secure flooding for blockchains | 2023-08-25 | Paper |
| Anonymous authenticated communication | 2023-07-25 | Paper |
| Giving an adversary guarantees (or: how to model designated verifier signatures in a composable framework) | 2023-05-12 | Paper |
| Direct product hardness amplification | 2023-04-13 | Paper |
| Generalized proofs of knowledge with fully dynamic setup | 2023-03-31 | Paper |
| Adaptive security of multi-party protocols, revisited | 2023-03-31 | Paper |
| MPC with synchronous security and asynchronous responsiveness | 2023-03-29 | Paper |
| Anonymous symmetric-key communication | 2022-12-16 | Paper |
| Overcoming impossibility results in composable security using interval-wise guarantees | 2022-11-09 | Paper |
| Multi-designated receiver signed public key encryption | 2022-08-30 | Paper |
| Modelling a public-key infrastructure | 2022-08-16 | Paper |
| Strong Separations Between Broadcast and Authenticated Channels | 2022-07-21 | Paper |
| Synchronous constructive cryptography | 2022-03-23 | Paper |
| Coupling of random systems | 2022-03-23 | Paper |
| Revisiting (R)CCA security and replay protection | 2021-12-21 | Paper |
| A calculus for secure channel establishment in open networks | 2021-12-20 | Paper |
| Topology-hiding computation for networks with unknown delays | 2021-12-01 | Paper |
| Effects of Quantization on the Multiple-Round Secret-Key Capacity | 2021-05-04 | Paper |
| Non-malleable encryption: simpler, shorter, stronger | 2020-11-06 | Paper |
| A unified and composable take on ratcheting | 2020-04-30 | Paper |
| Composable and finite computational security of quantum message transmission | 2020-04-30 | Paper |
| Efficient ratcheting: almost-optimal guarantees for secure messaging | 2020-02-04 | Paper |
| Composable and robust outsourced storage | 2020-01-21 | Paper |
| Information-theoretic secret-key agreement: the asymptotically tight relation between the secret-key rate and the channel quality ratio | 2018-12-11 | Paper |
| Topology-hiding computation beyond semi-honest adversaries | 2018-12-06 | Paper |
| Security definitions for hash functions: combining UCE and indifferentiability | 2018-10-17 | Paper |
| A constructive perspective on signcryption security | 2018-10-17 | Paper |
| Toward an algebraic theory of systems | 2018-09-24 | Paper |
| But why does it work? A rational protocol design treatment of bitcoin | 2018-07-09 | Paper |
| On composable security for digital signatures | 2018-05-16 | Paper |
| Strengthening access control encryption | 2018-04-06 | Paper |
| A unified and generalized treatment of authentication theory | 2017-11-16 | Paper |
| Optimal tree-based one-time digital signature schemes | 2017-11-16 | Paper |
| Bitcoin as a transaction ledger: a composable treatment | 2017-11-03 | Paper |
| Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract) | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5347985 | 2017-08-25 | Paper |
| Breaking RSA Generically Is Equivalent to Factoring | 2017-04-28 | Paper |
| From Indifferentiability to Constructive Cryptography (and Back) | 2016-12-21 | Paper |
| Network-Hiding Communication and Applications to Multi-party Protocols | 2016-10-27 | Paper |
| Memory erasability amplification | 2016-10-21 | Paper |
| Idealizing identity-based encryption | 2016-06-10 | Paper |
| Augmented secure channels and the goal of the TLS 1.3 record layer | 2016-01-27 | Paper |
| Robust authenticated encryption and the limits of symmetric cryptography | 2016-01-12 | Paper |
| (De-)constructing TLS 1.3 | 2016-01-12 | Paper |
| Diffie-Hellman Oracles | 2015-11-11 | Paper |
| Zero-knowledge proofs of knowledge for group homomorphisms | 2015-10-26 | Paper |
| Query-complexity amplification for random oracles | 2015-09-24 | Paper |
| Anonymous authentication with shared secrets | 2015-09-17 | Paper |
| From single-bit to multi-bit public-key encryption via non-malleable codes | 2015-07-06 | Paper |
| Hybrid-secure MPC, trading information-theoretic robustness for computational privacy | 2015-03-02 | Paper |
| Key-indistinguishable message authentication codes | 2014-10-14 | Paper |
| From partial consistency to global broadcast | 2014-09-26 | Paper |
| Broadcast amplification | 2014-02-18 | Paper |
| Constructing confidential channels from authenticated channels-public-key encryption revisited | 2013-12-10 | Paper |
| A constructive perspective on key encapsulation | 2013-12-10 | Paper |
| A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation | 2013-09-17 | Paper |
| Resource-restricted indifferentiability | 2013-05-31 | Paper |
| Universally composable synchronous computation | 2013-03-18 | Paper |
| Passive corruption in statistical multi-party computation. (Extended abstract) | 2012-11-06 | Paper |
| Collusion-preserving computation | 2012-09-25 | Paper |
| UOWHFs from OWFs: trading regularity for efficiency | 2012-09-21 | Paper |
| Constructive cryptography -- a new paradigm for security definitions and proofs | 2012-08-22 | Paper |
| Confidentiality and integrity: a constructive perspective | 2012-06-15 | Paper |
| The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy | 2011-12-02 | Paper |
| Graceful degradation in multi-party computation. (Extended abstract) | 2011-05-19 | Paper |
| Free-start distinguishing: combining two types of indistinguishability amplification | 2010-09-29 | Paper |
| Constructive cryptography -- a primer. (Abstract) | 2010-08-17 | Paper |
| Tight security proofs for the bounded-storage model | 2010-08-05 | Paper |
| A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch | 2010-02-24 | Paper |
| Intrinsic limitations of digital signatures and how to cope with them | 2010-02-09 | Paper |
| Cascade Encryption Revisited | 2009-12-15 | Paper |
| Random Systems: Theory and Applications | 2009-12-03 | Paper |
| Computational Indistinguishability Amplification: Tight Product Theorems for System Composition | 2009-10-20 | Paper |
| Unifying Zero-Knowledge Proofs of Knowledge | 2009-07-07 | Paper |
| Theory of Cryptography | 2009-05-14 | Paper |
| Theory of Cryptography | 2009-05-14 | Paper |
| Breaking RSA Generically Is Equivalent to Factoring | 2009-05-12 | Paper |
| Domain Extension of Public Random Functions: Beyond the Birthday Barrier | 2009-03-10 | Paper |
| Indistinguishability Amplification | 2009-03-10 | Paper |
| Realistic Failures in Secure Multi-party Computation | 2009-03-03 | Paper |
| Introduction to the Special Issue on Information Theoretic Security | 2009-02-24 | Paper |
| The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement | 2009-02-24 | Paper |
| MPC vs. SFE : Unconditional and Computational Security | 2009-02-10 | Paper |
| Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography | 2009-02-10 | Paper |
| Abstract Storage Devices | 2009-02-03 | Paper |
| On the Power of Quantum Memory | 2008-12-21 | Paper |
| Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations | 2008-05-15 | Paper |
| MPC vs. SFE: Perfect Security in a Unified Corruption Model | 2008-03-05 | Paper |
| A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security | 2007-11-29 | Paper |
| Advances in Cryptology - EUROCRYPT 2004 | 2007-09-25 | Paper |
| Luby-Rackoff Ciphers from Weak Round Functions? | 2007-09-24 | Paper |
| Cryptography and Coding | 2006-11-01 | Paper |
| Cryptography and Coding | 2006-11-01 | Paper |
| Cryptography and Coding | 2006-11-01 | Paper |
| Byzantine agreement given partial broadcast | 2006-09-12 | Paper |
| Secure multi-party computation made simple | 2006-04-28 | Paper |
| General secure multi-party computation from any linear secret-sharing scheme | 2006-03-01 | Paper |
| Information-theoretic key agreement: from weak to strong secret for free | 2006-03-01 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Public Key Cryptography - PKC 2005 | 2005-12-07 | Paper |
| Advances in Cryptology – CRYPTO 2004 | 2005-08-23 | Paper |
| Towards a Theory of Consistency Primitives | 2005-08-17 | Paper |
| Secret-key agreement over unauthenticated public channels-part II: the simulatability condition | 2005-06-01 | Paper |
| Secret-key agreement over unauthenticated public channels-part I: definitions and a completeness result | 2005-06-01 | Paper |
| Secret-key agreement over unauthenticated public channels-part III: privacy amplification | 2005-06-01 | Paper |
| Minimal complete primitives for secure multi-party computation | 2005-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817510 | 2004-09-24 | Paper |
| Optimal randomizer efficiency in the bounded-storage model | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737239 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737266 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4434898 | 2003-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414265 | 2003-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785498 | 2003-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4409143 | 2003-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536259 | 2003-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536263 | 2003-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4783721 | 2002-12-08 | Paper |
| Player simulation and general adversary structures in perfect multiparty computation | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4502503 | 2002-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4950038 | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2707411 | 2001-07-03 | Paper |
| Authentication theory and hypothesis testing | 2000-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941846 | 2000-07-26 | Paper |
| The Diffie-Hellman protocol | 2000-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940683 | 2000-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940702 | 2000-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941190 | 2000-02-29 | Paper |
| Unconditionally secure key agreement and the intrinsic conditional information | 1999-11-21 | Paper |
| The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249629 | 1999-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249325 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364560 | 1998-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4365746 | 1998-01-26 | Paper |
| Linking information reconciliation and privacy amplification | 1997-10-20 | Paper |
| A non-interactive public-key distribution system | 1997-10-06 | Paper |
| Cryptology: A new application of mathematics | 1997-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4857246 | 1997-04-28 | Paper |
| Generalized privacy amplification | 1997-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364559 | 1997-01-01 | Paper |
| On the oracle complexity of factoring integers | 1996-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318715 | 1995-02-16 | Paper |
| Fast generation of prime numbers and secure public-key cryptographic parameters. | 1995-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279695 | 1994-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279681 | 1994-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4287361 | 1994-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279698 | 1994-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279591 | 1994-02-17 | Paper |
| Secret key agreement by public discussion from common information | 1994-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035724 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037493 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036892 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037488 | 1993-05-18 | Paper |
| Cascade ciphers: The importance of being first | 1993-05-16 | Paper |
| A universal statistical test for random bit generators | 1993-01-16 | Paper |
| Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4011774 | 1992-09-27 | Paper |
| Conditionally-perfect secrecy and a provably-secure randomized cipher | 1992-06-28 | Paper |
| Local randomness in pseudorandom sequences | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3973160 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5751835 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3792629 | 1988-01-01 | Paper |
