| Publication | Date of Publication | Type |
|---|
| On broadcast in generalized network and adversarial models | 2026-03-31 | Paper |
| Anamorphic encryption, revisited | 2024-11-12 | Paper |
Bitcoin as a Transaction Ledger: A Composable Treatment
Journal of Cryptology | 2024-04-21 | Paper |
Deniable authentication when signing keys leak
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-12 | Paper |
Practical provably secure flooding for blockchains
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-25 | Paper |
Anonymous authenticated communication
Lecture Notes in Computer Science | 2023-07-25 | Paper |
Giving an adversary guarantees (or: how to model designated verifier signatures in a composable framework)
Lecture Notes in Computer Science | 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
Computer Security — ESORICS 96 | 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
Journal of Cryptology | 2020-11-06 | Paper |
| A unified and composable take on ratcheting | 2020-04-30 | Paper |
Composable and finite computational security of quantum message transmission
(available as arXiv preprint) | 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
Theoretical Computer Science | 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
STACS 96 | 2017-11-16 | Paper |
Optimal tree-based one-time digital signature schemes
STACS 96 | 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)
Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 | 2017-09-29 | Paper |
scientific article; zbMATH DE number 6765508 (Why is no real title available?)
(available as arXiv preprint) | 2017-08-25 | Paper |
Breaking RSA Generically Is Equivalent to Factoring
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
From Indifferentiability to Constructive Cryptography (and Back)
Theory of Cryptography | 2016-12-21 | Paper |
Network-Hiding Communication and Applications to Multi-party Protocols
Advances in Cryptology – CRYPTO 2016 | 2016-10-27 | Paper |
Memory erasability amplification
Lecture Notes in Computer Science | 2016-10-21 | Paper |
Idealizing identity-based encryption
Advances in Cryptology -- ASIACRYPT 2015 | 2016-06-10 | Paper |
Augmented secure channels and the goal of the TLS 1.3 record layer
Provable Security | 2016-01-27 | Paper |
Robust authenticated encryption and the limits of symmetric cryptography
Cryptography and Coding | 2016-01-12 | Paper |
(De-)constructing TLS 1.3
Progress in Cryptology -- INDOCRYPT 2015 | 2016-01-12 | Paper |
Diffie-Hellman Oracles
Advances in Cryptology — CRYPTO ’96 | 2015-11-11 | Paper |
Zero-knowledge proofs of knowledge for group homomorphisms
Designs, Codes and Cryptography | 2015-10-26 | Paper |
Query-complexity amplification for random oracles
Lecture Notes in Computer Science | 2015-09-24 | Paper |
Anonymous authentication with shared secrets
Progress in Cryptology - LATINCRYPT 2014 | 2015-09-17 | Paper |
From single-bit to multi-bit public-key encryption via non-malleable codes
Theory of Cryptography | 2015-07-06 | Paper |
Hybrid-secure MPC, trading information-theoretic robustness for computational privacy
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Key-indistinguishable message authentication codes
Lecture Notes in Computer Science | 2014-10-14 | Paper |
From partial consistency to global broadcast
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Broadcast amplification
Theory of Cryptography | 2014-02-18 | Paper |
Constructing confidential channels from authenticated channels-public-key encryption revisited
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
A constructive perspective on key encapsulation
Lecture Notes in Computer Science | 2013-12-10 | Paper |
A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation
Advances in Cryptology – CRYPTO 2013 | 2013-09-17 | Paper |
Resource-restricted indifferentiability
Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings | 2013-05-31 | Paper |
Universally composable synchronous computation
Theory of Cryptography | 2013-03-18 | Paper |
Passive corruption in statistical multi-party computation. (Extended abstract)
Lecture Notes in Computer Science | 2012-11-06 | Paper |
Collusion-preserving computation
Lecture Notes in Computer Science | 2012-09-25 | Paper |
UOWHFs from OWFs: trading regularity for efficiency
Progress in Cryptology – LATINCRYPT 2012 | 2012-09-21 | Paper |
Constructive cryptography -- a new paradigm for security definitions and proofs
Theory of Security and Applications | 2012-08-22 | Paper |
Confidentiality and integrity: a constructive perspective
Theory of Cryptography | 2012-06-15 | Paper |
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
Lecture Notes in Computer Science | 2011-12-02 | Paper |
Graceful degradation in multi-party computation. (Extended abstract)
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Free-start distinguishing: combining two types of indistinguishability amplification
Lecture Notes in Computer Science | 2010-09-29 | Paper |
Constructive cryptography -- a primer. (Abstract)
Financial Cryptography and Data Security | 2010-08-17 | Paper |
Tight security proofs for the bounded-storage model
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
Theory of Cryptography | 2010-02-24 | Paper |
Intrinsic limitations of digital signatures and how to cope with them
Lecture Notes in Computer Science | 2010-02-09 | Paper |
Cascade Encryption Revisited
Advances in Cryptology – ASIACRYPT 2009 | 2009-12-15 | Paper |
Random Systems: Theory and Applications
Lecture Notes in Computer Science | 2009-12-03 | Paper |
Computational Indistinguishability Amplification: Tight Product Theorems for System Composition
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
Unifying Zero-Knowledge Proofs of Knowledge
Progress in Cryptology – AFRICACRYPT 2009 | 2009-07-07 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2009-05-14 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2009-05-14 | Paper |
Breaking RSA Generically Is Equivalent to Factoring
Advances in Cryptology - EUROCRYPT 2009 | 2009-05-12 | Paper |
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
Indistinguishability Amplification
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
Realistic Failures in Secure Multi-party Computation
Theory of Cryptography | 2009-03-03 | Paper |
Introduction to the Special Issue on Information Theoretic Security
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
MPC vs. SFE : Unconditional and Computational Security
Advances in Cryptology - ASIACRYPT 2008 | 2009-02-10 | Paper |
Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography
Advances in Cryptology - ASIACRYPT 2008 | 2009-02-10 | Paper |
Abstract Storage Devices
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Abstract Storage Devices
Lecture Notes in Computer Science | 2009-02-03 | Paper |
On the Power of Quantum Memory
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
Advances in Cryptology – ASIACRYPT 2007 | 2008-05-15 | Paper |
MPC vs. SFE: Perfect Security in a Unified Corruption Model
Theory of Cryptography | 2008-03-05 | Paper |
A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security
Advances in Cryptology - EUROCRYPT 2007 | 2007-11-29 | Paper |
Advances in Cryptology - EUROCRYPT 2004
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Luby-Rackoff Ciphers from Weak Round Functions?
Advances in Cryptology - EUROCRYPT 2006 | 2007-09-24 | Paper |
Cryptography and Coding
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Cryptography and Coding
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Cryptography and Coding
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Byzantine agreement given partial broadcast
Journal of Cryptology | 2006-09-12 | Paper |
Secure multi-party computation made simple
Discrete Applied Mathematics | 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
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Public Key Cryptography - PKC 2005
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Advances in Cryptology – CRYPTO 2004
Lecture Notes in Computer Science | 2005-08-23 | Paper |
Towards a Theory of Consistency Primitives
Lecture Notes in Computer Science | 2005-08-17 | Paper |
Secret-key agreement over unauthenticated public channels-part II: the simulatability condition
IEEE Transactions on Information Theory | 2005-06-01 | Paper |
Secret-key agreement over unauthenticated public channels-part I: definitions and a completeness result
IEEE Transactions on Information Theory | 2005-06-01 | Paper |
Secret-key agreement over unauthenticated public channels-part III: privacy amplification
IEEE Transactions on Information Theory | 2005-06-01 | Paper |
Minimal complete primitives for secure multi-party computation
Journal of Cryptology | 2005-05-13 | Paper |
| scientific article; zbMATH DE number 2102675 (Why is no real title available?) | 2004-09-24 | Paper |
Optimal randomizer efficiency in the bounded-storage model
Journal of Cryptology | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2086702 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2086726 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2009979 (Why is no real title available?) | 2003-11-26 | Paper |
| scientific article; zbMATH DE number 1952886 (Why is no real title available?) | 2003-07-24 | Paper |
| scientific article; zbMATH DE number 1848306 (Why is no real title available?) | 2003-07-10 | Paper |
| scientific article; zbMATH DE number 1942444 (Why is no real title available?) | 2003-06-30 | Paper |
| scientific article; zbMATH DE number 1759322 (Why is no real title available?) | 2003-03-07 | Paper |
| scientific article; zbMATH DE number 1759326 (Why is no real title available?) | 2003-01-25 | Paper |
| scientific article; zbMATH DE number 1842487 (Why is no real title available?) | 2002-12-08 | Paper |
Player simulation and general adversary structures in perfect multiparty computation
Journal of Cryptology | 2002-06-25 | Paper |
| scientific article; zbMATH DE number 1504552 (Why is no real title available?) | 2002-01-27 | Paper |
| scientific article; zbMATH DE number 1440052 (Why is no real title available?) | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1583776 (Why is no real title available?) | 2001-07-03 | Paper |
Authentication theory and hypothesis testing
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
| scientific article; zbMATH DE number 1418286 (Why is no real title available?) | 2000-07-26 | Paper |
The Diffie-Hellman protocol
Designs, Codes and Cryptography | 2000-05-08 | Paper |
| scientific article; zbMATH DE number 1406769 (Why is no real title available?) | 2000-03-01 | Paper |
| scientific article; zbMATH DE number 1406786 (Why is no real title available?) | 2000-03-01 | Paper |
| scientific article; zbMATH DE number 1408375 (Why is no real title available?) | 2000-02-29 | Paper |
Unconditionally secure key agreement and the intrinsic conditional information
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1303114 (Why is no real title available?) | 1999-09-06 | Paper |
| scientific article; zbMATH DE number 1302842 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1088243 (Why is no real title available?) | 1998-11-03 | Paper |
| scientific article; zbMATH DE number 1088921 (Why is no real title available?) | 1998-01-26 | Paper |
Linking information reconciliation and privacy amplification
Journal of Cryptology | 1997-10-20 | Paper |
A non-interactive public-key distribution system
Designs, Codes and Cryptography | 1997-10-06 | Paper |
Cryptology: A new application of mathematics
Elemente der Mathematik | 1997-04-28 | Paper |
| scientific article; zbMATH DE number 820501 (Why is no real title available?) | 1997-04-28 | Paper |
Generalized privacy amplification
IEEE Transactions on Information Theory | 1997-02-25 | Paper |
| scientific article; zbMATH DE number 1088242 (Why is no real title available?) | 1997-01-01 | Paper |
On the oracle complexity of factoring integers
Computational Complexity | 1996-11-17 | Paper |
| scientific article; zbMATH DE number 708824 (Why is no real title available?) | 1995-02-16 | Paper |
Fast generation of prime numbers and secure public-key cryptographic parameters.
Journal of Cryptology | 1995-01-01 | Paper |
| scientific article; zbMATH DE number 503356 (Why is no real title available?) | 1994-11-09 | Paper |
| scientific article; zbMATH DE number 503342 (Why is no real title available?) | 1994-10-09 | Paper |
| scientific article; zbMATH DE number 549857 (Why is no real title available?) | 1994-09-04 | Paper |
| scientific article; zbMATH DE number 503359 (Why is no real title available?) | 1994-02-22 | Paper |
| scientific article; zbMATH DE number 503266 (Why is no real title available?) | 1994-02-17 | Paper |
Secret key agreement by public discussion from common information
IEEE Transactions on Information Theory | 1994-02-07 | Paper |
| scientific article; zbMATH DE number 176555 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 177614 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 177048 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 177610 (Why is no real title available?) | 1993-05-18 | Paper |
Cascade ciphers: The importance of being first
Journal of Cryptology | 1993-05-16 | Paper |
A universal statistical test for random bit generators
Journal of Cryptology | 1993-01-16 | Paper |
Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
Discrete Applied Mathematics | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 67086 (Why is no real title available?) | 1992-09-27 | Paper |
Conditionally-perfect secrecy and a provably-secure randomized cipher
Journal of Cryptology | 1992-06-28 | Paper |
Local randomness in pseudorandom sequences
Journal of Cryptology | 1992-06-27 | Paper |
| scientific article; zbMATH DE number 16481 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 4186979 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4057444 (Why is no real title available?) | 1988-01-01 | Paper |
