Anamorphic Encryption, Revisited
Advances in Cryptology – EUROCRYPT 2024, LNCS, Springer Nature Switzerland, vol. 14652, pp. 3–32, May 2024.
Publications of 2024
Closing The Efficiency Gap Between Synchronous and Network-Agnostic Consensus
Eurocrypt, May 2024.
From Random Probing to Noisy Leakages Without Field-Size Dependence
Eurocrypt, May 2024.
Publications of 2023
Perfect MPC over Layered Graphs
Advances in Cryptology—CRYPTO 2023, LNCS, Springer Nature Switzerland, vol. 14081, pp. 360–392, Aug 2023.
Efficient Synchronization-Light Work Stealing
ACM Symposium on Parallelism in Algorithms and Architectures—SPAA 2023, ACM, pp. 39–49, Jun 2023.
Deniable Authentication when Signing Keys Leak
Advances in Cryptology—EUROCRYPT 2023, Lecture Notes in Computer Science, Springer International Publishing, vol. 14006, pp. 69–100, May 2023.
Synchronous Perfectly Secure Message Transmission with Optimal Asynchronous Fallback Guarantees
Financial Cryptography and Data Security, Springer Nature Switzerland, vol. , pp. 77–93, May 2023.
Practical Provably Secure Flooding for Blockchains
Advances in Cryptology—ASIACRYPT 2022, Lecture Notes in Computer Science, Springer International Publishing, vol. 13791, pp. 774–805, Feb 2023.
Publications of 2022
Anonymous Authenticated Communication
Security and Cryptography for Networks – SCN 2022, LNCS, Springer, vol. 13409, pp. 289–312, Sep 2022.
Multi-Designated Receiver Signed Public Key Encryption
Advances in Cryptology—EUROCRYPT 2022, Lecture Notes in Computer Science, Springer International Publishing, vol. 13276, pp. 644–673, May 2022.
SCB Mode: Semantically Secure Length-Preserving Encryption
IACR Trans. Symm. Cryptol., Ruhr-Universität Bochum, vol. 2022, no. 4, pp. 1–23, 2022.
Publications of 2021
Giving an Adversary Guarantees (Or: How to Model Designated Verifier Signatures in a Composable Framework)
Advances in Cryptology—ASIACRYPT 2021, Lecture Notes in Computer Science, Springer International Publishing, vol. 13092, pp. 189–219, Dec 2021.
Adaptive Security of Multi-Party Protocols, Revisited
Theory of Cryptography — TCC 2021, LNCS, Springer International Publishing, vol. 13042, pp. 686–716, Nov 2021.
Direct Product Hardness Amplification
Theory of Cryptography — TCC 2021, LNCS, Springer International Publishing, vol. 13043, pp. 605–625, Nov 2021.
Generalized Proofs of Knowledge with Fully Dynamic Setup
Theory of Cryptography – TCC 2021, LNCS, Springer International Publishing, vol. 13042, pp. 499–528, Nov 2021.
On Communication-Efficient Asynchronous MPC with Adaptive Security
Theory of Cryptography — TCC 2021, LNCS, Springer International Publishing, vol. 13043, pp. 35–65, Nov 2021.
Round-Efficient Byzantine Agreement and Multi-Party Computation with Asynchronous Fallback
Theory of Cryptography — TCC 2021, LNCS, Springer International Publishing, vol. 13042, pp. 623–653, Nov 2021.
Scheduling computations with provably low synchronization overheads
Journal of Scheduling, Springer International Publishing, Oct 2021.
Revisiting (R)CCA Security and Replay Protection
Public-Key Cryptography – PKC 2021, Lecture Notes in Computer Science, Springer International Publishing, vol. 12711, pp. 173–202, May 2021.
Abstract Modeling of System Communication in Constructive Cryptography using CryptHOL
Computer Security Foundations Symposium – CSF 2021, pp. 1–16, 2021.
Publications of 2020
Asynchronous Byzantine Agreement with Subquadratic Communication
Theory of Cryptography — TCC 2020, LNCS, Springer International Publishing, vol. 12552, pp. 353–380, Dec 2020.
Continuous Group Key Agreement with Active Security
Theory of Cryptography — TCC 2020, LNCS, Springer International Publishing, vol. 12552, pp. 261–290, Dec 2020.
Coupling of Random Systems
Theory of Cryptography — TCC 2020, LNCS, Springer International Publishing, vol. 12552, pp. 207–240, Dec 2020.
MPC with Synchronous Security and Asynchronous Responsiveness
Advances in Cryptology—ASIACRYPT 2020, Dec 2020.
Multi-Threshold Asynchronous Reliable Broadcast and Consensus
International Conference on Principles of Distributed Systems — OPODIS 2020, Dec 2020.
On Broadcast in Generalized Network and Adversarial Models
International Conference on Principles of Distributed Systems — OPODIS 2020, Dec 2020.
Synchronous Constructive Cryptography
Theory of Cryptography — TCC 2020, LNCS, Springer International Publishing, vol. 12552, pp. 439–472, Dec 2020.
Brief Announcement: Multi-Threshold Asynchronous Reliable Broadcast and Consensus
International Symposium on Distributed Computing — DISC 2020, Oct 2020.
From Partial to Global Asynchronous Reliable Broadcast
International Symposium on Distributed Computing — DISC 2020, Oct 2020.
Anonymous Symmetric-Key Communication
Security and Cryptography for Networks – SCN 2020, LNCS, Springer, vol. 12238, pp. 471–491, Sep 2020.
Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback
Advances in Cryptology – CRYPTO 2020, LNCS, Springer, vol. 12171, pp. 707–731, Aug 2020.
Overcoming Impossibility Results in Composable Security Using Interval-Wise Guarantees
Advances in Cryptology – CRYPTO 2020, LNCS, Springer, vol. 12170, pp. 33–62, Aug 2020.
Efficient MPC with a Mixed Adversary
1st Conference on Information-Theoretic Cryptography (ITC 2020), Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl–Leibniz-Zentrum für Informatik, vol. 163, pp. 3:1–3:23, Jun 2020.
Topology-Hiding Computation for Networks with Unknown Delays
Public-Key Cryptography — PKC 2020, LNCS, Springer, vol. 12111, pp. 215–245, Apr 2020.
On Generalizations of Composable Security
PhD Thesis, ETH Zurich, 2020.
Publications of 2019
A Unified and Composable Take on Ratcheting
Theory of Cryptography — TCC 2019, LNCS, Springer International Publishing, vol. 11891, pp. 180–210, Dec 2019.
Composable and Finite Computational Security of Quantum Message Transmission
Theory of Cryptography – TCC 2019, LNCS, Springer, vol. 11891, pp. 282–311, Dec 2019.
Brief Announcement: Towards Byzantine Broadcast in Generalized Communication and Adversarial Models
International Symposium on Distributed Computing — DISC 2019, Oct 2019.
Formalizing Constructive Cryptography using CryptHOL
IEEE 32rd Computer Security Foundations Symposium (CSF), IEEE Press, Jun 2019.
Efficient Ratcheting: Almost-Optimal Guarantees for Secure Messaging
Advances in Cryptology – EUROCRYPT 2019, LNCS, Springer International Publishing, vol. 11476, pp. 159–188, May 2019.
Per-session Security: Password-based Cryptography Revisited
Journal of Computer Security, IOS Press, vol. 27, pp. 75–111, 2019.
Publications of 2018
Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio
Theory of Cryptography — TCC 2018, LNCS, Springer International Publishing, vol. 11239, pp. 345–369, Nov 2018.
Topology-Hiding Computation Beyond Semi-Honest Adversaries
Theory of Cryptography — TCC, LNCS, Springer International Publishing, vol. 11240, pp. 3–35, Nov 2018.
Toward an Algebraic Theory of Systems
Theoretical Computer Science, vol. 747, pp. 1–25, Nov 2018.
A Constructive Perspective on Signcryption Security
Security and Cryptography for Networks – SCN 2018, LNCS, Springer, vol. 11035, pp. 102–120, Sep 2018.
Security Definitions For Hash Functions: Combining UCE and Indifferentiability
International Conference on Security and Cryptography for Networks – SCN 2018, LNCS, Springer, vol. 11035, pp. 83–101, Sep 2018.
But Why does it Work? A Rational Protocol Design Treatment of Bitcoin
Advances in Cryptology — EUROCRYPT 2018, LNCS, Springer, vol. 10821 (Proceedings Part II), pp. 34–65, Apr 2018.
Composable and Robust Outsourced Storage
Topics in Cryptology — CT-RSA 2018, LNCS, Springer, vol. 10808, pp. 354-373, Apr 2018.
On Composable Security for Digital Signatures
Public-Key Cryptography — PKC 2018, LNCS, Springer, vol. 10769 (Proceedings Part I), pp. 494–523, Mar 2018.
An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants
Computer and Communications Security — CCS 2018", 2018.
CRYSTALS – Kyber: a CCA-secure module-lattice-based KEM
2018 IEEE European Symposium on Security and Privacy (EuroS&P), IEEE, pp. 353-367, 2018.
CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme
IACR Transactions on Cryptographic Hardware and Embedded Systems (TCHES), vol. 2018, no. 1, pp. 238-268, 2018.
Faster AVX2 optimized NTT multiplication for Ring-LWE lattice cryptography
Cryptology ePrint Archive, 2018, Report 2018/039.
Idealizations of Practical Cryptographic Building Blocks
PhD Thesis, ETH Zurich, 2018.
Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability
CCS '18: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, ACM, pp. 574-591, 2018.
Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability
The 25th ACM Conference on Computer and Communications Security, 2018.
Short, Invertible Elements in Partially Splitting Cyclotomic Rings and Applications to Lattice-Based Zero-Knowledge Proofs
Advances in Cryptology — EUROCRYPT 2018, Springer, pp. 204-224, 2018.
Publications of 2017
Strengthening Access Control Encryption
Advances in Cryptology—ASIACRYPT 2017, Lecture Notes in Computer Science, Springer International Publishing, vol. 10624, pp. 502–532, Nov 2017.
Per-session Security: Password-based Cryptography Revisited
Computer Security – ESORICS 2017, Lecture Notes in Computer Science, Springer International Publishing, vol. 10492, pp. 408–426, Sep 2017.
Bitcoin as a Transaction Ledger: A Composable Treatment
Advances in Cryptology – CRYPTO 2017, LNCS, Springer, vol. 10401 (Proceedings Part I), pp. 324–356, Aug 2017.
An Information-theoretic Approach to Hardness Amplification
2017 IEEE International Symposium on Information Theory (ISIT), Jun 2017.
Efficiency Lower Bounds for Commit-and-Prove Constructions
2017 IEEE International Symposium on Information Theory (ISIT), IEEE, pp. 1788–1792, Jun 2017.
Witness-Hiding Proofs of Knowledge for Cable Locks
IEEE International Symposium on Information Theory (ISIT), pp. 953-957, Jun 2017.
(Quantum) Min-Entropy Resources
Eprint arXiv:1705.10595, May 2017.
Causal Boxes: Quantum Information-Processing Systems Closed Under Composition
IEEE Transactions on Information Theory, vol. 63, no. 5, pp. 3277-3305, May 2017.
Quantum Authentication with Key Recycling
Advances in Cryptology – EUROCRYPT 2017, Proceedings, Part III, Lecture Notes in Computer Science, Springer, vol. 10212, pp. 339–368, Apr 2017.
Publications of 2016
From Indifferentiability to Constructive Cryptography (and Back)
Theory of Cryptography, Lecture Notes in Computer Science, Springer Berlin Heidelberg, vol. 9985, pp. 1–22, Nov 2016.
Memory Erasability Amplification
Security and Cryptography for Networks (SCN), Lecture Notes in Computer Science, Springer, vol. 9841, pp. 104–125, Aug 2016.
Network-Hiding Communication and Applications to Multi-Party Protocols
Advances in Cryptology – CRYPTO 2016, Security and Cryptology, Springer-Verlag Berlin Heidelberg, vol. 9814, pp. 335-365, Aug 2016.
Hierarchy of Three-Party Consistency Specifications
2016 IEEE International Symposium on Information Theory (ISIT), IEEE, pp. 3048-3052, Jul 2016.
New Perspectives on Weak Oblivious Transfer
2016 IEEE International Symposium on Information Theory (ISIT), pp. 790–794, Jul 2016.
On the Impossibility of Information-Theoretic Composable Coin Toss Extension
2016 IEEE International Symposium on Information Theory, pp. 3058–3061, Jul 2016.
Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions
Advances in Cryptology — ASIACRYPT 2016, Lecture Notes in Computer Science, Springer-Verlag, vol. 10032, 2016.
Cryptography and Computation after Turing
The Once and Future Turing, Cambridge University Press, 2016.
Publications of 2015
Robust Authenticated Encryption and the Limits of Symmetric Cryptography
15th IMA International Conference on Cryptography and Coding - IMACC 2015, LNCS, Springer, vol. 9496, pp. 112–129, Dec 2015.
Augmented Secure Channels and the Goal of the TLS 1.3 Record Layer
The 9th International Conference on Provable Security - ProvSec 2015, LNCS, Springer, vol. 9451, pp. 85–104, Nov 2015.
Incoercible Multi-Party Computation and Universally Composable Receipt-Free Voting
Advances in Cryptology – CRYPTO 2015, LNCS, Springer, vol. 9216, pp. 763-780, Aug 2015.
A Definitional Framework for Functional Encryption
Computer Security Foundations Symposium (CSF), 2015 IEEE 28th, pp. 217-231, Jul 2015.
How Fair is Your Protocol? A Utility-based Approach to Protocol Optimality
ACM Symposium on Principles of Distributed Computing — PODC 2015, ACM, pp. 281-290, Jul 2015.
Query-Complexity Amplification for Random Oracles
Information Theoretic Security, Lecture Notes in Computer Science, Springer International Publishing, vol. 9063, pp. 159-180, May 2015.
The Hidden Communication Graph Model: Achieving Communication Locality and Optimal Resilience in the Presence of Adaptive Faults
Innovations in Theoretical Computer Science — ITCS 2015, ACM, pp. 153-162, Jan 2015.
From Single-Bit to Multi-Bit Public-Key Encryption via Non-Malleable Codes
Theory of Cryptography, Lecture Notes in Computer Science, Springer Berlin Heidelberg, vol. 9014, pp. 532-560, 2015.
Idealizing Identity-Based Encryption
Advances in Cryptology – ASIACRYPT 2015, Lecture Notes in Computer Science, Springer Berlin Heidelberg, vol. 9452, pp. 495-520, 2015.
Two-Server Password-Authenticated Secret Sharing UC-Secure Against Transient Corruptions
Public-Key Cryptography – PKC 2015, Lecture Notes in Computer Science, Springer Berlin Heidelberg, vol. 9020, pp. 283–307, 2015.
Zero-knowledge proofs of knowledge for group homomorphisms
Designs, Codes and Cryptography, vol. 77, pp. 663–676, 2015.
Publications of 2014
Multi-Valued Byzantine Broadcast: the $t < n$ Case
Advances in Cryptology — ASIACRYPT 2014, Lecture Notes in Computer Science, Springer, vol. 8874, pp. 448–465, Dec 2014.
Anonymous Authentication with Shared Secrets
Progress in Cryptology — LATINCRYPT 2014, Sep 2014.
Key-Indistinguishable Message Authentication Codes
The 9th Conference on Security and Cryptography for Networks — SCN 2014, Lecture Notes in Computer Science, Springer, vol. 8642, pp. 476–493, Sep 2014.
Efficient Three-Party Computation from Cut-and-Choose
Advances in Cryptology — CRYPTO 2014, Lecture Notes in Computer Science, Springer-Verlag, vol. 8617, pp. 513-530, Aug 2014.
Secure Multi-Party Computation with Identifiable Abort
Advances in Cryptology — CRYPTO 2014, Lecture Notes in Computer Science, Springer-Verlag, vol. 8617, pp. 369-386, Aug 2014.
Distributing the Setup in Universally Composable Multi-Party Computation
ACM Symposium on Principles of Distributed Computing – PODC 2014, Jul 2014.
Fast and Unconditionally Secure Anonymous Channel
Proc. 33rd ACM Symposium on Principles of Distributed Computing — PODC 2014, ACM, pp. 313–321, Jul 2014.
Optimality of Non-Adaptive Strategies: The Case of Parallel Games
2014 IEEE International Symposium on Information Theory (ISIT), pp. 1707-1711, Jun 2014.
Broadcast Amplification
Theory of Cryptography Conference — TCC 2014, Lecture Notes in Computer Science, Springer, vol. 8349, pp. 419–439, Feb 2014.
Concepts and Languages for Privacy-Preserving Attribute-Based Authentication
Journal of Information Security and Applications, vol. 19, no. 1, pp. 25–44, Feb 2014.
Publications of 2013
Constructing Confidential Channels from Authenticated Channels—Public-Key Encryption Revisited
Advances in Cryptology—ASIACRYPT 2013, Lecture Notes in Computer Science, Springer, vol. 8269, pp. 134–153, Dec 2013.
Efficient General-Adversary Multi-Party Computation
Advances in Cryptology—ASIACRYPT 2013, Lecture Notes in Computer Science, Springer-Verlag, vol. 8270, pp. 181-200, Dec 2013.
Broadcast (and Round) Efficient Verifiable Secret Sharing
The 7th International Conference on Information Theoretic Security — ICITS 2013, Lecture Notes in Computer Science, Springer, vol. 8317, pp. 200–219, Nov 2013.
Rational Protocol Design: Cryptography Against Incentive-driven Adversaries
FOCS 2013, IEEE, Oct 2013.
A Dynamic Tradeoff Between Active and Passive Corruptions in Secure Multi-Party Computation
Advances in Cryptology — CRYPTO 2013, Lecture Notes in Computer Science, Springer-Verlag, vol. 8043, pp. 203–219, Aug 2013.
Learning with Rounding, Revisited: New Reduction, Properties and Applications
Advances in Cryptology — CRYPTO 2013, Lecture Notes in Computer Science, Springer-Verlag, Aug 2013.
Plain versus Randomized Cascading-Based Key-Length Extension for Block Ciphers
Advances in Cryptology — CRYPTO 2013, Lecture Notes in Computer Science, Springer-Verlag, vol. 8042, pp. 551–570, Aug 2013.
Anonymity-preserving Public-Key Encryption: A Constructive Approach
Privacy Enhancing Technologies — 13th International Symposium, Lecture Notes in Computer Science, Springer, vol. 7981, pp. 19–39, Jul 2013.
Authentication Amplification by Synchronization
2013 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 2711–2714, Jul 2013.
Conditional Equivalence of Random Systems and Indistinguishability Proofs
2013 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 3150–3154, Jul 2013.
On the Complexity of Broadcast Setup
Automata, Languages, and Programming — 40th International Colloquium, ICALP (1), Lecture Notes in Computer Science, Springer, vol. 7965, pp. 552–563, Jul 2013.
The One-Time Pad Revisited
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on, pp. 2706-2710, Jul 2013.
Unfair Coin Tossing
2013 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 1556–1560, Jul 2013.
Resource-Restricted Indifferentiability
Advances in Cryptology — EUROCRYPT 2013, Lecture Notes in Computer Science, Springer-Verlag, vol. 7881, pp. 665–684, May 2013, this is the full version.
Feasibility and Completeness of Cryptographic Tasks in the Quantum World
Theory of Cryptography Conference — TCC 2013, Lecture Notes in Computer Science, Springer-Verlag, vol. 7785, pp. 281-296, Mar 2013.
Universally Composable Synchronous Computation
Theory of Cryptography — TCC 2013, Lecture Notes in Computer Science, Springer, vol. 7785, pp. 477-498, Mar 2013.
A Constructive Perspective on Key Encapsulation
Number Theory and Cryptography, Lecture Notes in Computer Science, Springer, vol. 8260, pp. 226–239, 2013.
Practical and Employable Protocols for UC-Secure Circuit Evaluation over Zn
Computer Security - ESORICS 2013 - 18th European Symposium on Research in Computer Security, Lecture Notes in Computer Science, Springer, vol. 8134, pp. 19–37, 2013.
Publications of 2012
UOWHFs from OWFs: Trading regularity for efficiency
Progress in Cryptology — LATINCRYPT 2012, Lecture Notes in Computer Science, Springer-Verlag, vol. 7533, pp. 234–253, Oct 2012.
Common Randomness Amplification: A Constructive View
IEEE Information Theory Workshop (ITW), pp. 35 -39, Sep 2012.
Collusion-Preserving Computation
Advances in Cryptology — CRYPTO 2012, Lecture Notes in Computer Science, Springer-Verlag, vol. 7417, pp. 124-143, Aug 2012.
Synchrony Amplification
Information Theory Proceedings — ISIT 2012, IEEE, pp. 1583-1587, Jul 2012.
Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading
Advances in Cryptology — EUROCRYPT 2012, Lecture Notes in Computer Science, Springer-Verlag, vol. 7237, pp. 63–80, Apr 2012, this is the full version.
Confidentiality and Integrity: A Constructive Perspective
Theory of Cryptography — TCC 2012, Lecture Notes in Computer Science, Springer, vol. 7194, pp. 209–229, Mar 2012.
Improved hardness results for unique shortest vector problem
In submission, 2012.
New Preimage Attacks Against Reduced SHA-1
CRYPTO, Lecture Notes in Computer Science, Springer, vol. 7417, pp. 367-383, 2012.
Oblivious Transfer with Hidden Access Control from Attribute-Based Encryption
Security and Cryptography for Networks - 8th International Conference, Lecture Notes in Computer Science, Springer, vol. 7485, pp. 559–579, 2012.
Passive Corruption in Statistical Multi-Party Computation
The 6th International Conference on Information Theoretic Security - ICITS 2012, Lecture Notes in Computer Science, Springer-Verlag, 2012, Full Version available from http://eprint.iacr.org/2012/272.
Publications of 2011
Byzantine Fault-Tolerance with Commutative Commands
Principles of Distributed Systems — OPODIS 2011, Lecture Notes in Computer Science, Springer, vol. 7109, pp. 329–342, Dec 2011.
Privacy-Preserving Outsourcing of Brute-Force Key Searches
Proc. 2011 ACM Cloud Computing Security Workshop (CCSW), ACM, Oct 2011.
Nonlocality is Transitive
Phys. Rev. Lett., American Physical Society, vol. 107, pp. 100402, Aug 2011.
Player-Centric Byzantine Agreement
Automata, Languages and Programming — 38th International Colloquium, ICALP 2011, Lecture Notes in Computer Science, Springer-Verlag, vol. 6755, pp. 281–292, Jul 2011.
The Equivalence of Strong RSA and Factoring in the Generic Ring Model of Computation.
Workshop on Coding and Cryptography - WCC 2011, INRIA, vol. inria00607256, version 1, Jul 2011.
Constructive cryptography – A new paradigm for security definitions and proofs
Theory of Security and Applications (TOSCA 2011), Lecture Notes in Computer Science, Springer-Verlag, vol. 6993, pp. 33–56, Apr 2011.
Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma
Theory of Cryptography — TCC 2011, Lecture Notes in Computer Science, Springer-Verlag, vol. 6597, pp. 37–54, Mar 2011.
Abstract Cryptography
The Second Symposium on Innovations in Computer Science, ICS 2011, Tsinghua University Press, pp. 1–21, Jan 2011.
Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience
ICITS, Lecture Notes in Computer Science, Springer, vol. 6673, pp. 206-226, 2011.
Computational Verifiable Secret Sharing Revisited
ASIACRYPT, Lecture Notes in Computer Science, Springer, vol. 7073, pp. 590-609, 2011.
Conditional Differential Cryptanalysis of Trivium and KATAN
Selected Areas in Cryptography, Lecture Notes in Computer Science, Springer, vol. 7118, pp. 200-212, 2011.
Cryptanalysis of the Knapsack Generator
FSE, Lecture Notes in Computer Science, Springer, vol. 6733, pp. 188-198, 2011.
Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity
OPODIS, Lecture Notes in Computer Science, Springer, vol. 7109, pp. 34-49, 2011.
Generating Shorter Bases for Hard Random Lattices
Theory Comput. Syst., vol. 48, no. 3, pp. 535-553, 2011.
Graceful Degradation in Multi-Party Computation
The 5th International Conference on Information Theoretic Security - ICITS 2011, Lecture Notes in Computer Science, Springer-Verlag, vol. 6673, pp. 163–180, 2011, Full Version available from http://eprint.iacr.org/2011/094.
Secure message transmission in asynchronous networks
J. Parallel Distrib. Comput., vol. 71, no. 8, pp. 1067-1074, 2011.
Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary.
ACNS, Lecture Notes in Computer Science, vol. 6715, pp. 292-308, 2011.
The Leakage-Resilience Limit of a Computational Problem is Equal to its Unpredictability Entropy
Advances in Cryptology - Asiacrypt 2011, Lecture Notes in Computer Science, Springer-Verlag, vol. 7073, pp. 686-701, 2011.
The Round Complexity of Perfectly Secure General VSS
ICITS, Lecture Notes in Computer Science, Springer, vol. 6673, pp. 143-162, 2011.
Publications of 2010
Random Oracles With(out) Programmability
Advances in Cryptology — ASIACRYPT 2010, Lecture Notes in Computer Science, Springer-Verlag, vol. 6477, pp. 303–320, Dec 2010.
On the Soundness of Authenticate-then-Encrypt: Formalizing the Malleability of Symmetric Encryption
Proceedings of the 17th ACM Conference on Computer and Communication Security, ACM, pp. 505–515, Oct 2010.
Optimality of LDGM-LDPC Compound Codes for Lossy Compression of Binary Erasure Source
Proceedings of the International Symposium on Information Theory and its Applications, Oct 2010.
Public-Key Encryption in the Bounded-Retrieval Model
Advances in Cryptology - EUROCRYPT 2010, Lecture Notes in Computer Science, Springer-Verlag, vol. 6110, pp. 113-134, Aug 2010.
Hybrid-Secure MPC: Trading Information-Theoretic Robustness for Computational Privacy
Proc. of the 2010 ACM Symposium on Principles of Distributed Computing — PODC '10, pp. 219–228, Jul 2010, Full Version available from http://eprint.iacr.org/2009/009.
On the Theoretical Gap Between Synchronous and Asynchronous MPC Protocols
Proc. of the 2010 ACM Symposium on Principles of Distributed Computing — PODC '10, pp. 211–218, Jul 2010.
Receipt-Free K-out-of-L Voting Based on ElGamal Encryption
Towards Trustworthy Elections, Lecture Notes in Computer Science, Springer-Verlag, vol. 6000, pp. 64–82, Jun 2010.
Adaptively Secure Broadcast
Advances in Cryptology — EUROCRYPT 2010, Lecture Notes in Computer Science, Springer-Verlag, vol. 6110, pp. 466–485, May 2010.
Rate Distortion Bounds for Binary Erasure Source Using Sparse Graph Codes
Proceedings of the Data Compression Conference, IEEE Computer Society, Mar 2010.
A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
Theory of Cryptography — TCC 2010, Lecture Notes in Computer Science, Springer-Verlag, vol. 5978, pp. 237–254, Feb 2010.
Constructive Cryptography – A Primer
Financial Cryptography 2010, Lecture Notes in Computer Science, Springer-Verlag, vol. 6052, pp. 1, Jan 2010.
Conditional Differential Cryptanalysis of NLFSR-Based Cryptosystems
ASIACRYPT, Lecture Notes in Computer Science, Springer, vol. 6477, pp. 130–145, 2010.
Differential and Invertibility Properties of BLAKE
FSE, Lecture Notes in Computer Science, Springer, vol. 6147, pp. 318–332, 2010.
Free-Start Distinguishing: Combining Two Types of Indistinguishability Amplification
The 4th International Conference on Information Theoretic Security - ICITS 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5973, pp. 28–44, 2010.
Improved Linear Differential Attacks on CubeHash
AFRICACRYPT, Lecture Notes in Computer Science, Springer, vol. 6055, pp. 407–418, 2010.
Publications of 2009
A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical
Advances in Cryptology — ASIACRYPT 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5912, pp. 364–381, Dec 2009.
Cascade Encryption Revisited
Advances in Cryptology — ASIACRYPT 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5912, pp. 37–51, Dec 2009.
Abstraction in Cryptography
Advances in Cryptology — CRYPTO 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5677, pp. 459, Aug 2009.
Collusion-Free Multiparty Computation in the Mediated Model
Advances in Cryptology — CRYPTO 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5677, pp. 524-540, Aug 2009.
Computational Indistinguishability Amplification: Tight Product Theorems for System Composition
Advances in Cryptology — CRYPTO 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5677, pp. 350–368, Aug 2009.
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
Advances in Cryptology — CRYPTO 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5973, pp. 36-54, Aug 2009.
Unifying Zero-knowledge Proofs of Knowledge
Advances in Cryptology - AfricaCrypt 2009, Lecture Notes in Computer Science, Springer-Verlag, Jun 2009.
Breaking RSA Generically is Equivalent to Factoring
Advances in Cryptology - EUROCRYPT 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5479, pp. 36-53, Apr 2009.
Realistic Failures in Secure Multi-party Computation
Theory of Cryptography Conference — TCC 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5444, pp. 274-293, Mar 2009.
Secure Computability of Functions in the IT setting with Dishonest Majority and Applications to Long-Term Security
Theory of Cryptography — TCC 2009, Lecture Notes in Computer Science, Springer-Verlag, Mar 2009.
Abstract Storage Devices
Theory and Practice of Computer Science — SOFSEM 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5404, pp. 341–352, Jan 2009.
Generating Shorter Bases for Hard Random Lattices
26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, vol. 3, pp. 75-86, 2009.
Random Systems: Theory and Applications
ICITS 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4883, pp. 44–45, 2009.
Survey: Leakage Resilience and the Bounded Retrieval Model
Information Theoretic Security, 4th International Conference, ICITS 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5973, pp. 1-18, 2009.
Publications of 2008
Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography
Advances in Cryptology — ASIACRYPT 2008, Lecture Notes in Computer Science, Springer-Verlag, vol. 5350, pp. 161–178, Dec 2008.
MPC vs. SFE: Unconditional and Computational Security
Advances in Cryptology — ASIACRYPT 2008, Lecture Notes in Computer Science, Springer-Verlag, vol. 5350, pp. 1–18, Dec 2008.
Efficient Multi-Party Computation with Information-Theoretic Security
PhD Thesis, ETH Zurich, 2008.
Collusion-Free Protocols in the Mediated Model
Advances in Cryptology — CRYPTO 2008, Lecture Notes in Computer Science, Springer-Verlag, vol. 5157, pp. 497-514, Aug 2008.
Asynchronous Multi-Party Computation With Quadratic Communication
Automata, Languages and Programming — ICALP 2008, Lecture Notes in Computer Science, Springer-Verlag, vol. 5126, pp. 473–485, Jul 2008.
Rethinking Digital Signatures
Proc. of SECRYPT 2008, INSTICC, pp. IS-31–IS-33, Jul 2008.
Weak Pseudorandom Functions in Minicrypt
Automata, Languages and Programming — ICALP 2008, Lecture Notes in Computer Science, Springer-Verlag, vol. 5126, pp. 423–436, Jul 2008.
The Bare Bounded-storage Model: The Tight Bound on the Storage Requirement for Key Agreement
IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2790–2792, Jun 2008.
Perfectly-Secure MPC with Linear Communication Complexity
Theory of Cryptography Conference — TCC 2008, Lecture Notes in Computer Science, Springer-Verlag, vol. 4948, pp. 213–230, Mar 2008.
MPC vs. SFE: Perfect Security in a Unified Corruption Model
Theory of Cryptography Conference — TCC 2008, Lecture Notes in Computer Science, Springer-Verlag, vol. 4948, pp. 231–250, Mar 2008.
Publications of 2007
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
Advances in Cryptology — ASIACRYPT 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4833, pp. 427–443, Dec 2007.
Efficient Byzantine Agreement with Faulty Minority
Advances in Cryptology — ASIACRYPT 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4833, pp. 393 - 409, Dec 2007.
Simple and Efficient Perfectly-Secure Asynchronous MPC
Advances in Cryptology — ASIACRYPT 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4833, pp. 376–392, Dec 2007.
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
Advances in Cryptology — CRYPTO 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4622, pp. 187–204, Aug 2007, Full version available from http://eprint.iacr.org/2007/229.
Indistinguishability Amplification
Advances in Cryptology — CRYPTO 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4622, pp. 130–149, Aug 2007.
Quantum Cryptography with Finite Resources
Available on http://arxiv.org/abs/0708.0709, Aug 2007.
Symmetry of large physical systems implies independence of subsystems
Nature Physics, vol. 3, pp. 645 - 649, Jul 2007, Preliminary version is available at http://arxiv.org/abs/quant-ph/0703069.
Abstract Storage Devices
eprint archive, Jun 2007, Available at http://www.arxiv.org/abs/0706.2746.
Approaches to Efficient and Robust Cryptographic Protocols
PhD Thesis, ETH Zurich, 2007, Diss. ETH No. 17102, ISBN 978-3-86628-153-0.
Parallel Repetition: Simplifications and the No-Signaling Case
Proc. 39th ACM Symposium on Theory of Computing — STOC 2007, pp. 411–419, Jun 2007.
A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security
Advances in Cryptology — EUROCRYPT 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4515, pp. 498–516, May 2007.
Range Extension for Weak PRFs; The Good, the Bad, and the Ugly
Advances in Cryptology — EUROCRYPT 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4515, pp. 517–533, May 2007.
Small Accessible Quantum Information Does Not Imply Security
Physical Review Letters, vol. 98, no. 140502, Apr 2007, Preliminary version available at http://arxiv.org/abs/quant-ph/0512021.
Beweisbare Sicherheit durch Quantenkryptografie
it — Information Technology, Oldenbourg, vol. 49, no. 2, pp. 127–131, Mar 2007, http://it-information-technology.de/ (copyright).
Robuster Combiners for Oblivious Transfer
Theory of Cryptography Conference — TCC 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4392, pp. 404–418, Feb 2007.
Security of Quantum Key Distribution Protocols using two-way Classical Communication or Weak Coherent Pulses
Physical Review Letters A, vol. 75, pp. 012316, Jan 2007, Available at http://arxiv.org/abs/quant-ph/0610151.
SIA: Secure Information Aggregation in Sensor Networks
Journal of Computer Security, vol. 15, no. 1, pp. 69–102, Jan 2007, Special Issue on Security of Ad-Hoc and Sensor Networks. Preliminary version: [PrSoPe03].
Designated Confirmer Signatures Revisited
Theory of Cryptography Conference — TCC 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4392, pp. 342–361, 2007.
How to Shuffle in Public
Theory of Cryptography Conference — TCC 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4392, 2007.
Parallel Repetition of Computationally Sound Protocols Revisited
Theory of Cryptography Conference — TCC 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4392, pp. 86–102, 2007.
Unbreakable keys from random noise
Security with Noisy Data, Springer-Verlag, pp. 21–44, 2007.
Weak Pseudorandom Functions in Minicrypt
2007, Manuscript.
Weak Pseudorandomness and Unpredictability
PhD Thesis, ETH Zurich, 2007, ETH Series in Information Security and Cryptography, vol. 8, Hartung-Gorre Verlag, ISBN 3-86628-088-2.
Publications of 2006
A Tight High-Order Entropic Quantum Uncertainty Relation With Applications
Dec 2006, Available at http://arxiv.org/abs/quant-ph/0612014.
Algorithms on Graphs with Small Dominating Targets.
Algorithms and Computation, 17th International Symposium, ISAAC 2006, Lecture Notes in Computer Science, Springer, vol. 4288, pp. 141-152, Dec 2006.
Indistinguishability Amplification
Dec 2006, Available at http://eprint.iacr.org/2006/456.
On Robust Combiners for Private Information Retrieval and Other Primitives
Advances in Cryptology — CRYPTO 2006, Lecture Notes in Computer Science, Springer-Verlag, vol. 4117, pp. 555–569, Aug 2006.
On the Randomness of Independent Experiments
Aug 2006, Available at http://arxiv.org/abs/cs.IT/0608007.
Robust Multiparty Computation with Linear Communication Complexity
Advances in Cryptology — CRYPTO 2006, Lecture Notes in Computer Science, Springer-Verlag, vol. 4117, pp. 463–482, Aug 2006.
Unifying classical and quantum key distillation
Theory of Cryptography Conference — TCC 2007, Lecture Notes in Computer Science, Springer-Verlag, Aug 2006, Available at http://arxiv.org/abs/quant-ph/0608199.
On the Impossibility of Extracting Classical Randomness Using a Quantum Computer
Automata, Languages and Programming — ICALP 2006, Springer-Verlag, pp. 204–215, Jul 2006, Available at http://arxiv.org/abs/quant-ph/0612012.
Optimally Efficient Multi-Valued Byzantine Agreement
Proc. 25th ACM Symposium on Principles of Distributed Computing — PODC 2006, ACM, Jul 2006.
Parallel Repetition: Simplifications and the No-Signaling Case
Jul 2006, Available at http://arxiv.org/abs/cs.CC/0607139.
The single-serving channel capacity
IEEE International Symposium on Information Theory — ISIT 2006, IEEE, Jul 2006, Available at http://arxiv.org/abs/cs.IT/0608018.
An Algebra for Enterprise Privacy Policies Closed Under Composition and Conjunction
Emerging Trends in Information and Communication Security — ETRICS 2006, Lecture Notes in Computer Science, Springer-Verlag, vol. 3995, pp. 130–144, Jun 2006.
Optimal Resilience for Erasure-Coded Byzantine Distributed Storage
Proc. Intl. Conference on Dependable Systems and Networks — DSN 2006, pp. 115–124, Jun 2006.
Luby-Rackoff Ciphers from Weak Round Functions?
Cryptology ePrint Archive, Report 2006/213, Jun 2006, http://eprint.iacr.org/2006. This is the full version of [MOPS06a].
Strengthening Key Agreement using Hard-Core Sets
PhD Thesis, ETH Zurich, 2006, Reprint as vol. 7 of ETH Series in Information Security and Cryptography, ISBN 3-86626-088-2, Hartung-Gorre Verlag, Konstanz, 2006.
Luby-Rackoff Ciphers from Weak Round Functions?
Advances in Cryptology — EUROCRYPT 2006, Lecture Notes in Computer Science, Springer-Verlag, vol. 4004, pp. 391–408, May 2006, Proceedings version of [MOPS06b].
Efficient Multi-Party Computation with Dispute Control
Theory of Cryptography Conference — TCC 2006, Lecture Notes in Computer Science, Springer-Verlag, vol. 3876, pp. 305–328, Mar 2006.
Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness
Theory of Cryptography Conference — TCC 2006, Lecture Notes in Computer Science, Springer-Verlag, pp. 443–461, Mar 2006.
Separating Sources for Encryption and Secret Sharing
Theory of Cryptography Conference — TCC 2006, Lecture Notes in Computer Science, Springer-Verlag, vol. 3876, pp. 601–616, Mar 2006.
One-and-a-half quantum de Finetti theorems
Feb 2006, Available at http://arxiv.org/abs/quant-ph/0602130.
An Adaptively Secure Mix-Net Without Erasures
Automata, Languages and Programming — ICALP 2006, Lecture Notes in Computer Science, Springer-Verlag, vol. 4052, pp. 276–287, 2006.
Secure Multi-party Computation made Simple
Discrete Applied Mathematics, vol. 154, pp. 370–381, 2006.
Publications of 2005
A de Finetti Representation for Finite Symmetric Quantum States
Journal of Mathematical Physics, vol. 46, no. 122108, Dec 2005, See also http://arxiv.org/abs/quant-ph/0410229.
Abstract Models of Computation in Cryptography
Cryptography and Coding 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3796, pp. 1–12, Dec 2005.
Domain Expansion of MACs: Alternative Uses of the FIL-MAC
Cryptography and Coding 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3796, pp. 168–185, Dec 2005.
Generalized Strong Extractors and Deterministic Privacy Amplification
Cryptography and Coding 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3796, pp. 322–339, Dec 2005.
Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
Advances in Cryptology — ASIACRYPT 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3788, pp. 199–216, Dec 2005.
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
Advances in Cryptology — ASIACRYPT 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3788, pp. 79–99, Dec 2005.
Asynchronous Verifiable Information Dispersal
Proceedings of the 24th Symposium on Reliable Distributed Systems — SRDS 2005, pp. 191–202, Oct 2005.
Security of Quantum Key Distribution
PhD Thesis, ETH Zurich, 2005, Available at http://arxiv.org/abs/quant-ph/0512258.
Communication-Efficient Non-Interactive Proofs of Knowledge with Online Extractors
Advances in Cryptology — CRYPTO 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3621, pp. 152–168, Aug 2005.
Composition Does Not Imply Adaptive Security
Advances in Cryptology — CRYPTO 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3621, pp. 55–65, Aug 2005.
Impossibility and Feasibility Results for Zero Knowledge with Public Keys
Advances in Cryptology — CRYPTO 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3621, pp. 135-151, Aug 2005.
Improved Security Analyses for CBC MACs
Advances in Cryptology — CRYPTO 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3621, pp. 527–545, Aug 2005.
Lower and Upper Bounds on the Secret Key Rate for QKD Protocols Using One-Way Classical Communication
Physical Review Letters, American Physical Society, vol. 95, no. 080501, Aug 2005, eprint archive: http://arxiv.org/abs/quant-ph/0410215.
On the Generic Insecurity of the Full Domain Hash
Advances in Cryptology — CRYPTO 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3621, pp. 449–466, Aug 2005.
One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
Advances in Cryptology — CRYPTO 2005, Lecture Notes in Computer Science, Springer-Verlag, pp. 478–493, Aug 2005.
An Information-Theoretic Security Proof for QKD Protocols
Physical Review Letters A, American Physical Society, vol. 72, no. 012332, Jul 2005, eprint archive: http://arxiv.org/abs/quant-ph/0502064.
Completely Non-Malleable Schemes
Automata, Languages and Programming — ICALP 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3580, pp. 779–790, Jul 2005.
On the Power of Quantum Memory
IEEE Transactions on Information Theory, vol. 51, no. 7, pp. 2391–2401, Jul 2005, eprint archive: http://arxiv.org/abs/quant-ph/0305154.
Single-key AIL-MACs from any FIL-MAC
Automata, Languages and Programming — ICALP 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3580, pp. 472–484, Jul 2005.
Byzantine Agreement Given Partial Broadcast
Journal of Cryptology, vol. 18, no. 3, pp. 191–217, Jul 2005.
Domination Search on Graphs with Low Dominating-Target-Number
Graph-Theoretic Concepts in Computer Science, WG 2005, Lecture Notes in Computer Science, Springer, vol. 3787, pp. 28-37, Jun 2005.
Cryptographic Asynchronous Multi-Party Computation with Optimal Resilience
Advances in Cryptology — EUROCRYPT 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3494, pp. 322–340, May 2005, Full version available as Report 2004/368 at Cryptology ePrint Archive, http://eprint.iacr.org/2004/368.
Key Agreement from Weak Bit Agreement
Proc. 37th ACM Symposium on Theory of Computing — STOC 2005, pp. 664–673, May 2005.
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time
Proc. 22nd Symposium on Theoretical Aspects of Computer Science — STACS 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3404, pp. 305–314, Feb 2005.
Universally Composable Privacy Amplification Against Quantum Adversaries
Theory of Cryptography Conference — TCC 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3378, pp. 407–425, Feb 2005, Also available at http://arxiv.org/abs/quant-ph/0403133.
Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order
Public Key Cryptography — PKC 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3386, pp. 154–171, Jan 2005.
Publications of 2004
Asynchronous Proactive Cryptosystems Without Agreement (extended abstract)
Advances in Cryptology — ASIACRYPT 2004, Lecture Notes in Computer Science, Springer-Verlag, vol. 3329, pp. 152–169, Dec 2004.
Towards a Theory of Consistency Primitives
International Symposium on Distributed Computing — DISC 2004, Lecture Notes in Computer Science, Springer-Verlag, vol. 3274, pp. 379–389, Oct 2004.
Complete Classification of Bilinear Hard-Core Functions
Advances in Cryptology — CRYPTO 2004, Lecture Notes in Computer Science, Springer-Verlag, vol. 3152, pp. 73–91, Aug 2004.
Extracting Randomness from Generalized Symbol-Fixing and Markov Sources
IEEE International Symposium on Information Theory — ISIT 2004, IEEE, pp. 232, Jun 2004.
New Approaches to Digital Evidence
Proceedings of the IEEE, vol. 92, no. 6, pp. 933–947, Jun 2004.
On Intrinsic Information
IEEE International Symposium on Information Theory — ISIT 2004, IEEE, pp. 135, Jun 2004.
Privacy Amplification Secure Against an Adversary with Selectable Knowledge
IEEE International Symposium on Information Theory — ISIT 2004, IEEE, pp. 231, Jun 2004.
Quantum Pseudo-Telepathy and the Kochen-Specker Theorem
IEEE International Symposium on Information Theory — ISIT 2004, IEEE, pp. 322, Jun 2004, This is the Proceedings version of [RenWol04d].
Smooth Renyi Entropy and Applications
IEEE International Symposium on Information Theory — ISIT 2004, IEEE, pp. 233, Jun 2004.
The Role of Cryptography in Database Security
Proc. of ACM SIGMOD Int. Conference on Management of Data, pp. 5–10, Jun 2004.
Multi-party Computation with Hybrid Security
Advances in Cryptology — EUROCRYPT 2004, Lecture Notes in Computer Science, Springer-Verlag, vol. 3027, pp. 419–438, May 2004.
On Generating the Initial Key in the Bounded-Storage Model
Advances in Cryptology — EUROCRYPT 2004, Lecture Notes in Computer Science, Springer-Verlag, vol. 3027, pp. 126–137, May 2004.
The Exact Price for Unconditionally Secure Asymmetric Cryptography
Advances in Cryptology — EUROCRYPT 2004, Lecture Notes in Computer Science, Springer-Verlag, vol. 3027, pp. 109–125, May 2004.
Composition of Random Systems: When Two Weak Make One Strong
Theory of Cryptography Conference — TCC 2004, Lecture Notes in Computer Science, Springer-Verlag, vol. 2951, pp. 410–427, Feb 2004.
Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology
Theory of Cryptography Conference — TCC 2004, Lecture Notes in Computer Science, Springer-Verlag, vol. 2951, pp. 21–39, Feb 2004.
Optimal Randomizer Efficiency in the Bounded-Storage Model
Journal of Cryptology, vol. 17, no. 1, pp. 5–26, Jan 2004, Conference version appeared in Proc. of STOC 2002..
A Generic Security Proof for Quantum Key Distribution
eprint archive, 2004, http://arxiv.org/abs/quant-ph/0402131.
Quantum Pseudo-Telepathy and the Kochen-Specker Theorem
2004, Proceedings version (ISIT 2004): [RenWol04c].
Publications of 2003
On the Frequency Distribution of Non-Independent Random Values
Nov 2003, Manuscript.
On the Variational Distance of Independently Repeated Experiments
eprint archive: http://arxiv.org/abs/cs.IT/0509013, Nov 2003, Manuscript.
SIA: Secure Information Aggregation in Sensor Networks
Proc. ACM Conference on Embedded Networked Sensor Systems — SENSYS 2003, ACM, pp. 255–265, Nov 2003, Journal version: [CPPS07].
Intrinsic Limitations of Digital Signatures and How to Cope With Them
Proceedings of the 6th Information Security Conference — ISC '03, Lecture Notes in Computer Science, Springer-Verlag, vol. 2851, pp. 180–192, Oct 2003.
On the Parameterized Complexity of the Fixed Alphabet Shortest Common Supersequence and Longest Common Subsequence Problems
Journal of Computer and System Sciences, vol. 67, no. 1, pp. 757–771, Aug 2003.
Unconditional Authenticity and Privacy from an Arbitrarily Weak Secret
Advances in Cryptology — CRYPTO 2003, Lecture Notes in Computer Science, Springer-Verlag, vol. 2729, pp. 78–95, Aug 2003.
A New Measure for Conditional Mutual Information and its Properties
IEEE International Symposium on Information Theory — ISIT 2003, IEEE, pp. 259, Jun 2003, This is the proceedings version of [ReSkWo03a].
A Property of the Intrinsic Mutual Information
IEEE International Symposium on Information Theory — ISIT 2003, IEEE, pp. 258, Jun 2003, This is the proceedings version of [ChReWo03a].
Towards Characterizing the Non-Locality of Entangled Quantum States
IEEE International Symposium on Information Theory — ISIT 2003, IEEE, pp. 428, Jun 2003, This is the proceedings version of [RenWol02c], eprint archive: http://arxiv.org/abs/quant-ph/0211019.
New Bounds in Secret-Key Agreement: The Gap Between Formation and Secrecy Extraction
Advances in Cryptology — EUROCRYPT 2003, Lecture Notes in Computer Science, Springer-Verlag, vol. 2656, pp. 562–577, May 2003.
The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations
Advances in Cryptology — EUROCRYPT 2003, Lecture Notes in Computer Science, Springer-Verlag, pp. 544–561, May 2003.
Two-Threshold Broadcast and Detectable Multi-Party Computation
Advances in Cryptology — EUROCRYPT 2003, Lecture Notes in Computer Science, Springer-Verlag, vol. 2656, pp. 51–67, May 2003.
Secret Key Agreement Over a Non-authenticated Channel — Part III: Privacy Amplification
IEEE Transactions on Information Theory, vol. 49, no. 4, pp. 839–851, Apr 2003.
Secret Key Agreement Over a Non-authenticated Channel — Part II: The Simulatability Condition
IEEE Transactions on Information Theory, vol. 49, no. 4, pp. 832–838, Apr 2003.
Secret Key Agreement Over a Non-authenticated Channel — Part I: Definitions and Bounds
IEEE Transactions on Information Theory, vol. 49, no. 4, pp. 822–831, Apr 2003.
Generalized Communication and Security Models in Byzantine Agreement
PhD Thesis, ETH Zurich, 2003, Reprint as vol. 4 of ETH Series in Information Security and Cryptography, ISBN 3-89649-853-3, Hartung-Gorre Verlag, Konstanz, 2003.
A New Measure for Conditional Mutual Information and its Properties
2003, Proceedings version (ISIT 2003): [ReSkWo03b].
A Property of the Intrinsic Mutual Information
2003, Proceedings version (ISIT 2003): [ChReWo03b].
Publications of 2002
Linking Classical and Quantum Key Agreement: Is There a Classical Analog to Bound Entanglement?
Algorithmica, Springer-Verlag, vol. 34, no. 4, pp. 389–412, Nov 2002.
Secure Multi-Party Computation Made Simple
Third Conference on Security in Communication Networks — SCN 2002, Lecture Notes in Computer Science, Springer-Verlag, vol. 2576, pp. 14–28, Sep 2002.
A Fast Approximation Algorithm for the Subset-Sum Problem
International Transactions in Operational Research, Blackwell Publishers, vol. 9, no. 4, pp. 437–459, Aug 2002, A preliminary version of this paper was presented at IFORS '99, 15th Triennial Conference of IFORS.
Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks
Advances in Cryptology — CRYPTO 2002, Lecture Notes in Computer Science, Springer-Verlag, vol. 2442, pp. 565–580, Aug 2002.
Detectable Byzantine Agreement Secure Against Faulty Majorities
Proc. 21st ACM Symposium on Principles of Distributed Computing — PODC 2002, pp. 118–126, Jul 2002.
About the Mutual (Conditional) Information
IEEE International Symposium on Information Theory — ISIT 2002, IEEE, pp. 364, Jun 2002, This is the Proceedings version of [RenMau02a].
Generalized Indistinguishability
IEEE International Symposium on Information Theory — ISIT 2002, IEEE, pp. 295, Jun 2002.
Towards Proving the Existence of “Bound” Information
IEEE International Symposium on Information Theory — ISIT 2002, IEEE, pp. 103, Jun 2002, This is the Proceedings version of [RenWol02a].
Indistinguishability of Random Systems
Advances in Cryptology — EUROCRYPT 2002, Lecture Notes in Computer Science, Springer-Verlag, vol. 2332, pp. 110–132, May 2002.
Tight Security Proofs for the Bounded-Storage Model
Proc. 34th ACM Symposium on Theory of Computing — STOC 2002, ACM, pp. 341–350, May 2002.
Unconditional Byzantine Agreement and Multi-Party Computation Secure Against Dishonest Minorities from Scratch
Advances in Cryptology — EUROCRYPT 2002, Lecture Notes in Computer Science, Springer-Verlag, vol. 2332, pp. 482–501, May 2002.
About the Mutual (Conditional) Information
2002, Proceedings version (ISIT 2002): [RenMau02b].
Towards Characterizing the Non-Locality of Entangled Quantum States
eprint archive: http://arxiv.org/abs/quant-ph/0211019, 2002, Proceedings version (ISIT 2003): [RenWol03c].
Towards Proving the Existence of “Bound” Information
2002, Proceedings version (ISIT 2002): [RenWol02b].
Publications of 2001
Quantum Solution to the Byzantine Agreement Problem
Physical Review Letters, vol. 87, no. 21, pp. 7901–7904, Nov 2001.
Multi-Party Computation: Efficient Protocols, General Adversaries, and Voting
PhD Thesis, ETH Zurich, 2001, Reprint as vol. 3 of ETH Series in Information Security and Cryptography, ISBN 3-89649-747-2, Hartung-Gorre Verlag, Konstanz, 2001.
Minimal Complete Primitives for Secure Multi-Party Computation
Advances in Cryptology — CRYPTO 2001, Lecture Notes in Computer Science, Springer-Verlag, pp. 80–100, Aug 2001.
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Advances in Cryptology — CRYPTO 2001, Lecture Notes in Computer Science, Springer-Verlag, vol. 2139, pp. 503–523, Aug 2001.
Robustness for Free in Unconditional Multi-Party Computation
Advances in Cryptology — CRYPTO 2001, Lecture Notes in Computer Science, Springer-Verlag, vol. 2139, pp. 101–118, Aug 2001.
On Adaptive vs. Non-adaptive Security of Multiparty Protocols
Advances in Cryptology — EUROCRYPT 2001, Lecture Notes in Computer Science, Springer-Verlag, vol. 2045, pp. 262–279, May 2001.
Cryptography $2000\pm 10$
Informatics — 10 Years Back, 10 Years Ahead, Lecture Notes in Computer Science, Springer-Verlag, vol. 2000, pp. 63–85, 2001.
Publications of 2000
Efficient Secure Multi-Party Computation
Advances in Cryptology — ASIACRYPT 2000, Lecture Notes in Computer Science, Springer-Verlag, vol. 1976, pp. 143–161, Dec 2000.
Linking Classical and Quantum Key Agreement: Is There “Bound Information”?
Advances in Cryptology — CRYPTO 2000, Lecture Notes in Computer Science, Springer-Verlag, pp. 482–500, Aug 2000.
Authentication Theory and Hypothesis Testing
IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1350–1356, Jul 2000, Preliminary version: [Maurer96c].
Bound Information: The Classical Analog to Bound Quantum Entanglement
Proceedings of 3ecm, Progress in Mathematics, Birkhäuser Verlag, vol. 202, pp. 439–447, Jul 2000.
A Calculus of Conditional Independence and its Applications in Cryptography
IEEE International Symposium on Information Theory — ISIT 2000, IEEE, pp. 243, Jun 2000.
An Efficient Test for the Possibility of Information-Theoretic Key Agreement Secure Against Active Adversaries
IEEE International Symposium on Information Theory — ISIT 2000, IEEE, pp. 310, Jun 2000, Final version: [Wolf00c].
From Weak to Strong Secrecy in Information-Theoretic Key Agreement
IEEE International Symposium on Information Theory — ISIT 2000, IEEE, pp. 308, Jun 2000.
Global Broadcast by Broadcasts Among Subsets of Players
IEEE International Symposium on Information Theory — ISIT 2000, IEEE, pp. 267, Jun 2000.
Reducing Oblivious String Transfer to Universal Oblivious Transfer
IEEE International Symposium on Information Theory — ISIT 2000, IEEE, pp. 311, Jun 2000, Final version: [Wolf00d].
Efficient Receipt-Free Voting Based on Homomorphic Encryption
Advances in Cryptology — EUROCRYPT 2000, Lecture Notes in Computer Science, Springer-Verlag, vol. 1807, pp. 539–556, May 2000.
From Partial Consistency to Global Broadcast
Proc. 32nd ACM Symposium on Theory of Computing — STOC 2000, ACM, pp. 494–503, May 2000.
General Secure Multi-Party Computation from any Linear Secret-Sharing Scheme
Advances in Cryptology — EUROCRYPT 2000, Lecture Notes in Computer Science, Springer-Verlag, vol. 1807, pp. 316–334, May 2000.
Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free
Advances in Cryptology — EUROCRYPT 2000, Lecture Notes in Computer Science, Springer-Verlag, vol. 1807, pp. 351–368, May 2000.
On the Complexity of Verifiable Secret Sharing and Multiparty Computation
Proc. 32nd ACM Symposium on Theory of Computing — STOC 2000, ACM, pp. 325–334, May 2000.
Player Simulation and General Adversary Structures in Perfect Multiparty Computation
Journal of Cryptology, Springer-Verlag, vol. 13, no. 1, pp. 31–60, Apr 2000, Extended abstract in Proc. 16th of ACM PODC '97.
Reasoning About Public-Key Certification —- On Bindings Between Entities and Public Keys
IEEE Journal on Selected Areas in Communication, vol. 18, no. 4, pp. 561–570, Apr 2000.
Special Aspects of Escrow-based E-Cash Systems
Master's thesis, Universität des Saarlandes, Saarbrücken, 2000.
Confidence Valuation in a Public-key Infrastructure Based on Uncertain Evidence
Public Key Cryptography — PKC 2000, Lecture Notes in Computer Science, vol. 1751, pp. 93–112, Jan 2000.
Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions
Public Key Cryptography — PKC 2000, Lecture Notes in Computer Science, Springer-Verlag, vol. 1751, pp. 354–372, Jan 2000.
The Diffie-Hellman Protocol
Designs, Codes and Cryptography, Special Issue Public Key Cryptography, Kluwer Academic Publishers, vol. 19, no. 3, pp. 147–171, Jan 2000.
A Simple and Effciently Verifiable Characterization of the Possibility of Information-Theoretic Key Agreement
2000, This is the full version of [Wolf00a].
Reducing String Oblivious Transfer to Universal Oblivious Transfer
2000, This is the extended version of [Wolf00b].
Publications of 1999
General Adversaries in Unconditional Multi-Party Computation
Advances in Cryptology — ASIACRYPT '99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1716, pp. 232–246, Nov 1999.
Quantum Cryptography on Noisy Channels: Quantum Versus Classical Key-Agreement Protocols
Physical Review Letters A, vol. 83, no. 20, pp. 4200–4203, Nov 1999.
Signature Schemes Based on the Strong RSA Assumption
5th ACM Conference on Computer and Communications Security — CCS '99, ACM, pp. 46–51, Nov 1999.
Byzantine Agreement Secure Against General Adversaries in the Dual Failure Model
International Symposium on Distributed Computing — DISC '99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1693, pp. 123–137, Sep 1999.
Information-Theoretic Cryptography
Advances in Cryptology — CRYPTO '99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1666, pp. 47–64, Aug 1999.
Pseudonym Systems
Proceedings of Selected Areas in Cryptography — SAC '99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1758, pp. 184–199, Aug 1999.
Efficient Construction of the Dual Span Program
Manuscript, May 1999.
Efficient Multiparty Computations Secure Against an Adaptive Adversary
Advances in Cryptology — EUROCRYPT '99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1592, pp. 311–326, May 1999.
The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms
SIAM Journal on Computing, vol. 28, no. 5, pp. 1689–1721, Apr 1999.
Unconditionally Secure Key Agreement and the Intrinsic Conditional Information
IEEE Transactions on Information Theory, vol. 45, no. 2, pp. 499–514, Mar 1999.
Reasoning about Public-key Certification — on Bindings Between Entities and Public Keys
Proceedings of Financial Cryptography — FC '99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1648, pp. 86–103, Feb 1999.
Information-Theoretically and Computationally Secure Key Agreement in Cryptography
PhD Thesis, ETH Zurich, 1999.
Publications of 1998
Oblivious Transfer with a Memory-Bounded Receiver
Proceedings of the 39th Annual Symposium on Foundations of Computer Science — FOCS '98, IEEE, pp. 493–502, Nov 1998.
Strong Security Against Active Attacks in Information-Theoretic Secret-Key Agreement
Advances in Cryptology — ASIACRYPT '98, Lecture Notes in Computer Science, Springer-Verlag, vol. 1514, pp. 405–419, Oct 1998.
Efficient Byzantine Agreement Secure Against General Adversaries
International Symposium on Distributed Computing — DISC '98, Lecture Notes in Computer Science, Springer-Verlag, vol. 1499, pp. 134–148, Sep 1998.
A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack
Advances in Cryptology — CRYPTO '98, Lecture Notes in Computer Science, Springer-Verlag, vol. 1462, pp. 13–25, Aug 1998.
Trading Correctness for Privacy in Unconditional Multi-Party Computation
Advances in Cryptology — CRYPTO '98, Lecture Notes in Computer Science, Springer-Verlag, vol. 1462, pp. 121–136, Aug 1998, Corrected proceedings version.
Zero-Knowledge for Finite Field Arithmetic or: Can Zero-Knowledge be for Free?
Advances in Cryptology — CRYPTO '98, Lecture Notes in Computer Science, Springer-Verlag, vol. 1462, pp. 424–441, Aug 1998.
Diffie-Hellman, Decision Diffie-Hellman, and Discrete Logarithms
IEEE International Symposium on Information Theory — ISIT '98, IEEE, pp. 327, Aug 1998.
Unconditional Security in Cryptography
Lectures on Data Security: Modern Cryptology in Theory and Practice, Lecture Notes in Computer Science, Springer-Verlag, vol. 1561, pp. 217–250, Jul 1998.
Lower Bounds on Generic Algorithms in Groups
Advances in Cryptology — EUROCRYPT '98, Lecture Notes in Computer Science, Springer-Verlag, vol. 1403, pp. 72–84, May 1998.
On the Foundations of Oblivious Transfer
Advances in Cryptology — EUROCRYPT '98, Lecture Notes in Computer Science, Springer-Verlag, vol. 1403, pp. 361–374, May 1998.
Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem
PhD Thesis, ETH Zurich, 1998, Reprint as vol. 2 of ETH Series in Information Security and Cryptography, ISBN 3-89649-286-1, Hartung-Gorre Verlag, Konstanz, 1998.
On the Hardness of the Diffie-Hellman Decision Problem
1998, Manuscript.
Span Programs over Rings and How to Share a Secret from a Module
Master's thesis, ETH Zurich, Institute for Theoretical Computer Science, 1998.
Publications of 1997
A Secure and Optimally Efficient Multi-Authority Election Scheme
European Transactions on Telecommunications, vol. 8, no. 5, pp. 481–490, Sep 1997, Preliminary version: [CrGeSc97b].
Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation
Proc. 16th ACM Symposium on Principles of Distributed Computing — PODC '97, pp. 25–34, Aug 1997.
Efficient Group Signature Schemes for Large Groups
Advances in Cryptology — CRYPTO '97, Lecture Notes in Computer Science, Springer-Verlag, vol. 1294, pp. 410–424, Aug 1997.
Privacy Amplification Secure Against Active Adversaries
Advances in Cryptology — CRYPTO '97, Lecture Notes in Computer Science, Springer-Verlag, vol. 1294, pp. 307–321, Aug 1997.
Unconditional Security Against Memory-Bounded Adversaries
Advances in Cryptology — CRYPTO '97, Lecture Notes in Computer Science, Springer-Verlag, vol. 1294, pp. 292–306, Aug 1997.
How Much Memory is Needed to Win Infinite Games?
12th Annual IEEE Symposium on Logic in Computer Science — LICS '97, IEEE, pp. 99–110, Jun 1997.
Smoothing Probability Distributions and Smooth Entropy
IEEE International Symposium on Information Theory — ISIT '97, IEEE, Jun 1997.
The Intrinsic Conditional Mutual Information and Perfect Secrecy
IEEE International Symposium on Information Theory — ISIT '97, IEEE, pp. 88, Jun 1997.
A Secure and Optimally Efficient Multi-Authority Election Scheme
Advances in Cryptology — EUROCRYPT '97, Lecture Notes in Computer Science, Springer-Verlag, vol. 1233, pp. 103–118, May 1997, Final version: [CrGeSc97].
Efficient and Generalized Group Signatures
Advances in Cryptology — EUROCRYPT '97, Lecture Notes in Computer Science, Springer-Verlag, vol. 1233, pp. 465–479, May 1997.
Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation
Advances in Cryptology — EUROCRYPT '97, Lecture Notes in Computer Science, Springer-Verlag, vol. 1233, pp. 75–87, May 1997.
Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion
Advances in Cryptology — EUROCRYPT '97, Lecture Notes in Computer Science, Springer-Verlag, vol. 1233, pp. 209–225, May 1997.
Linear Zero-Knowledge: A Note on Efficient Zero-Knowledge Proofs and Arguments
Proc. 29th ACM Symposium on Theory of Computing — STOC '97, ACM, pp. 436–445, May 1997.
Smooth Entropy and Rényi Entropy
Advances in Cryptology — EUROCRYPT '97, Lecture Notes in Computer Science, Springer-Verlag, vol. 1233, pp. 193–208, May 1997.
Linking Information Reconciliation and Privacy Amplification
Journal of Cryptology, vol. 10, no. 2, pp. 97–110, Mar 1997, Preliminary version: [CacMau94].
Proof Systems for General Statements about Discrete Logarithms
Technical Report, no. 260, Institute for Theoretical Computer Science, ETH Zurich, Mar 1997.
Digital Payment Systems with Passive Anonymity-Revoking Trustees
Journal of Computer Security, vol. 5, no. 1, pp. 69–89, 1997, Preliminary version: [CaMaSt96].
Entropy Measures and Unconditional Security in Cryptography
PhD Thesis, ETH Zurich, 1997, Reprint as vol. 1 of ETH Series in Information Security and Cryptography, ISBN 3-89649-185-7, Hartung-Gorre Verlag, Konstanz, 1997.
The Generic Complexity of Index-Search Problems and Applications to Cryptography
1997, Manuscript.
Publications of 1996
A Non-interactive Public-Key Distribution System
Designs, Codes and Cryptography, vol. 9, no. 3, pp. 305–316, Nov 1996, Preliminary version: [MauYac91].
On the Efficiency of One-time Digital Signatures
Advances in Cryptology — ASIACRYPT '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1163, pp. 196–209, Nov 1996.
Towards Characterizing when Information-Theoretic Key Agreement Is Possible
Advances in Cryptology — ASIACRYPT '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1163, pp. 196–209, Nov 1996.
Bounded-Variable Fixpoint Queries are PSPACE-complete
Computer Science Logic '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1258, pp. 89–105, Sep 1996.
Digital Payment Systems with Passive Anonymity-Revoking Trustees
European Symposium on Research in Computer Security — ESORICS '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1146, pp. 33–43, Sep 1996, Final version: [CaMaSt97].
Modelling a Public-Key Infrastructure
European Symposium on Research in Computer Security — ESORICS '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1146, pp. 325–350, Sep 1996.
Diffie-Hellman Oracles
Advances in Cryptology — CRYPTO '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1109, pp. 268–282, Aug 1996.
Generating ElGamal Signatures Without Knowing the Secret Key
Advances in Cryptology — EUROCRYPT '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1070, pp. 10–18, May 1996.
Publicly Verifiable Secret Sharing
Advances in Cryptology — EUROCRYPT '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1070, pp. 190–199, May 1996.
On the Complexity of Breaking the Diffie-Hellman Protocol
Technical Report, no. 244, Institute for Theoretical Computer Science, ETH Zurich, Apr 1996.
An Efficient Fair Payment System
3rd ACM Conference on Computer and Communicatons Security — CCS '96, ACM, pp. 88–94, Mar 1996.
A Unified and Generalized Treatment of Authentication Theory
Proc. 13th Symposium on Theoretical Aspects of Computer Science — STACS '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1046, pp. 387–398, Feb 1996, Final version: [Maurer00a].
Optimal Tree-based One-time Digital Signature Schemes
Proc. 13th Symposium on Theoretical Aspects of Computer Science — STACS '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1046, pp. 363–374, Feb 1996.
A Calculus for Security Bootstrapping in Distributed Systems
Journal of Computer Security, vol. 4, no. 1, pp. 55–80, 1996, Preliminary version: [MauSch94].
Cryptographic Protocols for Revocable Privacy
PhD Thesis, ETH Zurich, 1996.
Efficiency and Security of Cryptosystems Based on Number Theory
PhD Thesis, ETH Zurich, 1996.
On the Oracle Complexity of Factoring Integers
Computational Complexity, vol. 5, no. 4, pp. 237–247, 1996, Preliminary version: [Maurer92f].
Publications of 1995
On-line Secret Sharing
Cryptography and Coding '95, Lecture Notes in Computer Science, Springer-Verlag, vol. 1025, pp. 190–198, Dec 1995.
Generalized Privacy Amplification
IEEE Transactions on Information Theory, vol. 41, no. 6, pp. 1915–1923, Nov 1995, Preliminary version: [BBCM94].
New Information-Theoretic Bounds in Authentication Theory
IEEE International Symposium on Information Theory — ISIT '95, IEEE, pp. 12, Sep 1995.
Faire Anonyme Zahlungssysteme
GISI '95, Informatik aktuell, Springer-Verlag, pp. 254–265, Sep 1995.
Some Remarks on Lucas-Based Cryptosystems
Advances in Cryptology — CRYPTO '95, Lecture Notes in Computer Science, Springer-Verlag, vol. 963, pp. 386–396, Aug 1995.
Fair Blind Signatures
Advances in Cryptology — EUROCRYPT '95, Lecture Notes in Computer Science, Springer-Verlag, vol. 921, pp. 209–219, May 1995.
Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters
Journal of Cryptology, vol. 8, no. 3, pp. 123–155, 1995, Preliminary version: [Maurer89].
Kryptologie: eine neuartige Anwendung der Mathematik
Elemente der Mathematik, Birkhäuser Verlag, vol. 50, no. 3, pp. 89–106, 1995.
Publications of 1994
A Calculus for Secure Channel Establishment in Open Networks
European Symposium on Research in Computer Security — ESORICS '94, Lecture Notes in Computer Science, Springer-Verlag, vol. 875, pp. 175–192, Nov 1994, Final version: [MauSch96].
An Efficient Electronic Payment System Protecting Privacy
European Symposium on Research in Computer Security — ESORICS '94, Lecture Notes in Computer Science, Springer-Verlag, vol. 875, pp. 207–215, Nov 1994.
Directed Acyclic Graphs, One-way Functions and Digital Signatures
Advances in Cryptology — CRYPTO '94, Lecture Notes in Computer Science, Springer-Verlag, vol. 963, pp. 75–82, Aug 1994.
Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms
Advances in Cryptology — CRYPTO '94, Lecture Notes in Computer Science, Springer-Verlag, vol. 839, pp. 271–281, Aug 1994.
Generalized Privacy Amplification
IEEE International Symposium on Information Theory — ISIT '94, IEEE, pp. 350, Jun 1994, Final version: [BBCM95].
On the Secret-Key Rate of Binary Random Variables
IEEE International Symposium on Information Theory — ISIT '94, IEEE, pp. 351, Jun 1994.
Blind Signatures Based on the Discrete Logarithm Problem
Advances in Cryptology — EUROCRYPT '94, Lecture Notes in Computer Science, Springer-Verlag, vol. 950, pp. 428–432, May 1994.
Linking Information Reconciliation and Privacy Amplification
Advances in Cryptology — EUROCRYPT '94, Lecture Notes in Computer Science, Springer-Verlag, vol. 950, pp. 266–274, May 1994, Final version: [CacMau97].
The Strong Secret Key Rate of Discrete Random Triples
Communication and Cryptography — Two Sides of One Tapestry, Kluwer Academic Publishers, pp. 271–285, 1994.
Publications of 1993
The Role of Information Theory in Cryptography
Cryptography and Coding '93, The Institute of Mathematics and its Applications, Southend-on-Sea, England, pp. 49–71, Dec 1993.
Protocols for Secret Key Agreement by Public Discussion Based on Common Information
Advances in Cryptology — CRYPTO '92, Lecture Notes in Computer Science, Springer-Verlag, vol. 740, pp. 461–470, Aug 1993, Final version: [Maurer93a].
Secret Key Agreement by Public Discussion
IEEE Transactions on Information Theory, vol. 39, no. 3, pp. 733–742, May 1993, Preliminary version: [Maurer92g].
Cascade Ciphers: The Importance of Being First
Journal of Cryptology, vol. 6, no. 1, pp. 55–61, 1993, Preliminary version: [MauMas90b].
Publications of 1992
Asymptotically-Tight Bounds on the Number of Cycles in Generalized de Bruijn-Good Graphs
Discrete Applied Mathematics, vol. 37, pp. 421–436, Jul 1992.
A Remark on a Non-Interactive Public-Key Distribution System
Advances in Cryptology — EUROCRYPT '92, Lecture Notes in Computer Science, Springer-Verlag, vol. 658, pp. 458–460, May 1992, This is a note on [MauYac91]. See [MauYac96] for the final version.
A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generators
Advances in Cryptology — EUROCRYPT '92, Lecture Notes in Computer Science, Springer-Verlag, vol. 658, pp. 239–255, May 1992.
Factoring with an Oracle
Advances in Cryptology — EUROCRYPT '92, Lecture Notes in Computer Science, Springer-Verlag, vol. 658, pp. 429–436, May 1992, Final version: [Maurer96].
Some Number-theoretic Conjectures and Their Relation to the Generation of Cryptographic Primes
Cryptography and Coding '92, Oxford University Press, pp. 173–191, Mar 1992.
A Universal Statistical Test for Random Bit Generators
Journal of Cryptology, vol. 5, no. 2, pp. 89–105, 1992, Preliminary version: [Maurer90b].
Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher
Journal of Cryptology, vol. 5, no. 1, pp. 53–66, 1992, Preliminary version: [Maurer90a].
Publications of 1991
New Public-Key Schemes Based on Elliptic Curves over the Ring ${Z}_n$
Advances in Cryptology — CRYPTO '91, Lecture Notes in Computer Science, Springer-Verlag, vol. 576, pp. 252–266, Aug 1991.
Perfect Cryptographic Security from Partially Independent Channels
Proc. 23rd ACM Symposium on Theory of Computing — STOC '91, ACM, pp. 561–572, Aug 1991.
New Approaches to the Design of Self-Synchronizing Stream Ciphers
Advances in Cryptology — EUROCRYPT '91, Lecture Notes in Computer Science, Springer-Verlag, vol. 547, pp. 458–471, May 1991.
Non-Interactive Public-key Cryptography
Advances in Cryptology — EUROCRYPT '91, Lecture Notes in Computer Science, Springer-Verlag, vol. 547, pp. 498–507, Apr 1991, Final version: [MauYac96], see also the note in [MauYac92].
Local Randomness in Pseudo-Random Sequences
Journal of Cryptology, vol. 4, no. 2, pp. 135–149, 1991, Preliminary version: [MauMas89].
Publications of 1990
A Universal Statistical Test for Random Bit Generators
Advances in Cryptology — CRYPTO '90, Lecture Notes in Computer Science, Springer-Verlag, vol. 537, pp. 409–420, Aug 1990, Final version: [Maurer92a].
A Provably-Secure Strongly-Randomized Cipher
Advances in Cryptology — EUROCRYPT '90, Lecture Notes in Computer Science, Springer-Verlag, vol. 473, pp. 361–373, May 1990, Final version: [Maurer92b].
Cascade Ciphers: The Importance of Being First
IEEE International Symposium on Information Theory — ISIT '90, IEEE, pp. 118, Jan 1990, Final version: [MauMas93a].
Publications of 1989
Perfect Local Randomness in Pseudo-Random Sequences
Advances in Cryptology — CRYPTO '89, Lecture Notes in Computer Science, Springer-Verlag, vol. 435, pp. 100–112, Aug 1989, Final version: [MauMas91a].
Fast Generation of RSA-Moduli with Almost Maximal Diversity
Advances in Cryptology — EUROCRYPT '89, Lecture Notes in Computer Science, Springer-Verlag, vol. 434, pp. 636–647, Apr 1989, Final version: [Maurer95a].
Publications of 1987
Non-Expanding, Key-Minimal, Robustly-Perfect, Linear and Bilinear Ciphers
Advances in Cryptology — EUROCRYPT '87, Lecture Notes in Computer Science, Springer-Verlag, vol. 304, pp. 237–247, Apr 1987.