ETH Zürich » Computer Science » Theory » Cryptography

Publications

Search Publications
Syntax: AND is implicit, OR with semicolon, AND has preference, no grouping possible.
Example: multiparty ; multi-party
Author:
Title:
Abstract:
Category:
Year: from to

Complete List of Publications


Andreas Lochbihler, S. Reza Sefidgar, David Basin, and Ueli Maurer
Formalizing Constructive Cryptography using CryptHOL
IEEE 32rd Computer Security Foundations Symposium (CSF), IEEE Press, Jun 2019.
[ Abstract ] [ BibTeX ]
Daniel Jost, Ueli Maurer, and Marta Mularczyk
Efficient Ratcheting: Almost-Optimal Guarantees for Secure Messaging
Advances in Cryptology – EUROCRYPT 2019, LNCS, Springer International Publishing, vol. 11476, pp. 159–188, May 2019.
[ PDF ] [ Abstract ] [ BibTeX ]
Grégory Demay, Peter Gaži, Ueli Maurer, and Björn Tackmann
Per-session Security: Password-based Cryptography Revisited
Journal of Computer Security, IOS Press, vol. 27, pp. 75–111, 2019.
[ Abstract ] [ BibTeX ]
Christian Matt, Ueli Maurer, Christopher Portmann, Renato Renner, and Björn Tackmann
Toward an Algebraic Theory of Systems
Theoretical Computer Science, vol. 747, pp. 1–25, Nov 2018.
[ PDF ] [ Abstract ] [ BibTeX ]
Rio Lavigne, Chen-Da Liu Zhang, Ueli Maurer, Tal Moran, Marta Mularczyk, and Daniel Tschudi
Topology-Hiding Computation Beyond Semi-Honest Adversaries
Theory of Cryptography — TCC, LNCS, Springer International Publishing, vol. 11240, pp. 3–35, Nov 2018.
[ PDF ] [ Abstract ] [ BibTeX ]
Daniel Jost, Ueli Maurer, and João L. Ribeiro
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Daniel Jost and Ueli Maurer
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Christian Badertscher and Ueli Maurer
Composable and Robust Outsourced Storage
Topics in Cryptology — CT-RSA 2018, LNCS, Springer, vol. 10808, pp. 354-373, Apr 2018.
[ PDF ] [ Abstract ] [ BibTeX ]
Christian Badertscher, Juan Garay, Ueli Maurer, Daniel Tschudi, and Vassilis Zikas
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Christian Badertscher, Ueli Maurer, and Björn Tackmann
On Composable Security for Digital Signatures
Public-Key Cryptography — PKC 2018, LNCS, Springer, vol. 10769 (Proceedings Part I), pp. 494–523, Mar 2018.
[ PDF ] [ Abstract ] [ BibTeX ]
Vadim Lyubashevsky and Gregor Seiler
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Christian Badertscher, Fabio Banfi, and Ueli Maurer
A Constructive Perspective on Signcryption Security
Security and Cryptography for Networks — SCN 2018, LNCS, Springer, vol. 11035, pp. 102–120, 2018.
[ PDF ] [ Abstract ] [ BibTeX ]
Christian Badertscher, Peter Gaži, Aggelos Kiayias, Alexander Russell, and Vassilis Zikas
Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability
The 25th ACM Conference on Computer and Communications Security, 2018.
[ PDF ] [ Abstract ] [ BibTeX ]
Gregor Seiler
Faster AVX2 optimized NTT multiplication for Ring-LWE lattice cryptography
Cryptology ePrint Archive, 2018, Report 2018/039.
[ PDF ] [ Abstract ] [ BibTeX ]
Léo Ducas, Eike Kiltz, Tancrède Lepoint, Vadim Lyubashevsky, Peter Schwabe, Gregor Seiler, and Damien Stehlé
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Christian Badertscher
Idealizations of Practical Cryptographic Building Blocks
PhD Thesis, ETH Zurich, 2018.
[ PDF ] [ Abstract ] [ BibTeX ]
Joppe Bos, Léo Ducas, Eike Kiltz, Tancrède Lepoint, Vadim Lyubashevsky, John M. Schanck, Peter Schwabe, Gregor Seiler, and Damien Stehlé
CRYSTALS – Kyber: a CCA-secure module-lattice-based KEM
2018 IEEE European Symposium on Security and Privacy (EuroS&P), IEEE, pp. 353-367, 2018.
[ PDF ] [ Abstract ] [ BibTeX ]
Rafael del Pino, Vadim Lyubashevsky, and Gregor Seiler
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Christian Badertscher, Christian Matt, and Ueli Maurer
Strengthening Access Control Encryption
Advances in Cryptology—ASIACRYPT 2017, Lecture Notes in Computer Science, Springer International Publishing, vol. 10624, pp. 502–532, Nov 2017.
[ PDF ] [ Abstract ] [ BibTeX ]
Grégory Demay, Peter Gaži, Ueli Maurer, and Björn Tackmann
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Christian Badertscher, Ueli Maurer, Daniel Tschudi, and Vassilis Zikas
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Christian Badertscher, Sandro Coretti, Chen-Da Liu Zhang, and Ueli Maurer
Efficiency Lower Bounds for Commit-and-Prove Constructions
2017 IEEE International Symposium on Information Theory (ISIT), IEEE, pp. 1788–1792, Jun 2017.
[ PDF ] [ Abstract ] [ BibTeX ]
Chen-Da Liu Zhang, Ueli Maurer, Martin Raszyk, and Daniel Tschudi
Witness-Hiding Proofs of Knowledge for Cable Locks
IEEE International Symposium on Information Theory (ISIT), pp. 953-957, Jun 2017.
[ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
An Information-theoretic Approach to Hardness Amplification
2017 IEEE International Symposium on Information Theory (ISIT), Jun 2017.
[ Abstract ] [ BibTeX ]
Christopher Portmann, Christian Matt, Ueli Maurer, Renato Renner, and Björn Tackmann
Causal Boxes: Quantum Information-Processing Systems Closed Under Composition
IEEE Transactions on Information Theory, vol. 63, no. 5, pp. 3277-3305, May 2017.
[ PDF ] [ Abstract ] [ BibTeX ]
Christopher Portmann
(Quantum) Min-Entropy Resources
Eprint arXiv:1705.10595, May 2017.
[ PDF ] [ Abstract ] [ BibTeX ]
Christopher Portmann
Quantum Authentication with Key Recycling
Advances in Cryptology – {EUROCRYPT} 2017, Proceedings, Part {III}, Lecture Notes in Computer Science, Springer, vol. 10212, pp. 339–368, 2017, online arXiv:1610.03422.
[ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Renato Renner
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt, Ueli Maurer, Daniel Tschudi, and Vassilis Zikas
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Jan Camenisch, Robert R. Enderlein, and Ueli Maurer
Memory Erasability Amplification
Security and Cryptography for Networks (SCN), Lecture Notes in Computer Science, Springer, vol. 9841, pp. 104–125, Aug 2016.
[ PS ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Joao Ribeiro
New Perspectives on Weak Oblivious Transfer
2016 IEEE International Symposium on Information Theory (ISIT), pp. 790–794, Jul 2016.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Julian Loss, Ueli Maurer, and Daniel Tschudi
Hierarchy of Three-Party Consistency Specifications
2016 IEEE International Symposium on Information Theory (ISIT), {IEEE}, pp. 3048-3052, Jul 2016.
[ PDF ] [ Abstract ] [ BibTeX ]
Gregor Seiler and Ueli Maurer
On the Impossibility of Information-Theoretic Composable Coin Toss Extension
2016 IEEE International Symposium on Information Theory, pp. 3058–3061, Jul 2016.
[ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
Cryptography and Computation after Turing
The Once and Future Turing, Cambridge University Press, 2016.
[ PDF ] [ Abstract ] [ BibTeX ]
Sandro Coretti, Juan Garay, Martin Hirt, and Vassilis Zikas
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Christian Badertscher, Christian Matt, Ueli Maurer, Phillip Rogaway, and Björn Tackmann
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Christian Badertscher, Christian Matt, Ueli Maurer, Phillip Rogaway, and Björn Tackmann
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Joël Alwen, Rafail Ostrovsky, Hong-Sheng Zhou, and Vassilis Zikas
Incoercible Multi-Party Computation and Universally Composable Receipt-Free Voting
Advances in Cryptology – CRYPTO 2015, LNCS, Springer, vol. 9216, pp. 763-780, Aug 2015.
[ PDF ] [ Abstract ] [ BibTeX ]
Christian Matt and Ueli Maurer
A Definitional Framework for Functional Encryption
Computer Security Foundations Symposium (CSF), 2015 IEEE 28th, pp. 217-231, Jul 2015.
[ PDF ] [ Abstract ] [ BibTeX ]
Juan Garay, Jonathan Katz, Bjoern Tackmann, and Vassilis Zikas
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Grégory Demay, Peter Gaži, Ueli Maurer, and Björn Tackmann
Query-Complexity Amplification for Random Oracles
Information Theoretic Security, Lecture Notes in Computer Science, Springer International Publishing, vol. 9063, pp. 159-180, May 2015.
[ PDF ] [ Abstract ] [ BibTeX ]
Nishanth Chandran, Wutichai Chongchitmate, Juan A. Garay, Shafi Goldwasser, Rafail Ostrovsky, and Vassilis Zikas
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Sandro Coretti, and Ueli Maurer, Bjoern Tackmann, and Daniele Venturi
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Jan Camenisch, Robert R. Enderlein, and Gregory Neven
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
Zero-knowledge proofs of knowledge for group homomorphisms
Designs, Codes and Cryptography, vol. 77, pp. 663–676, 2015.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Dennis Hofheinz, Christian Matt, and Ueli Maurer
Idealizing Identity-Based Encryption
Advances in Cryptology – ASIACRYPT 2015, Lecture Notes in Computer Science, Springer Berlin Heidelberg, vol. 9452, pp. 495-520, 2015.
[ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt and Pavel Raykov
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, and Pavel Raykov
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, and Pavel Raykov
Anonymous Authentication with Shared Secrets
To appear in Progress in Cryptology — LATINCRYPT 2014, Sep 2014.
[ PDF ] [ Abstract ] [ BibTeX ]
Yuval Ishai, Rafail Ostrovsky, and Vassilis Zikas
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Seung Geol Choi, Jonathan Katz, Alex J. Malozemoff, and Vassilis Zikas
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Jonathan Katz, Aggelos Kiayias, Hong-Sheng Zhou, and Vassilis Zikas
Distributing the Setup in Universally Composable Multi-Party Computation
ACM Symposium on Principles of Distributed Computing – PODC 2014, Jul 2014, (to appear).
[ PDF ] [ Abstract ] [ BibTeX ]
Juan Garay, Clint Givens, Rafail Ostrovsky, and Pavel Raykov
Fast and Unconditionally Secure Anonymous Channel
Proc. 33rd ACM Symposium on Principles of Distributed Computing — PODC 2014, ACM, pp. 313–321, Jul 2014.
[ PDF ] [ Abstract ] [ BibTeX ]
Grégory Demay, Peter Gaži, Ueli Maurer, and Björn Tackmann
Optimality of Non-Adaptive Strategies: The Case of Parallel Games
2014 IEEE International Symposium on Information Theory (ISIT), pp. 1707-1711, Jun 2014.
[ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt, Ueli Maurer, and Pavel Raykov
Broadcast Amplification
Theory of Cryptography Conference — TCC 2014, Lecture Notes in Computer Science, Springer, vol. 8349, pp. 419–439, Feb 2014.
[ PDF ] [ Abstract ] [ BibTeX ]
Jan Camenisch, Maria Dubovitskaya, Robert R. Enderlein, Anja Lehmann, Gregory Neven, Christian Paquin, and Franz-Stefan Preiss
Concepts and Languages for Privacy-Preserving Attribute-Based Authentication
Journal of Information Security and Applications, vol. 19, no. 1, pp. 25–44, Feb 2014.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Sandro Coretti, Ueli Maurer, and Björn Tackmann
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt and Daniel Tschudi
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Juan Garay, Clint Givens, Rafail Ostrovsky, and Pavel Raykov
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Juan Garay, Jonathan Katz, Ueli Maurer, Björn Tackmann, and Vassilis Zikas
Rational Protocol Design: Cryptography Against Incentive-driven Adversaries
FOCS 2013, IEEE, Oct 2013.
[ PDF ] [ Abstract ] [ BibTeX ]
Joel Alwen, Stephan Krenn, Krzysztof Pietrzak, and Daniel Wichs
Learning with Rounding, Revisited: New Reduction, Properties and Applications
Advances in Cryptology — CRYPTO 2013, Lecture Notes in Computer Science, Springer-Verlag, Aug 2013.
[ PDF ] [ Abstract ] [ BibTeX ]
Peter Gaži
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, to appear.
[ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt, Christoph Lucas, and Ueli Maurer
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.
[ 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.
[ 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.
[ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
Authentication Amplification by Synchronization
2013 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 2711–2714, Jul 2013.
[ 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.
[ PDF ] [ Abstract ] [ BibTeX ]
Markulf Kohlweiss, Ueli Maurer, Cristina Onete, Björn Tackmann, and Daniele Venturi
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt and Pavel Raykov
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Grégory Demay, Peter Gaži, Martin Hirt, and Ueli Maurer
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Jonathan Katz, Ueli Maurer, Björn Tackmann, and Vassilis Zikas
Universally Composable Synchronous Computation
Theory of Cryptography — TCC 2013, Lecture Notes in Computer Science, Springer, vol. 7785, pp. 477-498, Mar 2013.
[ PDF ] [ Abstract ] [ BibTeX ]
Jonathan Katz, Serge Fehr, Fang Song, Hong-Sheng Zhou, and Vassilis Zikas
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Sandro Coretti, Ueli Maurer, and Björn Tackmann
A Constructive Perspective on Key Encapsulation
Number Theory and Cryptography, Lecture Notes in Computer Science, Springer, vol. 8260, pp. 226–239, 2013.
[ Abstract ] [ BibTeX ]
Jan Camenisch, Robert R. Enderlein, and Victor Shoup
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Kfir Barhum and Ueli Maurer
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.
[ 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.
[ PDF ] [ Abstract ] [ BibTeX ]
Joel Alwen, Jonathan Katz, Ueli Maurer, and Vassilis Zikas
Collusion-Preserving Computation
Advances in Cryptology — CRYPTO 2012, Lecture Notes in Computer Science, Springer-Verlag, vol. 7417, pp. 124-143, Aug 2012.
[ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Björn Tackmann
Synchrony Amplification
Information Theory Proceedings — ISIT 2012, IEEE, pp. 1583-1587, Jul 2012.
[ 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.
[ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer, Andreas Rüedlinger, and Björn Tackmann
Confidentiality and Integrity: A Constructive Perspective
Theory of Cryptography — TCC 2012, Lecture Notes in Computer Science, Springer, vol. 7194, pp. 209–229, Mar 2012.
[ PDF ] [ Abstract ] [ BibTeX ]
Divesh Aggarwal and Chandan Dubey
Improved hardness results for unique shortest vector problem
In submission, 2012.
[ Abstract ] [ BibTeX ]
Martin Hirt, Christoph Lucas, Ueli Maurer, and Dominik Raub
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Simon Knellwolf and Dmitry Khovratovich
New Preimage Attacks Against Reduced SHA-1
CRYPTO, Lecture Notes in Computer Science, Springer, vol. 7417, pp. 367-383, 2012.
[ PDF ] [ Abstract ] [ BibTeX ]
Jan Camenisch, Maria Dubovitskaya, Robert R. Enderlein, and Gregory Neven
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Pavel Raykov, Nicolas Schiper, and Fernando Pedone
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ghassan O. Karame, Srdjan Capkun, and Ueli Maurer
Privacy-Preserving Outsourcing of Brute-Force Key Searches
Proc. 2011 ACM Cloud Computing Security Workshop (CCSW), ACM, Oct 2011.
[ PDF ] [ Abstract ] [ BibTeX ]
Sandro Coretti, Esther Hänggi, and Stefan Wolf
Nonlocality is Transitive
Phys. Rev. Lett., American Physical Society, vol. 107, pp. 100402, Aug 2011.
[ PDF ] [ Abstract ] [ BibTeX ]
Divesh Aggarwal, Ueli Maurer, and Igor Shparlinski
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt and Vassilis Zikas
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
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.
[ 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.
[ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Renato Renner
Abstract Cryptography
The Second Symposium on Innovations in Computer Science, ICS 2011, Tsinghua University Press, pp. 1–21, Jan 2011.
[ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt, Christoph Lucas, Ueli Maurer, and Dominik Raub
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Divesh Aggarwal and Ueli Maurer
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Michael Backes, Aniket Kate, Arpita Patra
Computational Verifiable Secret Sharing Revisited
ASIACRYPT, Lecture Notes in Computer Science, Springer, vol. 7073, pp. 590-609, 2011.
[ 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.
[ PDF ] [ Abstract ] [ BibTeX ]
Arpita Patra
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Arpita Patra and C. Pandu Rangan
Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience
ICITS, Lecture Notes in Computer Science, Springer, vol. 6673, pp. 206-226, 2011.
[ PDF ] [ Abstract ] [ BibTeX ]
Ashish Choudhury, Kaoru Kurosawa, Arpita Patra
The Round Complexity of Perfectly Secure General VSS
ICITS, Lecture Notes in Computer Science, Springer, vol. 6673, pp. 143-162, 2011.
[ 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.
[ PDF ] [ Abstract ] [ BibTeX ]
Simon Knellwolf, Willi Meier, and Mar{í}a Naya-Plasencia
Conditional Differential Cryptanalysis of Trivium and KATAN
Selected Areas in Cryptography, Lecture Notes in Computer Science, Springer, vol. 7118, pp. 200-212, 2011.
[ PDF ] [ Abstract ] [ BibTeX ]
Simon Knellwolf and Willi Meier
Cryptanalysis of the Knapsack Generator
FSE, Lecture Notes in Computer Science, Springer, vol. 6733, pp. 188-198, 2011.
[ PDF ] [ Abstract ] [ BibTeX ]
Joel Alwen and Chris Peikert
Generating Shorter Bases for Hard Random Lattices
Theory Comput. Syst., vol. 48, no. 3, pp. 535-553, 2011.
[ PDF ] [ Abstract ] [ BibTeX ]
Marc Fischlin, Anja Lehmann, Thomas Ristenpart, Thomas Shrimpton, Martijn Stam, and Stefano Tessaro
Random Oracles With(out) Programmability
Advances in Cryptology — ASIACRYPT 2010, Lecture Notes in Computer Science, Springer-Verlag, vol. 6477, pp. 303–320, Dec 2010.
[ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Björn Tackmann
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Grégory Demay, Vishwambhar Rathi, and Lars K. Rasmussen
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Joel Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, and Daniel Wichs
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Zuzana {Beerliova-Trubiniova}, Martin Hirt, and Jesper Buus Nielsen
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Christoph Lucas, Dominik Raub, and Ueli Maurer
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt and Vassilis Zikas
Adaptively Secure Broadcast
Advances in Cryptology — EUROCRYPT 2010, Lecture Notes in Computer Science, Springer-Verlag, vol. 6110, pp. 466–485, May 2010.
[ PDF ] [ Abstract ] [ BibTeX ]
Grégory Demay, Vishwambhar Rathi, and Lars K. Rasmussen
Rate Distortion Bounds for Binary Erasure Source Using Sparse Graph Codes
Proceedings of the Data Compression Conference, IEEE Computer Society, Mar 2010.
[ 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.
[ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
Constructive Cryptography – A Primer
Financial Cryptography 2010, Lecture Notes in Computer Science, Springer-Verlag, vol. 6052, pp. 1, Jan 2010.
[ 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.
[ PDF ] [ Abstract ] [ BibTeX ]
Jean-Philippe Aumasson, Jian Guo, Simon Knellwolf, Krystian Matusiewicz, and Willi Meier
Differential and Invertibility Properties of BLAKE
FSE, Lecture Notes in Computer Science, Springer, vol. 6147, pp. 318–332, 2010.
[ PDF ] [ Abstract ] [ BibTeX ]
Simon Knellwolf, Willi Meier, and María Naya-Plasencia
Conditional Differential Cryptanalysis of NLFSR-Based Cryptosystems
ASIACRYPT, Lecture Notes in Computer Science, Springer, vol. 6477, pp. 130–145, 2010.
[ PDF ] [ Abstract ] [ BibTeX ]
Shahram Khazaei, Simon Knellwolf, Willi Meier, and Deian Stefan
Improved Linear Differential Attacks on CubeHash
AFRICACRYPT, Lecture Notes in Computer Science, Springer, vol. 6055, pp. 407–418, 2010.
[ PDF ] [ Abstract ] [ BibTeX ]
Anja Lehmann and Stefano Tessaro
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.
[ 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.
[ 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.
[ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
Abstraction in Cryptography
Advances in Cryptology — CRYPTO 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5677, pp. 459, Aug 2009.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Joel Alwen, Jonathan Katz, Yehuda Lindell, Giuseppe Persiano, Abhi Shelat, and Ivan Visconti
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Joel Alwen, Yevgeniy Dodis, and Daniel Wichs
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
Unifying Zero-knowledge Proofs of Knowledge
Advances in Cryptology - AfricaCrypt 2009, Lecture Notes in Computer Science, Springer-Verlag, Jun 2009.
[ PDF ] [ Abstract ] [ BibTeX ]
Divesh Aggarwal and Ueli Maurer
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Vassilis Zikas, Sarah Hauser, and Ueli Maurer
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Robin Künzler, Jörn Müller-Quade, and Dominik Raub
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Robert Koenig, Ueli Maurer, and Stefano Tessaro
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.
[ 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.
[ PDF ] [ Abstract ] [ BibTeX ]
Joel Alwen and Chris Peikert
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.
[ 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.
[ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Stefano Tessaro
Basing {PRF}s on Constant-Query Weak {PRF}s: 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.
[ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt, Ueli Maurer, and Vassilis Zikas
{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.
[ PDF ] [ Abstract ] [ BibTeX ]
Zuzana {Beerliova-Trubiniova}
Efficient Multi-Party Computation with Information-Theoretic Security
PhD Thesis, {ETH Zurich}, 2008.
[ PDF ] [ Abstract ] [ BibTeX ]
Joel Alwen, Abhi Shelat, and Ivan Visconti
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt, Jesper Buus Nielsen, and Bartosz Przydatek
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
Rethinking Digital Signatures
Proc. of SECRYPT 2008, INSTICC, pp. IS-31–IS-33, Jul 2008.
[ Abstract ] [ BibTeX ]
Krzysztof Pietrzak and Johan Sjödin
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.
[ 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.
[ PDF ] [ Abstract ] [ BibTeX ]
Zuzana {Beerliova-Trubiniova}, Matthias Fitzi, Martin Hirt, Ueli Maurer, and Vassilis Zikas
{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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Zuzana {Beerliova-Trubiniova} and Martin Hirt
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Zuzana {Beerliova-Trubiniova}, Martin Hirt, and Micha Riser
Efficient {B}yzantine Agreement with Faulty Minority
Advances in Cryptology — ASIACRYPT 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4833, pp. 393 - 409, Dec 2007.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Dominik Raub
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Zuzana {Beerliova-Trubiniova} and Martin Hirt
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Valerio Scarani and Renato Renner
Quantum Cryptography with Finite Resources
Available on http://arxiv.org/abs/0708.0709, Aug 2007.
[ Abstract ] [ BibTeX ]
Ueli Maurer and Stefano Tessaro
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.
[ PDF ] [ 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.
[ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner
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 ] [ BibTeX ]
Robert Koenig, Ueli Maurer, and Stefano Tessaro
Abstract Storage Devices
eprint archive, Jun 2007, Available at http://www.arxiv.org/abs/0706.2746.
[ Abstract ] [ BibTeX ]
Bartosz Przydatek
Approaches to Efficient and Robust Cryptographic Protocols
PhD Thesis, {ETH Zurich}, 2007, Diss. ETH No. 17102, ISBN 978-3-86628-153-0.
[ PDF ] [ Abstract ] [ BibTeX ]
Thomas Holenstein
Parallel Repetition: Simplifications and the No-Signaling Case
Proc. 39th ACM Symposium on Theory of Computing — STOC 2007, pp. 411–419, Jun 2007.
[ Abstract ] [ BibTeX ]
Krzysztof Pietrzak and Johan Sjödin
Range Extension for Weak {PRF}s; 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.
[ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Johan Sjödin
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.
[ PDF ] [ 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.
[ 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).
[ PDF ] [ Abstract ] [ BibTeX ]
Remo Meier, Bartosz Przydatek, and J{ü}rg Wullschleger
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Haowen Chan, Adrian Perrig, Bartosz Przydatek, and Dawn Song
{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: [PSP03].
[ 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.
[ Abstract ] [ BibTeX ]
Krzysztof Pietrzak and Douglas Wikström
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.
[ Abstract ] [ BibTeX ]
Douglas Wikström
Designated Confirmer Signatures Revisited
Theory of Cryptography Conference — TCC 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4392, pp. 342–361, 2007.
[ Abstract ] [ BibTeX ]
Ben Adida and Douglas Wikström
How to Shuffle in Public
Theory of Cryptography Conference — TCC 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4392, 2007.
[ Abstract ] [ BibTeX ]
Johan Sjödin
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Krzysztof Pietrzak and Johan Sjödin
Weak Pseudorandom Functions in Minicrypt
2007, Manuscript.
[ Abstract ] [ BibTeX ]
Ueli Maurer, Renato Renner, and Stefan Wolf
Unbreakable keys from random noise
Security with Noisy Data, Springer-Verlag, pp. 21–44, 2007.
[ 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.
[ Abstract ] [ BibTeX ]
Ueli Maurer, Krzysztof Pietrzak, and Renato Renner
Indistinguishability Amplification
Dec 2006, Available at http://eprint.iacr.org/2006/456.
[ PDF ] [ Abstract ] [ BibTeX ]
Divesh Aggarwal, Chandan Dubey, and Shashank Mehta
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Remo Meier and Bartosz Przydatek
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt and Jesper Buus Nielsen
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Thomas Holenstein and Renato Renner
On the Randomness of Independent Experiments
Aug 2006, Available at http://arxiv.org/abs/cs.IT/0608007.
[ 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.
[ Abstract ] [ BibTeX ]
Matthias Fitzi and Martin Hirt
Optimally Efficient Multi-Valued {B}yzantine Agreement
Proc. 25th {ACM} Symposium on Principles of Distributed Computing — PODC 2006, ACM, Jul 2006.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Thomas Holenstein
Parallel Repetition: Simplifications and the No-Signaling Case
Jul 2006, Available at http://arxiv.org/abs/cs.CC/0607139.
[ Abstract ] [ BibTeX ]
Yevgeniy Dodis and Renato Renner
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.
[ Abstract ] [ BibTeX ]
Renato Renner, Stefan Wolf, and J{ü}rg Wullschleger
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.
[ Abstract ] [ BibTeX ]
Christian Cachin and Stefano Tessaro
Optimal Resilience for Erasure-Coded Byzantine Distributed Storage
Proc. Intl. Conference on Dependable Systems and Networks — DSN 2006, pp. 115–124, Jun 2006.
[ Abstract ] [ BibTeX ]
Ueli Maurer, Yvonne Anne Oswald, Krzysztof Pietrzak, and Johan Sjödin
{L}uby-{R}ackoff 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].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Dominik Raub and Rainer Steinwandt
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer, Yvonne Anne Oswald, Krzysztof Pietrzak, and Johan Sjödin
{L}uby-{R}ackoff 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].
[ PS ] [ PDF ] [ 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.
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Thomas Holenstein
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Zuzana {Beerliova-Trubiniova} and Martin Hirt
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Matthias Christandl, Robert Koenig, Graeme Mitchison, and Renato Renner
One-and-a-half quantum de {F}inetti theorems
Feb 2006, Available at http://arxiv.org/abs/quant-ph/0602130.
[ Abstract ] [ BibTeX ]
Douglas Wikström and Jens Groth
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
Secure Multi-party Computation made Simple
Discrete Applied Mathematics, vol. 154, pp. 370–381, 2006.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Robert Koenig and Renato Renner
A de {F}inetti 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 ] [ BibTeX ]
Ueli Maurer and Johan Sjödin
Domain Expansion of {MAC}s: Alternative Uses of the {FIL-MAC}
Cryptography and Coding 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3796, pp. 168–185, Dec 2005.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
Abstract Models of Computation in Cryptography
Cryptography and Coding 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3796, pp. 1–12, Dec 2005.
[ 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.
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt and Jesper Buus Nielsen
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Christian Cachin and Stefano Tessaro
Asynchronous Verifiable Information Dispersal
Proceedings of the 24th Symposium on Reliable Distributed Systems — SRDS 2005, pp. 191–202, Oct 2005.
[ Abstract ] [ BibTeX ]
Renato Renner
Security of Quantum Key Distribution
PhD Thesis, {ETH Zurich}, 2005, Available at http://arxiv.org/abs/quant-ph/0512258.
[ 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.
[ Abstract ] [ BibTeX ]
Krzysztof Pietrzak
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.
[ PS ] [ PDF ] [ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Yevgeniy Dodis, Roberto Oliveira, and Krzysztof Pietrzak
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.
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Marc Fischlin
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Joel Alwen, Giuseppe Persiano, and Ivan Visconti
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.
[ 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.
[ 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.
[ Abstract ] [ BibTeX ]
Marc Fischlin
Completely Non-Malleable Schemes
Automata, Languages and Programming — ICALP 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3580, pp. 779–790, Jul 2005.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Johan Sjödin
Single-key {AIL-MAC}s from any {FIL-MAC}
Automata, Languages and Programming — ICALP 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3580, pp. 472–484, Jul 2005.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Jeffrey Considine, Matthias Fitzi, Matthew Franklin, Leonid A. Levin, Ueli Maurer, and David Metcalf
{B}yzantine Agreement Given Partial Broadcast
Journal of Cryptology, vol. 18, no. 3, pp. 191–217, Jul 2005.
[ Abstract ] [ BibTeX ]
Divesh Aggarwal, Shashank Mehta, and Jitender Deogun
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Thomas Holenstein
Key Agreement from Weak Bit Agreement
Proc. 37th ACM Symposium on Theory of Computing — STOC 2005, pp. 664–673, May 2005.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt, Jesper Buus Nielsen, and Bartosz Przydatek
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.
[ PS ] [ PDF ] [ 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.
[ Abstract ] [ BibTeX ]
Abraham D. Flaxman and Bartosz Przydatek
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Endre Bangerter, Jan Camenisch, and Ueli Maurer
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Bartosz Przydatek and Reto Strobl
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Thomas Holenstein, Ueli Maurer, and Johan Sjödin
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
The Role of Cryptography in Database Security
Proc. of ACM SIGMOD Int. Conference on Management of Data, pp. 5–10, Jun 2004.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner and Stefan Wolf
Smooth {R}enyi Entropy and Applications
IEEE International Symposium on Information Theory — ISIT 2004, IEEE, pp. 233, Jun 2004.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Matthias Christandl and Renato Renner
On Intrinsic Information
IEEE International Symposium on Information Theory — ISIT 2004, IEEE, pp. 135, Jun 2004.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Robert Koenig and Ueli Maurer
Extracting Randomness from Generalized Symbol-Fixing and Markov Sources
IEEE International Symposium on Information Theory — ISIT 2004, IEEE, pp. 232, Jun 2004.
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner and Stefan Wolf
Quantum Pseudo-Telepathy and the {K}ochen-{S}pecker Theorem
IEEE International Symposium on Information Theory — ISIT 2004, IEEE, pp. 322, Jun 2004, This is the Proceedings version of [RW04d].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
New Approaches to Digital Evidence
Proceedings of the IEEE, vol. 92, no. 6, pp. 933–947, Jun 2004.
[ 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.
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Matthias Fitzi, Thomas Holenstein, and J{ü}rg Wullschleger
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.
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer, Renato Renner, and Clemens Holenstein
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.
[ 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..
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner and Stefan Wolf
Quantum Pseudo-Telepathy and the {K}ochen-{S}pecker Theorem
2004, Proceedings version (ISIT 2004): [RW04c].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Thomas Holenstein and Renato Renner
On the Frequency Distribution of Non-Independent Random Values
Nov 2003, Manuscript.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner
On the Variational Distance of Independently Repeated Experiments
eprint archive: http://arxiv.org/abs/cs.IT/0509013, Nov 2003, Manuscript.
[ Abstract ] [ BibTeX ]
Bartosz Przydatek, Dawn Song, and Adrian Perrig
{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].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Krzysztof Pietrzak
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.
[ 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.
[ 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].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner and Stefan Wolf
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 [RW02c], eprint archive: http://arxiv.org/abs/quant-ph/0211019.
[ 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].
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Matthias Fitzi, Martin Hirt, Thomas Holenstein, and J{ü}rg Wullschleger
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.
[ 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.
[ 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.
[ 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.
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Matthias Fitzi
Generalized Communication and Security Models in {B}yzantine Agreement
PhD Thesis, {ETH Zurich}, 2003, Reprint as vol. 4 of ETH Series in Information Security and Cryptography}, {ISBN} 3-89649-853-3, {H}artung-{G}orre {V}erlag, {K}onstanz, 2003.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Matthias Christandl, Renato Renner, and Stefan Wolf
A Property of the Intrinsic Mutual Information
2003, Proceedings version (ISIT 2003): [CRW03b].
[ 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].
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Bartosz Przydatek
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.
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, and Adam Smith
Detectable {B}yzantine {A}greement Secure Against Faulty Majorities
Proc. 21st {ACM} Symposium on Principles of Distributed Computing — PODC 2002, pp. 118–126, Jul 2002.
[ 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].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner and Ueli Maurer
About the Mutual (Conditional) Information
IEEE International Symposium on Information Theory — ISIT 2002, IEEE, pp. 364, Jun 2002, This is the Proceedings version of [RM02a].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Renato Renner
Generalized Indistinguishability
IEEE International Symposium on Information Theory — ISIT 2002, IEEE, pp. 295, Jun 2002.
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Matthias Fitzi, Nicolas Gisin, Ueli Maurer, and Oliver von Rotz
Unconditional {B}yzantine 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.
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner and Stefan Wolf
Towards Proving the Existence of ``Bound'' Information
2002, Proceedings version (ISIT 2002): [RW02b].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner and Ueli Maurer
About the Mutual (Conditional) Information
2002, Proceedings version (ISIT 2002): [RM02b].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Renato Renner and Stefan Wolf
Towards Characterizing the Non-Locality of Entangled Quantum States
eprint archive: http://arxiv.org/abs/quant-ph/0211019, 2002, Proceedings version (ISIT 2003): [RW03c].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Matthias Fitzi, Nicolas Gisin, and Ueli Maurer
Quantum Solution to the {B}yzantine Agreement Problem
Physical Review Letters, vol. 87, no. 21, pp. 7901–7904, Nov 2001.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt
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, {H}artung-{G}orre {V}erlag, {K}onstanz, 2001.
[ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt and Ueli Maurer
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Matthias Fitzi, Juan A. Garay, Ueli Maurer, and Rafail Ostrovsky
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ronald Cramer, Ivan Damg{å}rd, and Serge Fehr
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ran Canetti, Ivan Damg{å}rd, Stefan Dziembowski, Yuval Ishai, and Tal Malkin
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.
[ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
Cryptography $2000±10$
Informatics — 10 Years Back, 10 Years Ahead, Lecture Notes in Computer Science, Springer-Verlag, vol. 2000, pp. 63–85, 2001.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt, Ueli Maurer, and Bartosz Przydatek
Efficient Secure Multi-Party Computation
Advances in Cryptology — ASIACRYPT 2000, Lecture Notes in Computer Science, Springer-Verlag, vol. 1976, pp. 143–161, Dec 2000.
[ 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.
[ 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].
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Matthias Fitzi and Ueli Maurer
Global Broadcast by Broadcasts Among Subsets of Players
IEEE International Symposium on Information Theory — ISIT 2000, IEEE, pp. 267, Jun 2000.
[ 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.
[ 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].
[ 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].
[ 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.
[ Abstract ] [ BibTeX ]
Martin Hirt and Kazue Sako
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ronald Cramer, Ivan Damg{å}rd, and Ueli Maurer
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Matthias Fitzi and Ueli Maurer
From Partial Consistency to Global Broadcast
Proc. 32nd ACM Symposium on Theory of Computing — STOC 2000, ACM, pp. 494–503, May 2000.
[ PS ] [ PDF ] [ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ronald Cramer, Ivan Damg{å}rd, and Stefan Dziembowski
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt and Ueli Maurer
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}.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Reto Kohlas and Ueli Maurer
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Lennart Meier
Special Aspects of Escrow-based E-Cash Systems
Master's thesis, Universit{ä}t des Saarlandes, Saarbr{ü}cken, 2000.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Reto Kohlas and Ueli Maurer
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Stefan Wolf
The {D}iffie-{H}ellman Protocol
Designs, Codes and Cryptography, Special Issue Public Key Cryptography, Kluwer Academic Publishers, vol. 19, no. 3, pp. 147–171, Jan 2000.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ronald Cramer, Ivan Damg{å}rd, and Phillip MacKenzie
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Stefan Wolf
Reducing String Oblivious Transfer to Universal Oblivious Transfer
2000, This is the extended version of [Wol00b].
[ 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].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Matthias Fitzi, Martin Hirt, and Ueli Maurer
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.
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ronald Cramer and Victor Shoup
Signature Schemes Based on the Strong {RSA} Assumption
5th {ACM} Conference on Computer and Communications Security — CCS '99, ACM, pp. 46–51, Nov 1999.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Bernd Altmann, Matthias Fitzi, and Ueli Maurer
{B}yzantine 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.
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Anna Lysyanskaya, Ronald Rivest, Amit Sahai, and Stefan Wolf
Pseudonym Systems
Proceedings of Selected Areas in Cryptography — SAC '99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1758, pp. 184–199, Aug 1999.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ronald Cramer, Ivan Damg{å}rd, Stefan Dziembowski, Martin Hirt, and Tal Rabin
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Serge Fehr
Efficient Construction of the Dual Span Program
Manuscript, May 1999.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Stefan Wolf
The Relationship Between Breaking the {D}iffie-{H}ellman Protocol and Computing Discrete Logarithms
SIAM Journal on Computing, vol. 28, no. 5, pp. 1689–1721, Apr 1999.
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Reto Kohlas and Ueli Maurer
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Stefan Wolf
Information-Theoretically and Computationally Secure Key Agreement in Cryptography
PhD Thesis, {ETH Zurich}, 1999.
[ 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.
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Matthias Fitzi and Ueli Maurer
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Matthias Fitzi, Martin Hirt, and Ueli Maurer
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.
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ronald Cramer and Victor Shoup
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ronald Cramer and Ivan Damg{å}rd
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Stefan Wolf
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.
[ 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.
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Serge Fehr
Span Programs over Rings and How to Share a Secret from a Module
Master's thesis, ETH Zurich, Institute for Theoretical Computer Science, 1998.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Stefan Wolf
On the Hardness of the {D}iffie-{H}ellman Decision Problem
1998, Manuscript.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Jan Camenisch
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, {H}artung-{G}orre {V}erlag, {K}onstanz, 1998.
[ PDF ] [ Abstract ] [ BibTeX ]
Ronald Cramer, Rosario Gennaro, and Berry Schoenmakers
A Secure and Optimally Efficient Multi-Authority Election Scheme
European Transactions on Telecommunications, vol. 8, no. 5, pp. 481–490, Sep 1997, Preliminary version: [CGS97b].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Martin Hirt and Ueli Maurer
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.
[ 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.
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Jan Camenisch and Markus Stadler
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.
[ 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.
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Stefan Dziembowski, Marcin Jurdzinski, and Igor Walukiewicz
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.
[ 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.
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Jan Camenisch
Efficient and Generalized Group Signatures
Advances in Cryptology — EUROCRYPT '97, Lecture Notes in Computer Science, Springer-Verlag, vol. 1233, pp. 465–479, May 1997.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ronald Cramer and Ivan Damg{å}rd
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ronald Cramer and Ivan Damg{å}rd
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ronald Cramer, Rosario Gennaro, and Berry Schoenmakers
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: [CGS97].
[ 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].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Jan Camenisch and Markus Stadler
Proof Systems for General Statements about Discrete Logarithms
Technical Report no. 260, Institute for Theoretical Computer Science, ETH Zurich, Mar 1997.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Jan Camenisch, Ueli Maurer, and Markus Stadler
Digital Payment Systems with Passive Anonymity-Revoking Trustees
Journal of Computer Security, vol. 5, no. 1, pp. 69–89, 1997, Preliminary version: [CMS96].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Stefan Wolf
The Generic Complexity of Index-Search Problems and Applications to Cryptography
1997, Manuscript.
[ 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.
[ PS ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Yacov Yacobi
A Non-interactive Public-Key Distribution System
Designs, Codes and Cryptography, vol. 9, no. 3, pp. 305–316, Nov 1996, Preliminary version: [MY91].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Daniel Bleichenbacher and Ueli Maurer
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.
[ PS ] [ PDF ] [ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Jan Camenisch, Ueli Maurer, and Markus Stadler
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: [CMS97].
[ Abstract ] [ BibTeX ]
Stefan Dziembowski
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Stefan Wolf
{D}iffie-{H}ellman Oracles
Advances in Cryptology — CRYPTO '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1109, pp. 268–282, Aug 1996.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Daniel Bleichenbacher
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Markus Stadler
Publicly Verifiable Secret Sharing
Advances in Cryptology — EUROCRYPT '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1070, pp. 190–199, May 1996.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Stefan Wolf
On the Complexity of Breaking the {D}iffie-{H}ellman Protocol
Technical Report no. 244, Institute for Theoretical Computer Science, ETH Zurich, Apr 1996.
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Daniel Bleichenbacher and Ueli Maurer
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.
[ 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].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Pierre Schmid
A Calculus for Security Bootstrapping in Distributed Systems
Journal of Computer Security, vol. 4, no. 1, pp. 55–80, 1996, Preliminary version: [MS94].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
On the Oracle Complexity of Factoring Integers
Computational Complexity, vol. 5, no. 4, pp. 237–247, 1996, Preliminary version: [Mau92f].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Markus Stadler
Cryptographic Protocols for Revocable Privacy
PhD Thesis, {ETH Zurich}, 1996.
[ Abstract ] [ BibTeX ]
Daniel Bleichenbacher
Efficiency and Security of Cryptosystems Based on Number Theory
PhD Thesis, {ETH} Zurich, 1996.
[ 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.
[ 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].
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Jan Camenisch, Jean-Marc Piveteau, and Markus Stadler
{F}aire {A}nonyme {Z}ahlungssysteme
{GISI} '95, {I}nformatik aktuell, Springer-Verlag, pp. 254–265, Sep 1995.
[ Abstract ] [ BibTeX ]
Daniel Bleichenbacher, Wieb Bosma, and Arjen K. Lenstra
Some Remarks on {L}ucas-Based Cryptosystems
Advances in Cryptology — CRYPTO '95, Lecture Notes in Computer Science, Springer-Verlag, vol. 963, pp. 386–396, Aug 1995.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Markus Stadler, Jean-Marc Piveteau, and Jan Camenisch
Fair Blind Signatures
Advances in Cryptology — EUROCRYPT '95, Lecture Notes in Computer Science, Springer-Verlag, vol. 921, pp. 209–219, May 1995.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
Kryptologie: eine neuartige {A}nwendung der {M}athematik
Elemente der Mathematik, Birkh{ä}user Verlag, vol. 50, no. 3, pp. 89–106, 1995.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters
Journal of Cryptology, vol. 8, no. 3, pp. 123–155, 1995, Preliminary version: [Mau89].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Jan Camenisch, Jean-Marc Piveteau, and Markus Stadler
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Pierre Schmid
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: [MS96].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
Towards the Equivalence of Breaking the {D}iffie-{H}ellman Protocol and Computing Discrete Logarithms
Advances in Cryptology — CRYPTO '94, Lecture Notes in Computer Science, Springer-Verlag, vol. 839, pp. 271–281, Aug 1994.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Daniel Bleichenbacher and Ueli Maurer
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.
[ 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.
[ 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].
[ Abstract ] [ BibTeX ]
Jan Camenisch, Jean-Marc Piveteau, and Markus Stadler
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.
[ PS ] [ PDF ] [ 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].
[ 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.
[ 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.
[ 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].
[ 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].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and James L. Massey
Cascade Ciphers: The Importance of Being First
Journal of Cryptology, vol. 6, no. 1, pp. 55–61, 1993, Preliminary version: [MM90b].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
Asymptotically-Tight Bounds on the Number of Cycles in Generalized de {B}ruijn-Good Graphs
Discrete Applied Mathematics, vol. 37, pp. 421–436, Jul 1992.
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Yacov Yacobi
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 [MY91]. See [MY96] for the final version.
[ Abstract ] [ BibTeX ]
Ueli Maurer
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: [Mau96].
[ Abstract ] [ BibTeX ]
Ueli Maurer
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.
[ 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].
[ 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].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Kenji Koyama, Ueli Maurer, Tatsuaki Okamoto, and Scott Vanstone
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.
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer and Yacov Yacobi
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: [MY96], see also the note in [MY92].
[ 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].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
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: [Mau92a].
[ 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].
[ Abstract ] [ BibTeX ]
Ueli Maurer and James L. Massey
Cascade Ciphers: The Importance of Being First
IEEE International Symposium on Information Theory — ISIT '90, IEEE, pp. 118, Jan 1990, Final version: [MM93a].
[ 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].
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]
Ueli Maurer
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: [Mau95a].
[ 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.
[ PS ] [ PDF ] [ Abstract ] [ BibTeX ]

© IACR | Springer | ACM | IEEE