ETH Zürich » Computer Science » Theory » Cryptography

Information-Theoretic Cryptography

There are two types of cryptographic security. The security of a cryptographic system can rely either on the computational infeasibility of breaking it (computational security), or on the theoretical impossibility of breaking it, even using infinite computing power (information-theoretic or unconditional security). Because no computational problem has been proved to be computationally difficult for a reasonable model of computation, the computational security of almost all cryptographic system used today relies on an unproven intractability assumption.

In contrast, information-theoretically secure systems rely on no such assumptions, but they rely on an assumption about the probabilistic behavior of the universe, for instance of a noisy channel or a quantum measurement. But note that even computationally-secure systems rely on such assumptions, at least the tacitly made assumption that random keys can be generated and that they are independent of an adversary's entire a priori knowledge.

While information-theoretic security is stronger than computational security, it is usually less practical. In fact, Shannon's proof that perfect secrecy requires a secret key of the same length as the plaintext is often taken as evidence that unconditional security can never be practical. However, this precipitate jump to conclusions should be reconsidered: in contrast to Shannon's model, in which his result holds, cryptography takes place in a physical world (every communication channel is based on a physical process) in which nobody can have complete information about the state of a system, for instance due to noise or theoretical limitations of quantum physics.

For a discussion of the role of complexity in cryptography, click here or see Section 4 of the recent overview article.

For a view on the role of physics in cryptography, click here.

An overview article on information-theoretic cryptography.


Research Highlights

  • Indistinguishability amplification. [MPR07] presents a new generic approach to proving upper bounds on the information-theoretic distinguishing advantage (from an ideal system) for a combined system, based on upper bounds for the component systems. For a general type of combination operation of systems, including the XOR of functions or the cascade of permutations, two amplification theorems are proved. The first is a product theorem, in the spirit of XOR-lemmas: The distinguishing advantage of the combination of two systems is at most twice the product of the individual distinguishing advantages. This bound is optimal. The second theorem states that the combination of systems is secure against some strong class of distinguishers, assuming only that the components are secure against some weaker class of distinguishers.
  • Indifferentiability theory. In [MRH04] a generalized notion of indistinguishability was introduced which can be applied to primitives that are publicly accessible, like a hash function. The theory of indifferentiability has many applications: it allows to prove the impossibility of realizing a random oracle as well as to prove the security and soundness of hash function constructions. It is also the basis for providing domain extension of public random functions, see [MT07].
  • Abstract models of computation in cryptography. Computational security proofs in cryptography, without unproven intractability assumptions, exist today only if one restricts the computational model. For example, one can prove a lower bound on the complexity of computing discrete logarithms in a cyclic group if one considers only generic algorithms which can not exploit the properties of the representation of the group elements. In [Mau05] an abstract model of computation is proposed which allows to capture such reasonable restrictions on the power of algorithms. All previously considered generic algorithms are special cases of this model, in which proofs are more elegant and simpler.
  • Random systems and indistinguishability theory. Many aspects of cryptographic security proofs can be seen as the proof that a certain system (e.g. a block cipher) is indistinguishable from an ideal system (e.g. a random permutation), for different types of distinguishers. [Mau02] introduces the abstract concept of a random system and develops a theory of indistinguishability of random systems. Many complex security proofs (Luby-Rackoff, CBC-MAC, switching lemma, etc.) in the literature are instantiations of a general theorem on random systems.
  • Bounded-storage model (BSM) in cryptography. The basic idea of this model, proposed in [Mau92b], is that the security of a cryptographic protocol can be proven even against an adversary with infinite computing power, as long as the size of his memory is bounded. This allows for secure protocols in settings where neither classical information-theoretic security nor classical computational security is possible. In [DM02] the first full-fledged security proof for key agreement in this model was given. A natural conjecture of Ding and Rabin was that if the initial (short) key for a key agreement scheme secure in the BSM is generated by a computationally secure key agreement protocol such as Diffie-Hellman, then the overall scheme remains secure even if the adversary obtains infinite computing power after termination of the initial key agreement protocol (everlasting security). In [DM04] it was proved that this conjecture is false.
  • Secret-key agreement by public discussion. It was demonstrated in [Mau93a] that secret-key agreement is possible by public discussion, under mild assumptions about the information available to the legitimate parties as well as to the adversary. In contrast to public-key cryptography achieving the same goal, the security of our schemes is NOT based on any computational assumptions and holds even if an adversary has unbounded computing power. In this context novel and quite fundamental information-theoretic quantities, the secret-key rate and intrinsic mutual information [MW99a], were introduced.

Publications Concerning This Topic

Grégory Demay, Peter Gaži, Ueli Maurer, and Björn Tackmann
Optimality of Non-Adaptive Strategies: The Case of Parallel Games
to appear in 2014 IEEE International Symposium on Information Theory Proceedings (ISIT), Jul 2014.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, and Pavel Raykov
Anonymous Authentication with Shared Secrets
Cryptology ePrint Archive, Report 2014/073, 2014.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Gregory Demay and Ueli Maurer
Unfair Coin Tossing
2013 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 1556–1560, Jul 2013.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Christian Matt and Ueli Maurer
The One-Time Pad Revisited
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on, pp. 2706-2710, Jul 2013.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
Authentication Amplification by Synchronization
2013 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 2711–2714, Jul 2013.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
Conditional Equivalence of Random Systems and Indistinguishability Proofs
2013 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 3150–3154, Jul 2013.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Grégory Demay and Ueli Maurer
Common Randomness Amplification: A Constructive View
IEEE Information Theory Workshop (ITW), pp. 35 -39, Sep 2012.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Peter Gaži and Stefano Tessaro
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.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Stefano Tessaro
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.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Ashish Choudhury, Kaoru Kurosawa, Arpita Patra
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.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Ashish Choudhury, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, and C. Pandu Rangan
Secure message transmission in asynchronous networks
J. Parallel Distrib. Comput., vol. 71, no. 8, pp. 1067-1074, 2011.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Stefano Tessaro
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.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Peter Gaži and Ueli Maurer
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.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Peter Gaži and Ueli Maurer
Cascade Encryption Revisited
Advances in Cryptology — ASIACRYPT 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5912, pp. 37–51, Dec 2009.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Stefano Tessaro
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.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
Random Systems: Theory and Applications
ICITS 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4883, pp. 44–45, 2009.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Joel Alwen, Yevgeniy Dodis, and Daniel Wichs
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.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Stefan Dziembowski and Ueli Maurer
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.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Valerio Scarani and Renato Renner
Quantum Cryptography with Finite Resources
Available on http://arxiv.org/abs/0708.0709, Aug 2007.
Available files: [ Abstract ] [ BibTeX ]
Ueli Maurer, Krzysztof Pietrzak, and Renato Renner
Indistinguishability Amplification
Advances in Cryptology — CRYPTO 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4622, pp. 130–149, Aug 2007.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Robert Koenig, Ueli Maurer, and Stefano Tessaro
Abstract Storage Devices
eprint archive, Jun 2007, Available at http://www.arxiv.org/abs/0706.2746.
Available files: [ Abstract ] [ BibTeX ]
Robert Koenig, Renato Renner, Andor Bariska, and Ueli Maurer
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.
Available files: [ Abstract ] [ BibTeX ]
Renato Renner
Beweisbare Sicherheit durch Quantenkryptografie
it — {Information} {Technology}, Oldenbourg, vol. 49, no. 2, pp. 127–131, Mar 2007, http://it-information-technology.de/ (copyright).
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Barbara Kraus, Cyril Branciard, and Renato Renner
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.
Available files: [ Abstract ] [ BibTeX ]
Ueli Maurer, Renato Renner, and Stefan Wolf
Unbreakable keys from random noise
Security with Noisy Data, Springer-Verlag, pp. 21–44, 2007.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ivan Damg{å}rd, Serge Fehr, Renato Renner, Louis Salvail, and Christian Schaffner
A Tight High-Order Entropic Quantum Uncertainty Relation With Applications
Dec 2006, Available at http://arxiv.org/abs/quant-ph/0612014.
Available files: [ Abstract ] [ BibTeX ]
Thomas Holenstein and Renato Renner
On the Randomness of Independent Experiments
Aug 2006, Available at http://arxiv.org/abs/cs.IT/0608007.
Available files: [ Abstract ] [ BibTeX ]
Matthias Christandl, Artur Ekert, Michal Horodecki, Pawel Horodecki, Jonathan Oppenheim, and Renato Renner
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.
Available files: [ Abstract ] [ BibTeX ]
Thomas Holenstein
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}, {H}artung-{G}orre {V}erlag, {K}onstanz, 2006.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Yevgeniy Dodis, Krzysztof Pietrzak, and Bartosz Przydatek
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
Secure Multi-party Computation made Simple
Discrete Applied Mathematics, vol. 154, pp. 370–381, 2006.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Robert Koenig and Ueli Maurer
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.
Available files: [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner and Stefan Wolf
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner
Security of Quantum Key Distribution
PhD Thesis, {ETH Zurich}, 2005, Available at http://arxiv.org/abs/quant-ph/0512258.
Available files: [ Abstract ] [ BibTeX ]
Barbara Kraus, Nicolas Gisin, and Renato Renner
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.
Available files: [ Abstract ] [ BibTeX ]
Thomas Holenstein and Renato Renner
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Mihir Bellare, Krzysztof Pietrzak, and Phillip Rogaway
Improved Security Analyses for {CBC} {MAC}s
Advances in Cryptology — CRYPTO 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3621, pp. 527–545, Aug 2005.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Robert Koenig, Ueli Maurer, and Renato Renner
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.
Available files: [ Abstract ] [ BibTeX ]
Renato Renner, Nicolas Gisin, and Barbara Kraus
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.
Available files: [ Abstract ] [ BibTeX ]
Renato Renner and Robert Koenig
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.
Available files: [ Abstract ] [ BibTeX ]
Matthias Christandl and Renato Renner
On Intrinsic Information
IEEE International Symposium on Information Theory — ISIT 2004, IEEE, pp. 135, Jun 2004.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Robert Koenig, Ueli Maurer, and Renato Renner
Privacy Amplification Secure Against an Adversary with Selectable Knowledge
IEEE International Symposium on Information Theory — ISIT 2004, IEEE, pp. 231, Jun 2004.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Stefan Dziembowski and Ueli Maurer
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner and Stefan Wolf
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Krzysztof Pietrzak
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Stefan Dziembowski and Ueli Maurer
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..
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Matthias Christandl, Renato Renner, and Artur Ekert
A Generic Security Proof for Quantum Key Distribution
eprint archive, 2004, http://arxiv.org/abs/quant-ph/0402131.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner and Stefan Wolf
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Matthias Christandl, Renato Renner, and Stefan Wolf
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 [CRW03a].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner, Juraj Skripsky, and Stefan Wolf
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 [RSW03a].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Krzysztof Pietrzak
The Security of Many-Round {L}uby-{R}ackoff Pseudo-Random Permutations
Advances in Cryptology — EUROCRYPT 2003, Lecture Notes in Computer Science, Springer-Verlag, pp. 544–561, May 2003.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner and Stefan Wolf
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Stefan Wolf
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Stefan Wolf
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Stefan Wolf
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Matthias Christandl, Renato Renner, and Stefan Wolf
A Property of the Intrinsic Mutual Information
2003, Proceedings version (ISIT 2003): [CRW03b].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner, Juraj Skripsky, and Stefan Wolf
A New Measure for Conditional Mutual Information and its Properties
2003, Proceedings version (ISIT 2003): [RSW03b].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Nicolas Gisin, Renato Renner, and Stefan Wolf
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Serge Fehr and Ueli Maurer
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner and Stefan Wolf
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 [RW02a].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Stefan Dziembowski and Ueli Maurer
Tight Security Proofs for the Bounded-Storage Model
Proc. 34th ACM Symposium on Theory of Computing — STOC 2002, ACM, pp. 341–350, May 2002.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
Indistinguishability of Random Systems
Advances in Cryptology — EUROCRYPT 2002, Lecture Notes in Computer Science, Springer-Verlag, vol. 2332, pp. 110–132, May 2002.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner and Stefan Wolf
Towards Proving the Existence of ``Bound'' Information
2002, Proceedings version (ISIT 2002): [RW02b].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Nicolas Gisin and Stefan Wolf
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
Authentication Theory and Hypothesis Testing
IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1350–1356, Jul 2000, Preliminary version: [Mau96c].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Nicolas Gisin, Renato Renner, and Stefan Wolf
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Stefan Wolf
From Weak to Strong Secrecy in Information-Theoretic Key Agreement
IEEE International Symposium on Information Theory — ISIT 2000, IEEE, pp. 308, Jun 2000.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Stefan Wolf
Reducing Oblivious String Transfer to Universal Oblivious Transfer
IEEE International Symposium on Information Theory — ISIT 2000, IEEE, pp. 311, Jun 2000, Final version: [Wol00d].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Stefan Wolf
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: [Wol00c].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
A Calculus of Conditional Independence and its Applications in Cryptography
IEEE International Symposium on Information Theory — ISIT 2000, IEEE, pp. 243, Jun 2000.
Available files: [ Abstract ] [ BibTeX ]
Ueli Maurer and Stefan Wolf
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Stefan Wolf
Reducing String Oblivious Transfer to Universal Oblivious Transfer
2000, This is the extended version of [Wol00b].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Stefan Wolf
A Simple and Effciently Verifiable Characterization of the Possibility of Information-Theoretic Key Agreement
2000, This is the full version of [Wol00a].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Nicolas Gisin and Stefan Wolf
Quantum Cryptography on Noisy Channels: Quantum Versus Classical Key-Agreement Protocols
Physical Review Letters A, vol. 83, no. 20, pp. 4200–4203, Nov 1999.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
Information-Theoretic Cryptography
Advances in Cryptology — CRYPTO '99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1666, pp. 47–64, Aug 1999.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Stefan Wolf
Unconditionally Secure Key Agreement and the Intrinsic Conditional Information
IEEE Transactions on Information Theory, vol. 45, no. 2, pp. 499–514, Mar 1999.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Stefan Wolf
Information-Theoretically and Computationally Secure Key Agreement in Cryptography
PhD Thesis, {ETH Zurich}, 1999.
Available files: [ PS ] [ Abstract ] [ BibTeX ]
Christian Cachin, Claude Cr{é}peau, and Julien Marcil
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Stefan Wolf
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Stefan Wolf
{D}iffie-{H}ellman, {D}ecision {D}iffie-{H}ellman, and Discrete Logarithms
IEEE International Symposium on Information Theory — ISIT '98, IEEE, pp. 327, Aug 1998.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Stefan Wolf
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Christian Cachin
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Stefan Wolf
On the Hardness of the {D}iffie-{H}ellman Decision Problem
1998, Manuscript.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Christian Cachin and Ueli Maurer
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Stefan Wolf
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Christian Cachin and Ueli Maurer
Smoothing Probability Distributions and Smooth Entropy
IEEE International Symposium on Information Theory — ISIT '97, IEEE, Jun 1997.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Stefan Wolf
The Intrinsic Conditional Mutual Information and Perfect Secrecy
IEEE International Symposium on Information Theory — ISIT '97, IEEE, pp. 88, Jun 1997.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Christian Cachin
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Christian Cachin and Ueli Maurer
Linking Information Reconciliation and Privacy Amplification
Journal of Cryptology, vol. 10, no. 2, pp. 97–110, Mar 1997, Preliminary version: [CM94].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Stefan Wolf
The Generic Complexity of Index-Search Problems and Applications to Cryptography
1997, Manuscript.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Christian Cachin
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, {H}artung-{G}orre {V}erlag, {K}onstanz, 1997.
Available files: [ PS ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Stefan Wolf
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Jan Camenisch, Jean-Marc Piveteau, and Markus Stadler
An Efficient Fair Payment System
3rd ACM Conference on Computer and Communicatons Security — CCS '96, ACM, pp. 88–94, Mar 1996.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
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: [Mau00a].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Christian Cachin
On-line Secret Sharing
Cryptography and Coding '95, Lecture Notes in Computer Science, Springer-Verlag, vol. 1025, pp. 190–198, Dec 1995.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Charles H. Bennett, Gilles Brassard, Claude Cr{é}peau, and Ueli Maurer
Generalized Privacy Amplification
IEEE Transactions on Information Theory, vol. 41, no. 6, pp. 1915–1923, Nov 1995, Preliminary version: [BBCM94].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
New Information-Theoretic Bounds in Authentication Theory
IEEE International Symposium on Information Theory — ISIT '95, IEEE, pp. 12, Sep 1995.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Martin Gander and Ueli Maurer
On the Secret-Key Rate of Binary Random Variables
IEEE International Symposium on Information Theory — ISIT '94, IEEE, pp. 351, Jun 1994.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Charles H. Bennett, Gilles Brassard, Claude Cr{é}peau, and Ueli Maurer
Generalized Privacy Amplification
IEEE International Symposium on Information Theory — ISIT '94, IEEE, pp. 350, Jun 1994, Final version: [BBCM95].
Available files: [ Abstract ] [ BibTeX ]
Christian Cachin and Ueli Maurer
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: [CM97].
Available files: [ Abstract ] [ BibTeX ]
Ueli Maurer
The Strong Secret Key Rate of Discrete Random Triples
Communication and Cryptography — Two Sides of One Tapestry, Kluwer Academic Publishers, pp. 271–285, 1994.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
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: [Mau93a].
Available files: [ Abstract ] [ BibTeX ]
Ueli Maurer
Secret Key Agreement by Public Discussion
IEEE Transactions on Information Theory, vol. 39, no. 3, pp. 733–742, May 1993, Preliminary version: [Mau92g].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
A Simplified and Generalized Treatment of {L}uby-{R}ackoff Pseudorandom Permutation Generators
Advances in Cryptology — EUROCRYPT '92, Lecture Notes in Computer Science, Springer-Verlag, vol. 658, pp. 239–255, May 1992.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
A Universal Statistical Test for Random Bit Generators
Journal of Cryptology, vol. 5, no. 2, pp. 89–105, 1992, Preliminary version: [Mau90b].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher
Journal of Cryptology, vol. 5, no. 1, pp. 53–66, 1992, Preliminary version: [Mau90a].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
Perfect Cryptographic Security from Partially Independent Channels
Proc. 23rd ACM Symposium on Theory of Computing — STOC '91, ACM, pp. 561–572, Aug 1991.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and James L. Massey
Local Randomness in Pseudo-Random Sequences
Journal of Cryptology, vol. 4, no. 2, pp. 135–149, 1991, Preliminary version: [MM89].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
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: [Mau92b].
Available files: [ Abstract ] [ BibTeX ]
Ueli Maurer and James L. Massey
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: [MM91a].
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
James L. Massey, Ueli Maurer, and Muzhong Wang
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.
Available files: [ PS ] [ PDF ] [ Abstract ] [ BibTeX ]

© IACR | Springer | ACM | IEEE


Main Research Page &# END OF HTML COMPONENT