# Information Security and Cryptography Research Group

## Ueli Maurer's Publications

### Giving an Adversary Guarantees (Or: How to Model Designated Verifier Signatures in a Composable Framework)

Ueli Maurer, Christopher Portmann, and Guilherme Rito
Advances in Cryptology—ASIACRYPT 2021, Lecture Notes in Computer Science, Springer International Publishing, vol. 13092, pp. 189–219, Dec 2021.

### Adaptive Security of Multi-Party Protocols, Revisited

Martin Hirt, Chen-Da Liu Zhang, and Ueli Maurer
Theory of Cryptography — TCC 2021, LNCS, Springer International Publishing, vol. 13042, pp. 686–716, Nov 2021.

### Direct Product Hardness Amplification

David Lanzenberger and Ueli Maurer
Theory of Cryptography — TCC 2021, LNCS, Springer International Publishing, vol. 13043, pp. 605–625, Nov 2021.

### Generalized Proofs of Knowledge with Fully Dynamic Setup

Christian Badertscher, Daniel Jost, and Ueli Maurer
Theory of Cryptography – TCC 2021, LNCS, Springer International Publishing, vol. 13042, pp. 499–528, Nov 2021.

### Revisiting (R)CCA Security and Replay Protection

Christian Badertscher, Ueli Maurer, Christopher Portmann, and Guilherme Rito
Public-Key Cryptography – PKC 2021, Lecture Notes in Computer Science, Springer International Publishing, vol. 12711, pp. 173–202, May 2021.

### Abstract Modeling of System Communication in Constructive Cryptography using CryptHOL

David Basin, Andreas Lochbihler, Ueli Maurer, and S. Reza Sefidgar
Computer Security Foundations Symposium – CSF 2021, pp. 1–16, 2021.

### Coupling of Random Systems

David Lanzenberger and Ueli Maurer
Theory of Cryptography — TCC 2020, LNCS, Springer International Publishing, vol. 12552, pp. 207–240, Dec 2020.

### MPC with Synchronous Security and Asynchronous Responsiveness

Chen-Da Liu Zhang, Julian Loss, Ueli Maurer, Tal Moran, and Daniel Tschudi
Advances in Cryptology—ASIACRYPT 2020, Dec 2020.

Chen-Da Liu Zhang, Varun Maram, and Ueli Maurer
International Conference on Principles of Distributed Systems — OPODIS 2020, Dec 2020.

### Synchronous Constructive Cryptography

Chen-Da Liu Zhang and Ueli Maurer
Theory of Cryptography — TCC 2020, LNCS, Springer International Publishing, vol. 12552, pp. 439–472, Dec 2020.

### Anonymous Symmetric-Key Communication

Fabio Banfi and Ueli Maurer
Security and Cryptography for Networks – SCN 2020, LNCS, Springer, vol. 12238, pp. 471–491, Sep 2020.

### Overcoming Impossibility Results in Composable Security Using Interval-Wise Guarantees

Daniel Jost and Ueli Maurer
Advances in Cryptology – CRYPTO 2020, LNCS, Springer, vol. 12170, pp. 33–62, Aug 2020.

### Topology-Hiding Computation for Networks with Unknown Delays

Rio LaVigne, Chen-Da Liu Zhang, Ueli Maurer, Tal Moran, Marta Mularczyk, and Daniel Tschudi
Public-Key Cryptography — PKC 2020, LNCS, Springer, vol. 12111, pp. 215–245, Apr 2020.

### A Unified and Composable Take on Ratcheting

Daniel Jost, Ueli Maurer, and Marta Mularczyk
Theory of Cryptography — TCC 2019, LNCS, Springer International Publishing, vol. 11891, pp. 180–210, Dec 2019.

### Composable and Finite Computational Security of Quantum Message Transmission

Fabio Banfi, Ueli Maurer, Christopher Portmann, and Jiamin Zhu
Theory of Cryptography – TCC 2019, LNCS, Springer, vol. 11891, pp. 282–311, Dec 2019.

### Brief Announcement: Towards Byzantine Broadcast in Generalized Communication and Adversarial Models

Chen-Da Liu Zhang, Varun Maram, and Ueli Maurer
International Symposium on Distributed Computing — DISC 2019, Oct 2019.

### Formalizing Constructive Cryptography using CryptHOL

Andreas Lochbihler, S. Reza Sefidgar, David Basin, and Ueli Maurer
IEEE 32rd Computer Security Foundations Symposium (CSF), IEEE Press, Jun 2019.

### Efficient Ratcheting: Almost-Optimal Guarantees for Secure Messaging

Daniel Jost, Ueli Maurer, and Marta Mularczyk
Advances in Cryptology – EUROCRYPT 2019, LNCS, Springer International Publishing, vol. 11476, pp. 159–188, May 2019.

### Per-session Security: Password-based Cryptography Revisited

Grégory Demay, Peter Gaži, Ueli Maurer, and Björn Tackmann
Journal of Computer Security, IOS Press, vol. 27, pp. 75–111, 2019.

### Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio

Daniel Jost , Ueli Maurer, and João L. Ribeiro
Theory of Cryptography — TCC 2018, LNCS, Springer International Publishing, vol. 11239, pp. 345–369, Nov 2018.

### Topology-Hiding Computation Beyond Semi-Honest Adversaries

Rio LaVigne, Chen-Da Liu Zhang, Ueli Maurer, Tal Moran, Marta Mularczyk, and Daniel Tschudi
Theory of Cryptography — TCC, LNCS, Springer International Publishing, vol. 11240, pp. 3–35, Nov 2018.

### Toward an Algebraic Theory of Systems

Christian Matt, Ueli Maurer, Christopher Portmann, Renato Renner, and Björn Tackmann
Theoretical Computer Science, vol. 747, pp. 1–25, Nov 2018.

### A Constructive Perspective on Signcryption Security

Christian Badertscher, Fabio Banfi, and Ueli Maurer
Security and Cryptography for Networks – SCN 2018, LNCS, Springer, vol. 11035, pp. 102–120, Sep 2018.

### Security Definitions For Hash Functions: Combining UCE and Indifferentiability

Daniel Jost and Ueli Maurer
International Conference on Security and Cryptography for Networks – SCN 2018, LNCS, Springer, vol. 11035, pp. 83–101, Sep 2018.

### But Why does it Work? A Rational Protocol Design Treatment of Bitcoin

Christian Badertscher, Juan Garay, Ueli Maurer, Daniel Tschudi, and Vassilis Zikas
Advances in Cryptology — EUROCRYPT 2018, LNCS, Springer, vol. 10821 (Proceedings Part II), pp. 34–65, Apr 2018.

### Composable and Robust Outsourced Storage

Topics in Cryptology — CT-RSA 2018, LNCS, Springer, vol. 10808, pp. 354-373, Apr 2018.

### On Composable Security for Digital Signatures

Christian Badertscher, Ueli Maurer, and Björn Tackmann
Public-Key Cryptography — PKC 2018, LNCS, Springer, vol. 10769 (Proceedings Part I), pp. 494–523, Mar 2018.

### Strengthening Access Control Encryption

Christian Badertscher, Christian Matt, and Ueli Maurer
Advances in Cryptology—ASIACRYPT 2017, Lecture Notes in Computer Science, Springer International Publishing, vol. 10624, pp. 502–532, Nov 2017.

### Per-session Security: Password-based Cryptography Revisited

Grégory Demay, Peter Gaži, Ueli Maurer, and Björn Tackmann
Computer Security – ESORICS 2017, Lecture Notes in Computer Science, Springer International Publishing, vol. 10492, pp. 408–426, Sep 2017.

### Bitcoin as a Transaction Ledger: A Composable Treatment

Christian Badertscher, Ueli Maurer, Daniel Tschudi, and Vassilis Zikas
Advances in Cryptology – CRYPTO 2017, LNCS, Springer, vol. 10401 (Proceedings Part I), pp. 324–356, Aug 2017.

### An Information-theoretic Approach to Hardness Amplification

Ueli Maurer
2017 IEEE International Symposium on Information Theory (ISIT), Jun 2017.

### Efficiency Lower Bounds for Commit-and-Prove Constructions

Christian Badertscher, Sandro Coretti, Chen-Da Liu Zhang, and Ueli Maurer
2017 IEEE International Symposium on Information Theory (ISIT), IEEE, pp. 1788–1792, Jun 2017.

### Witness-Hiding Proofs of Knowledge for Cable Locks

Chen-Da Liu Zhang, Ueli Maurer, Martin Raszyk, and Daniel Tschudi
IEEE International Symposium on Information Theory (ISIT), pp. 953-957, Jun 2017.

### Causal Boxes: Quantum Information-Processing Systems Closed Under Composition

Christopher Portmann, Christian Matt, Ueli Maurer, Renato Renner, and Björn Tackmann
IEEE Transactions on Information Theory, vol. 63, no. 5, pp. 3277-3305, May 2017.

### From Indifferentiability to Constructive Cryptography (and Back)

Ueli Maurer and Renato Renner
Theory of Cryptography, Lecture Notes in Computer Science, Springer Berlin Heidelberg, vol. 9985, pp. 1–22, Nov 2016.

### Memory Erasability Amplification

Jan Camenisch, Robert R. Enderlein, and Ueli Maurer
Security and Cryptography for Networks (SCN), Lecture Notes in Computer Science, Springer, vol. 9841, pp. 104–125, Aug 2016.

### Network-Hiding Communication and Applications to Multi-Party Protocols

Martin Hirt, Ueli Maurer, Daniel Tschudi, and Vassilis Zikas
Advances in Cryptology – CRYPTO 2016, Security and Cryptology, Springer-Verlag Berlin Heidelberg, vol. 9814, pp. 335-365, Aug 2016.

### Hierarchy of Three-Party Consistency Specifications

Julian Loss, Ueli Maurer, and Daniel Tschudi
2016 IEEE International Symposium on Information Theory (ISIT), IEEE, pp. 3048-3052, Jul 2016.

### New Perspectives on Weak Oblivious Transfer

Ueli Maurer and João Ribeiro
2016 IEEE International Symposium on Information Theory (ISIT), pp. 790–794, Jul 2016.

### On the Impossibility of Information-Theoretic Composable Coin Toss Extension

Gregor Seiler and Ueli Maurer
2016 IEEE International Symposium on Information Theory, pp. 3058–3061, Jul 2016.

### Cryptography and Computation after Turing

Ueli Maurer
The Once and Future Turing, Cambridge University Press, 2016.

### Robust Authenticated Encryption and the Limits of Symmetric Cryptography

Christian Badertscher, Christian Matt, Ueli Maurer, Phillip Rogaway, and Björn Tackmann
15th IMA International Conference on Cryptography and Coding - IMACC 2015, LNCS, Springer, vol. 9496, pp. 112–129, Dec 2015.

### Augmented Secure Channels and the Goal of the TLS 1.3 Record Layer

Christian Badertscher, Christian Matt, Ueli Maurer, Phillip Rogaway, and Björn Tackmann
The 9th International Conference on Provable Security - ProvSec 2015, LNCS, Springer, vol. 9451, pp. 85–104, Nov 2015.

### A Definitional Framework for Functional Encryption

Christian Matt and Ueli Maurer
Computer Security Foundations Symposium (CSF), 2015 IEEE 28th, pp. 217-231, Jul 2015.

### Query-Complexity Amplification for Random Oracles

Grégory Demay, Peter Gaži, Ueli Maurer, and Björn Tackmann
Information Theoretic Security, Lecture Notes in Computer Science, Springer International Publishing, vol. 9063, pp. 159-180, May 2015.

### From Single-Bit to Multi-Bit Public-Key Encryption via Non-Malleable Codes

Sandro Coretti, Ueli Maurer, Björn Tackmann, and Daniele Venturi
Theory of Cryptography, Lecture Notes in Computer Science, Springer Berlin Heidelberg, vol. 9014, pp. 532-560, 2015.

### Idealizing Identity-Based Encryption

Dennis Hofheinz, Christian Matt, and Ueli Maurer
Advances in Cryptology – ASIACRYPT 2015, Lecture Notes in Computer Science, Springer Berlin Heidelberg, vol. 9452, pp. 495-520, 2015.

### Zero-knowledge proofs of knowledge for group homomorphisms

Ueli Maurer
Designs, Codes and Cryptography, vol. 77, pp. 663–676, 2015.

### Anonymous Authentication with Shared Secrets

Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, and Pavel Raykov
Progress in Cryptology — LATINCRYPT 2014, Sep 2014.

### Key-Indistinguishable Message Authentication Codes

Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, and Pavel Raykov
The 9th Conference on Security and Cryptography for Networks — SCN 2014, Lecture Notes in Computer Science, Springer, vol. 8642, pp. 476–493, Sep 2014.

### Optimality of Non-Adaptive Strategies: The Case of Parallel Games

Grégory Demay, Peter Gaži, Ueli Maurer, and Björn Tackmann
2014 IEEE International Symposium on Information Theory (ISIT), pp. 1707-1711, Jun 2014.

Martin Hirt, Ueli Maurer, and Pavel Raykov
Theory of Cryptography Conference — TCC 2014, Lecture Notes in Computer Science, Springer, vol. 8349, pp. 419–439, Feb 2014.

### Constructing Confidential Channels from Authenticated Channels—Public-Key Encryption Revisited

Sandro Coretti, Ueli Maurer, and Björn Tackmann
Advances in Cryptology—ASIACRYPT 2013, Lecture Notes in Computer Science, Springer, vol. 8269, pp. 134–153, Dec 2013.

### Rational Protocol Design: Cryptography Against Incentive-driven Adversaries

Juan Garay, Jonathan Katz, Ueli Maurer, Björn Tackmann, and Vassilis Zikas
FOCS 2013, IEEE, Oct 2013.

### A Dynamic Tradeoff Between Active and Passive Corruptions in Secure Multi-Party Computation

Martin Hirt, Christoph Lucas, and Ueli Maurer
Advances in Cryptology — CRYPTO 2013, Lecture Notes in Computer Science, Springer-Verlag, vol. 8043, pp. 203–219, Aug 2013.

### Anonymity-preserving Public-Key Encryption: A Constructive Approach

Markulf Kohlweiss, Ueli Maurer, Cristina Onete, Björn Tackmann, and Daniele Venturi
Privacy Enhancing Technologies — 13th International Symposium, Lecture Notes in Computer Science, Springer, vol. 7981, pp. 19–39, Jul 2013.

### Authentication Amplification by Synchronization

Ueli Maurer
2013 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 2711–2714, Jul 2013.

### Conditional Equivalence of Random Systems and Indistinguishability Proofs

Ueli Maurer
2013 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 3150–3154, Jul 2013.

Christian Matt and Ueli Maurer
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on, pp. 2706-2710, Jul 2013.

### Unfair Coin Tossing

Grégory Demay and Ueli Maurer
2013 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 1556–1560, Jul 2013.

### Resource-Restricted Indifferentiability

Grégory Demay, Peter Gaži, Martin Hirt, and Ueli Maurer
Advances in Cryptology — EUROCRYPT 2013, Lecture Notes in Computer Science, Springer-Verlag, vol. 7881, pp. 665–684, May 2013, this is the full version.

### Universally Composable Synchronous Computation

Jonathan Katz, Ueli Maurer, Björn Tackmann, and Vassilis Zikas
Theory of Cryptography — TCC 2013, Lecture Notes in Computer Science, Springer, vol. 7785, pp. 477-498, Mar 2013.

### A Constructive Perspective on Key Encapsulation

Sandro Coretti, Ueli Maurer, and Björn Tackmann
Number Theory and Cryptography, Lecture Notes in Computer Science, Springer, vol. 8260, pp. 226–239, 2013.

### UOWHFs from OWFs: Trading regularity for efficiency

Kfir Barhum and Ueli Maurer
Progress in Cryptology — LATINCRYPT 2012, Lecture Notes in Computer Science, Springer-Verlag, vol. 7533, pp. 234–253, Oct 2012.

### Common Randomness Amplification: A Constructive View

Grégory Demay and Ueli Maurer
IEEE Information Theory Workshop (ITW), pp. 35 -39, Sep 2012.

### Collusion-Preserving Computation

Joël Alwen, Jonathan Katz, Ueli Maurer, and Vassilis Zikas
Advances in Cryptology — CRYPTO 2012, Lecture Notes in Computer Science, Springer-Verlag, vol. 7417, pp. 124-143, Aug 2012.

### Synchrony Amplification

Ueli Maurer and Björn Tackmann
Information Theory Proceedings — ISIT 2012, IEEE, pp. 1583-1587, Jul 2012.

### Confidentiality and Integrity: A Constructive Perspective

Ueli Maurer, Andreas Rüedlinger, and Björn Tackmann
Theory of Cryptography — TCC 2012, Lecture Notes in Computer Science, Springer, vol. 7194, pp. 209–229, Mar 2012.

### Passive Corruption in Statistical Multi-Party Computation

Martin Hirt, Christoph Lucas, Ueli Maurer, and Dominik Raub
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.

### Privacy-Preserving Outsourcing of Brute-Force Key Searches

Ghassan O. Karame, Srdjan Capkun, and Ueli Maurer
Proc. 2011 ACM Cloud Computing Security Workshop (CCSW), ACM, Oct 2011.

### The Equivalence of Strong RSA and Factoring in the Generic Ring Model of Computation.

Divesh Aggarwal, Ueli Maurer, and Igor Shparlinski
Workshop on Coding and Cryptography - WCC 2011, INRIA, vol. inria00607256, version 1, Jul 2011.

### Constructive cryptography – A new paradigm for security definitions and proofs

Ueli Maurer
Theory of Security and Applications (TOSCA 2011), Lecture Notes in Computer Science, Springer-Verlag, vol. 6993, pp. 33–56, Apr 2011.

### Abstract Cryptography

Ueli Maurer and Renato Renner
The Second Symposium on Innovations in Computer Science, ICS 2011, Tsinghua University Press, pp. 1–21, Jan 2011.

### Graceful Degradation in Multi-Party Computation

Martin Hirt, Christoph Lucas, Ueli Maurer, and Dominik Raub
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.

### The Leakage-Resilience Limit of a Computational Problem is Equal to its Unpredictability Entropy

Divesh Aggarwal and Ueli Maurer
Advances in Cryptology - Asiacrypt 2011, Lecture Notes in Computer Science, Springer-Verlag, vol. 7073, pp. 686-701, 2011.

### On the Soundness of Authenticate-then-Encrypt: Formalizing the Malleability of Symmetric Encryption

Ueli Maurer and Björn Tackmann
Proceedings of the 17th ACM Conference on Computer and Communication Security, ACM, pp. 505–515, Oct 2010.

### Hybrid-Secure MPC: Trading Information-Theoretic Robustness for Computational Privacy

Christoph Lucas, Dominik Raub, and Ueli Maurer
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.

### A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch

Ueli Maurer and Stefano Tessaro
Theory of Cryptography — TCC 2010, Lecture Notes in Computer Science, Springer-Verlag, vol. 5978, pp. 237–254, Feb 2010.

### Constructive Cryptography – A Primer

Ueli Maurer
Financial Cryptography 2010, Lecture Notes in Computer Science, Springer-Verlag, vol. 6052, pp. 1, Jan 2010.

### Free-Start Distinguishing: Combining Two Types of Indistinguishability Amplification

Peter Gaži and Ueli Maurer
The 4th International Conference on Information Theoretic Security - ICITS 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5973, pp. 28–44, 2010.

Peter Gaži and Ueli Maurer
Advances in Cryptology — ASIACRYPT 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5912, pp. 37–51, Dec 2009.

### Abstraction in Cryptography

Ueli Maurer
Advances in Cryptology — CRYPTO 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5677, pp. 459, Aug 2009.

### Computational Indistinguishability Amplification: Tight Product Theorems for System Composition

Ueli Maurer and Stefano Tessaro
Advances in Cryptology — CRYPTO 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5677, pp. 350–368, Aug 2009.

### Unifying Zero-knowledge Proofs of Knowledge

Ueli Maurer
Advances in Cryptology - AfricaCrypt 2009, Lecture Notes in Computer Science, Springer-Verlag, Jun 2009.

### Breaking RSA Generically is Equivalent to Factoring

Divesh Aggarwal and Ueli Maurer
Advances in Cryptology - EUROCRYPT 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5479, pp. 36-53, Apr 2009.

### Realistic Failures in Secure Multi-party Computation

Vassilis Zikas , Sarah Hauser , and Ueli Maurer
Theory of Cryptography Conference — TCC 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5444, pp. 274-293, Mar 2009.

### Abstract Storage Devices

Robert Koenig, Ueli Maurer, and Stefano Tessaro
Theory and Practice of Computer Science — SOFSEM 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5404, pp. 341–352, Jan 2009.

### Random Systems: Theory and Applications

Ueli Maurer
ICITS 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4883, pp. 44–45, 2009.

### Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography

Ueli Maurer and Stefano Tessaro
Advances in Cryptology — ASIACRYPT 2008, Lecture Notes in Computer Science, Springer-Verlag, vol. 5350, pp. 161–178, Dec 2008.

### MPC vs. SFE: Unconditional and Computational Security

Martin Hirt, Ueli Maurer, and Vassilis Zikas
Advances in Cryptology — ASIACRYPT 2008, Lecture Notes in Computer Science, Springer-Verlag, vol. 5350, pp. 1–18, Dec 2008.

### Rethinking Digital Signatures

Ueli Maurer
Proc. of SECRYPT 2008, INSTICC, pp. IS-31–IS-33, Jul 2008.

### The Bare Bounded-storage Model: The Tight Bound on the Storage Requirement for Key Agreement

Stefan Dziembowski and Ueli Maurer
IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2790–2792, Jun 2008.

### MPC vs. SFE: Perfect Security in a Unified Corruption Model

Zuzana Beerliova-Trubiniova, Matthias Fitzi, Martin Hirt, Ueli Maurer, and Vassilis Zikas
Theory of Cryptography Conference — TCC 2008, Lecture Notes in Computer Science, Springer-Verlag, vol. 4948, pp. 231–250, Mar 2008.

### Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations

Ueli Maurer and Dominik Raub
Advances in Cryptology — ASIACRYPT 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4833, pp. 427–443, Dec 2007.

### Domain Extension of Public Random Functions: Beyond the Birthday Barrier

Ueli Maurer and Stefano Tessaro
Advances in Cryptology — CRYPTO 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4622, pp. 187–204, Aug 2007, Full version available from http://eprint.iacr.org/2007/229.

### Indistinguishability Amplification

Ueli Maurer, Krzysztof Pietrzak, and Renato Renner
Advances in Cryptology — CRYPTO 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4622, pp. 130–149, Aug 2007.

### Abstract Storage Devices

Robert Koenig, Ueli Maurer, and Stefano Tessaro
eprint archive, Jun 2007, Available at http://www.arxiv.org/abs/0706.2746.

### A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security

Ueli Maurer and Johan Sjödin
Advances in Cryptology — EUROCRYPT 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4515, pp. 498–516, May 2007.

### Small Accessible Quantum Information Does Not Imply Security

Robert Koenig, Renato Renner, Andor Bariska, and Ueli Maurer
Physical Review Letters, vol. 98, no. 140502, Apr 2007, Preliminary version available at http://arxiv.org/abs/quant-ph/0512021.

### Unbreakable keys from random noise

Ueli Maurer, Renato Renner, and Stefan Wolf
Security with Noisy Data, Springer-Verlag, pp. 21–44, 2007.

### Indistinguishability Amplification

Ueli Maurer, Krzysztof Pietrzak, and Renato Renner
Dec 2006, Available at http://eprint.iacr.org/2006/456.

### Luby-Rackoff Ciphers from Weak Round Functions?

Ueli Maurer, Yvonne Anne Oswald, Krzysztof Pietrzak, and Johan Sjödin
Cryptology ePrint Archive, Report 2006/213, Jun 2006, http://eprint.iacr.org/2006. This is the full version of [MOPS06a].

### Luby-Rackoff Ciphers from Weak Round Functions?

Ueli Maurer, Yvonne Anne Oswald, Krzysztof Pietrzak, and Johan Sjödin
Advances in Cryptology — EUROCRYPT 2006, Lecture Notes in Computer Science, Springer-Verlag, vol. 4004, pp. 391–408, May 2006, Proceedings version of [MOPS06b].

### Secure Multi-party Computation made Simple

Ueli Maurer
Discrete Applied Mathematics, vol. 154, pp. 370–381, 2006.

### Abstract Models of Computation in Cryptography

Ueli Maurer
Cryptography and Coding 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3796, pp. 1–12, Dec 2005.

### Domain Expansion of MACs: Alternative Uses of the FIL-MAC

Ueli Maurer and Johan Sjödin
Cryptography and Coding 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3796, pp. 168–185, Dec 2005.

### Generalized Strong Extractors and Deterministic Privacy Amplification

Robert Koenig and Ueli Maurer
Cryptography and Coding 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3796, pp. 322–339, Dec 2005.

### On the Power of Quantum Memory

Robert Koenig, Ueli Maurer, and Renato Renner
IEEE Transactions on Information Theory, vol. 51, no. 7, pp. 2391–2401, Jul 2005, eprint archive: http://arxiv.org/abs/quant-ph/0305154.

### Single-key AIL-MACs from any FIL-MAC

Ueli Maurer and Johan Sjödin
Automata, Languages and Programming — ICALP 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3580, pp. 472–484, Jul 2005.

### Byzantine Agreement Given Partial Broadcast

Jeffrey Considine, Matthias Fitzi, Matthew Franklin, Leonid A. Levin, Ueli Maurer, and David Metcalf
Journal of Cryptology, vol. 18, no. 3, pp. 191–217, Jul 2005.

### Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order

Endre Bangerter, Jan Camenisch, and Ueli Maurer
Public Key Cryptography — PKC 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3386, pp. 154–171, Jan 2005.

### Towards a Theory of Consistency Primitives

Ueli Maurer
International Symposium on Distributed Computing — DISC 2004, Lecture Notes in Computer Science, Springer-Verlag, vol. 3274, pp. 379–389, Oct 2004.

### Complete Classification of Bilinear Hard-Core Functions

Thomas Holenstein, Ueli Maurer, and Johan Sjödin
Advances in Cryptology — CRYPTO 2004, Lecture Notes in Computer Science, Springer-Verlag, vol. 3152, pp. 73–91, Aug 2004.

### Extracting Randomness from Generalized Symbol-Fixing and Markov Sources

Robert Koenig and Ueli Maurer
IEEE International Symposium on Information Theory — ISIT 2004, IEEE, pp. 232, Jun 2004.

### New Approaches to Digital Evidence

Ueli Maurer
Proceedings of the IEEE, vol. 92, no. 6, pp. 933–947, Jun 2004.

### Privacy Amplification Secure Against an Adversary with Selectable Knowledge

Robert Koenig, Ueli Maurer, and Renato Renner
IEEE International Symposium on Information Theory — ISIT 2004, IEEE, pp. 231, Jun 2004.

### The Role of Cryptography in Database Security

Ueli Maurer
Proc. of ACM SIGMOD Int. Conference on Management of Data, pp. 5–10, Jun 2004.

### On Generating the Initial Key in the Bounded-Storage Model

Stefan Dziembowski and Ueli Maurer
Advances in Cryptology — EUROCRYPT 2004, Lecture Notes in Computer Science, Springer-Verlag, vol. 3027, pp. 126–137, May 2004.

### Composition of Random Systems: When Two Weak Make One Strong

Ueli Maurer and Krzysztof Pietrzak
Theory of Cryptography Conference — TCC 2004, Lecture Notes in Computer Science, Springer-Verlag, vol. 2951, pp. 410–427, Feb 2004.

### Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology

Ueli Maurer, Renato Renner, and Clemens Holenstein
Theory of Cryptography Conference — TCC 2004, Lecture Notes in Computer Science, Springer-Verlag, vol. 2951, pp. 21–39, Feb 2004.

### Optimal Randomizer Efficiency in the Bounded-Storage Model

Stefan Dziembowski and Ueli Maurer
Journal of Cryptology, vol. 17, no. 1, pp. 5–26, Jan 2004, Conference version appeared in Proc. of STOC 2002..

### Intrinsic Limitations of Digital Signatures and How to Cope With Them

Ueli Maurer
Proceedings of the 6th Information Security Conference — ISC '03, Lecture Notes in Computer Science, Springer-Verlag, vol. 2851, pp. 180–192, Oct 2003.

### The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations

Ueli Maurer and Krzysztof Pietrzak
Advances in Cryptology — EUROCRYPT 2003, Lecture Notes in Computer Science, Springer-Verlag, pp. 544–561, May 2003.

### Secret Key Agreement Over a Non-authenticated Channel — Part III: Privacy Amplification

Ueli Maurer and Stefan Wolf
IEEE Transactions on Information Theory, vol. 49, no. 4, pp. 839–851, Apr 2003.

### Secret Key Agreement Over a Non-authenticated Channel — Part II: The Simulatability Condition

Ueli Maurer and Stefan Wolf
IEEE Transactions on Information Theory, vol. 49, no. 4, pp. 832–838, Apr 2003.

### Secret Key Agreement Over a Non-authenticated Channel — Part I: Definitions and Bounds

Ueli Maurer and Stefan Wolf
IEEE Transactions on Information Theory, vol. 49, no. 4, pp. 822–831, Apr 2003.

### Secure Multi-Party Computation Made Simple

Ueli Maurer
Third Conference on Security in Communication Networks — SCN 2002, Lecture Notes in Computer Science, Springer-Verlag, vol. 2576, pp. 14–28, Sep 2002.

### Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks

Serge Fehr and Ueli Maurer
Advances in Cryptology — CRYPTO 2002, Lecture Notes in Computer Science, Springer-Verlag, vol. 2442, pp. 565–580, Aug 2002.

### About the Mutual (Conditional) Information

Renato Renner and Ueli Maurer
IEEE International Symposium on Information Theory — ISIT 2002, IEEE, pp. 364, Jun 2002, This is the Proceedings version of [RenMau02a].

### Generalized Indistinguishability

Ueli Maurer and Renato Renner
IEEE International Symposium on Information Theory — ISIT 2002, IEEE, pp. 295, Jun 2002.

### Indistinguishability of Random Systems

Ueli Maurer
Advances in Cryptology — EUROCRYPT 2002, Lecture Notes in Computer Science, Springer-Verlag, vol. 2332, pp. 110–132, May 2002.

### Tight Security Proofs for the Bounded-Storage Model

Stefan Dziembowski and Ueli Maurer
Proc. 34th ACM Symposium on Theory of Computing — STOC 2002, ACM, pp. 341–350, May 2002.

### Unconditional Byzantine Agreement and Multi-Party Computation Secure Against Dishonest Minorities from Scratch

Matthias Fitzi, Nicolas Gisin, Ueli Maurer, and Oliver von Rotz
Advances in Cryptology — EUROCRYPT 2002, Lecture Notes in Computer Science, Springer-Verlag, vol. 2332, pp. 482–501, May 2002.

### About the Mutual (Conditional) Information

Renato Renner and Ueli Maurer
2002, Proceedings version (ISIT 2002): [RenMau02b].

### Quantum Solution to the Byzantine Agreement Problem

Matthias Fitzi, Nicolas Gisin, and Ueli Maurer
Physical Review Letters, vol. 87, no. 21, pp. 7901–7904, Nov 2001.

### Minimal Complete Primitives for Secure Multi-Party Computation

Matthias Fitzi, Juan A. Garay, Ueli Maurer, and Rafail Ostrovsky
Advances in Cryptology — CRYPTO 2001, Lecture Notes in Computer Science, Springer-Verlag, pp. 80–100, Aug 2001.

Martin Hirt and Ueli Maurer
Advances in Cryptology — CRYPTO 2001, Lecture Notes in Computer Science, Springer-Verlag, vol. 2139, pp. 101–118, Aug 2001.

### Cryptography $2000\pm 10$

Ueli Maurer
Informatics — 10 Years Back, 10 Years Ahead, Lecture Notes in Computer Science, Springer-Verlag, vol. 2000, pp. 63–85, 2001.

### Efficient Secure Multi-Party Computation

Martin Hirt, Ueli Maurer, and Bartosz Przydatek
Advances in Cryptology — ASIACRYPT 2000, Lecture Notes in Computer Science, Springer-Verlag, vol. 1976, pp. 143–161, Dec 2000.

### Authentication Theory and Hypothesis Testing

Ueli Maurer
IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1350–1356, Jul 2000, Preliminary version: [Maurer96c].

### A Calculus of Conditional Independence and its Applications in Cryptography

Ueli Maurer
IEEE International Symposium on Information Theory — ISIT 2000, IEEE, pp. 243, Jun 2000.

### From Weak to Strong Secrecy in Information-Theoretic Key Agreement

Ueli Maurer and Stefan Wolf
IEEE International Symposium on Information Theory — ISIT 2000, IEEE, pp. 308, Jun 2000.

Matthias Fitzi and Ueli Maurer
IEEE International Symposium on Information Theory — ISIT 2000, IEEE, pp. 267, Jun 2000.

### From Partial Consistency to Global Broadcast

Matthias Fitzi and Ueli Maurer
Proc. 32nd ACM Symposium on Theory of Computing — STOC 2000, ACM, pp. 494–503, May 2000.

### General Secure Multi-Party Computation from any Linear Secret-Sharing Scheme

Ronald Cramer, Ivan Damgård, and Ueli Maurer
Advances in Cryptology — EUROCRYPT 2000, Lecture Notes in Computer Science, Springer-Verlag, vol. 1807, pp. 316–334, May 2000.

Ueli Maurer and Stefan Wolf
Advances in Cryptology — EUROCRYPT 2000, Lecture Notes in Computer Science, Springer-Verlag, vol. 1807, pp. 351–368, May 2000.

### Player Simulation and General Adversary Structures in Perfect Multiparty Computation

Martin Hirt and Ueli Maurer
Journal of Cryptology, Springer-Verlag, vol. 13, no. 1, pp. 31–60, Apr 2000, Extended abstract in Proc. 16th of ACM PODC '97.

### Reasoning About Public-Key Certification —- On Bindings Between Entities and Public Keys

Reto Kohlas and Ueli Maurer
IEEE Journal on Selected Areas in Communication, vol. 18, no. 4, pp. 561–570, Apr 2000.

### Confidence Valuation in a Public-key Infrastructure Based on Uncertain Evidence

Reto Kohlas and Ueli Maurer
Public Key Cryptography — PKC 2000, Lecture Notes in Computer Science, vol. 1751, pp. 93–112, Jan 2000.

### The Diffie-Hellman Protocol

Ueli Maurer and Stefan Wolf
Designs, Codes and Cryptography, Special Issue Public Key Cryptography, Kluwer Academic Publishers, vol. 19, no. 3, pp. 147–171, Jan 2000.

### General Adversaries in Unconditional Multi-Party Computation

Matthias Fitzi, Martin Hirt, and Ueli Maurer
Advances in Cryptology — ASIACRYPT '99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1716, pp. 232–246, Nov 1999.

### Byzantine Agreement Secure Against General Adversaries in the Dual Failure Model

Bernd Altmann, Matthias Fitzi, and Ueli Maurer
International Symposium on Distributed Computing — DISC '99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1693, pp. 123–137, Sep 1999.

### Information-Theoretic Cryptography

Ueli Maurer
Advances in Cryptology — CRYPTO '99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1666, pp. 47–64, Aug 1999.

### The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms

Ueli Maurer and Stefan Wolf
SIAM Journal on Computing, vol. 28, no. 5, pp. 1689–1721, Apr 1999.

### Unconditionally Secure Key Agreement and the Intrinsic Conditional Information

Ueli Maurer and Stefan Wolf
IEEE Transactions on Information Theory, vol. 45, no. 2, pp. 499–514, Mar 1999.

### Reasoning about Public-key Certification — on Bindings Between Entities and Public Keys

Reto Kohlas and Ueli Maurer
Proceedings of Financial Cryptography — FC '99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1648, pp. 86–103, Feb 1999.

### Efficient Byzantine Agreement Secure Against General Adversaries

Matthias Fitzi and Ueli Maurer
International Symposium on Distributed Computing — DISC '98, Lecture Notes in Computer Science, Springer-Verlag, vol. 1499, pp. 134–148, Sep 1998.

### Trading Correctness for Privacy in Unconditional Multi-Party Computation

Matthias Fitzi, Martin Hirt, and Ueli Maurer
Advances in Cryptology — CRYPTO '98, Lecture Notes in Computer Science, Springer-Verlag, vol. 1462, pp. 121–136, Aug 1998, Corrected proceedings version.

### Diffie-Hellman, Decision Diffie-Hellman, and Discrete Logarithms

Ueli Maurer and Stefan Wolf
IEEE International Symposium on Information Theory — ISIT '98, IEEE, pp. 327, Aug 1998.

### Lower Bounds on Generic Algorithms in Groups

Ueli Maurer and Stefan Wolf
Advances in Cryptology — EUROCRYPT '98, Lecture Notes in Computer Science, Springer-Verlag, vol. 1403, pp. 72–84, May 1998.

### On the Hardness of the Diffie-Hellman Decision Problem

Ueli Maurer and Stefan Wolf
1998, Manuscript.

### Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation

Martin Hirt and Ueli Maurer
Proc. 16th ACM Symposium on Principles of Distributed Computing — PODC '97, pp. 25–34, Aug 1997.

### Privacy Amplification Secure Against Active Adversaries

Ueli Maurer and Stefan Wolf
Advances in Cryptology — CRYPTO '97, Lecture Notes in Computer Science, Springer-Verlag, vol. 1294, pp. 307–321, Aug 1997.

### Unconditional Security Against Memory-Bounded Adversaries

Christian Cachin and Ueli Maurer
Advances in Cryptology — CRYPTO '97, Lecture Notes in Computer Science, Springer-Verlag, vol. 1294, pp. 292–306, Aug 1997.

### Smoothing Probability Distributions and Smooth Entropy

Christian Cachin and Ueli Maurer
IEEE International Symposium on Information Theory — ISIT '97, IEEE, Jun 1997.

### The Intrinsic Conditional Mutual Information and Perfect Secrecy

Ueli Maurer and Stefan Wolf
IEEE International Symposium on Information Theory — ISIT '97, IEEE, pp. 88, Jun 1997.

### Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion

Ueli Maurer
Advances in Cryptology — EUROCRYPT '97, Lecture Notes in Computer Science, Springer-Verlag, vol. 1233, pp. 209–225, May 1997.

### Linking Information Reconciliation and Privacy Amplification

Christian Cachin and Ueli Maurer
Journal of Cryptology, vol. 10, no. 2, pp. 97–110, Mar 1997, Preliminary version: [CacMau94].

### Digital Payment Systems with Passive Anonymity-Revoking Trustees

Jan Camenisch, Ueli Maurer, and Markus Stadler
Journal of Computer Security, vol. 5, no. 1, pp. 69–89, 1997, Preliminary version: [CaMaSt96].

### The Generic Complexity of Index-Search Problems and Applications to Cryptography

Ueli Maurer and Stefan Wolf
1997, Manuscript.

### A Non-interactive Public-Key Distribution System

Ueli Maurer and Yacov Yacobi
Designs, Codes and Cryptography, vol. 9, no. 3, pp. 305–316, Nov 1996, Preliminary version: [MauYac91].

### On the Efficiency of One-time Digital Signatures

Daniel Bleichenbacher and Ueli Maurer
Advances in Cryptology — ASIACRYPT '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1163, pp. 196–209, Nov 1996.

### Towards Characterizing when Information-Theoretic Key Agreement Is Possible

Ueli Maurer and Stefan Wolf
Advances in Cryptology — ASIACRYPT '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1163, pp. 196–209, Nov 1996.

### Digital Payment Systems with Passive Anonymity-Revoking Trustees

Jan Camenisch, Ueli Maurer, and Markus Stadler
European Symposium on Research in Computer Security — ESORICS '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1146, pp. 33–43, Sep 1996, Final version: [CaMaSt97].

### Modelling a Public-Key Infrastructure

Ueli Maurer
European Symposium on Research in Computer Security — ESORICS '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1146, pp. 325–350, Sep 1996.

### Diffie-Hellman Oracles

Ueli Maurer and Stefan Wolf
Advances in Cryptology — CRYPTO '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1109, pp. 268–282, Aug 1996.

### On the Complexity of Breaking the Diffie-Hellman Protocol

Ueli Maurer and Stefan Wolf
Technical Report, no. 244, Institute for Theoretical Computer Science, ETH Zurich, Apr 1996.

### A Unified and Generalized Treatment of Authentication Theory

Ueli Maurer
Proc. 13th Symposium on Theoretical Aspects of Computer Science — STACS '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1046, pp. 387–398, Feb 1996, Final version: [Maurer00a].

### Optimal Tree-based One-time Digital Signature Schemes

Daniel Bleichenbacher and Ueli Maurer
Proc. 13th Symposium on Theoretical Aspects of Computer Science — STACS '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1046, pp. 363–374, Feb 1996.

### A Calculus for Security Bootstrapping in Distributed Systems

Ueli Maurer and Pierre Schmid
Journal of Computer Security, vol. 4, no. 1, pp. 55–80, 1996, Preliminary version: [MauSch94].

### On the Oracle Complexity of Factoring Integers

Ueli Maurer
Computational Complexity, vol. 5, no. 4, pp. 237–247, 1996, Preliminary version: [Maurer92f].

### Generalized Privacy Amplification

Charles H. Bennett, Gilles Brassard, Claude Crépeau, and Ueli Maurer
IEEE Transactions on Information Theory, vol. 41, no. 6, pp. 1915–1923, Nov 1995, Preliminary version: [BBCM94].

### New Information-Theoretic Bounds in Authentication Theory

Ueli Maurer
IEEE International Symposium on Information Theory — ISIT '95, IEEE, pp. 12, Sep 1995.

### Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters

Ueli Maurer
Journal of Cryptology, vol. 8, no. 3, pp. 123–155, 1995, Preliminary version: [Maurer89].

### Kryptologie: eine neuartige Anwendung der Mathematik

Ueli Maurer
Elemente der Mathematik, Birkhäuser Verlag, vol. 50, no. 3, pp. 89–106, 1995.

### A Calculus for Secure Channel Establishment in Open Networks

Ueli Maurer and Pierre Schmid
European Symposium on Research in Computer Security — ESORICS '94, Lecture Notes in Computer Science, Springer-Verlag, vol. 875, pp. 175–192, Nov 1994, Final version: [MauSch96].

### Directed Acyclic Graphs, One-way Functions and Digital Signatures

Daniel Bleichenbacher and Ueli Maurer
Advances in Cryptology — CRYPTO '94, Lecture Notes in Computer Science, Springer-Verlag, vol. 963, pp. 75–82, Aug 1994.

### Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms

Ueli Maurer
Advances in Cryptology — CRYPTO '94, Lecture Notes in Computer Science, Springer-Verlag, vol. 839, pp. 271–281, Aug 1994.

### Generalized Privacy Amplification

Charles H. Bennett, Gilles Brassard, Claude Crépeau, and Ueli Maurer
IEEE International Symposium on Information Theory — ISIT '94, IEEE, pp. 350, Jun 1994, Final version: [BBCM95].

### On the Secret-Key Rate of Binary Random Variables

Martin Gander and Ueli Maurer
IEEE International Symposium on Information Theory — ISIT '94, IEEE, pp. 351, Jun 1994.

### Linking Information Reconciliation and Privacy Amplification

Christian Cachin and Ueli Maurer
Advances in Cryptology — EUROCRYPT '94, Lecture Notes in Computer Science, Springer-Verlag, vol. 950, pp. 266–274, May 1994, Final version: [CacMau97].

### The Strong Secret Key Rate of Discrete Random Triples

Ueli Maurer
Communication and Cryptography — Two Sides of One Tapestry, Kluwer Academic Publishers, pp. 271–285, 1994.

### The Role of Information Theory in Cryptography

Ueli Maurer
Cryptography and Coding '93, The Institute of Mathematics and its Applications, Southend-on-Sea, England, pp. 49–71, Dec 1993.

### Protocols for Secret Key Agreement by Public Discussion Based on Common Information

Ueli Maurer
Advances in Cryptology — CRYPTO '92, Lecture Notes in Computer Science, Springer-Verlag, vol. 740, pp. 461–470, Aug 1993, Final version: [Maurer93a].

### Secret Key Agreement by Public Discussion

Ueli Maurer
IEEE Transactions on Information Theory, vol. 39, no. 3, pp. 733–742, May 1993, Preliminary version: [Maurer92g].

### Cascade Ciphers: The Importance of Being First

Ueli Maurer and James L. Massey
Journal of Cryptology, vol. 6, no. 1, pp. 55–61, 1993, Preliminary version: [MauMas90b].

### Asymptotically-Tight Bounds on the Number of Cycles in Generalized de Bruijn-Good Graphs

Ueli Maurer
Discrete Applied Mathematics, vol. 37, pp. 421–436, Jul 1992.

### A Remark on a Non-Interactive Public-Key Distribution System

Ueli Maurer and Yacov Yacobi
Advances in Cryptology — EUROCRYPT '92, Lecture Notes in Computer Science, Springer-Verlag, vol. 658, pp. 458–460, May 1992, This is a note on [MauYac91]. See [MauYac96] for the final version.

### A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generators

Ueli Maurer
Advances in Cryptology — EUROCRYPT '92, Lecture Notes in Computer Science, Springer-Verlag, vol. 658, pp. 239–255, May 1992.

### Factoring with an Oracle

Ueli Maurer
Advances in Cryptology — EUROCRYPT '92, Lecture Notes in Computer Science, Springer-Verlag, vol. 658, pp. 429–436, May 1992, Final version: [Maurer96].

### Some Number-theoretic Conjectures and Their Relation to the Generation of Cryptographic Primes

Ueli Maurer
Cryptography and Coding '92, Oxford University Press, pp. 173–191, Mar 1992.

### A Universal Statistical Test for Random Bit Generators

Ueli Maurer
Journal of Cryptology, vol. 5, no. 2, pp. 89–105, 1992, Preliminary version: [Maurer90b].

### Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher

Ueli Maurer
Journal of Cryptology, vol. 5, no. 1, pp. 53–66, 1992, Preliminary version: [Maurer90a].

### New Public-Key Schemes Based on Elliptic Curves over the Ring ${Z}_n$

Kenji Koyama, Ueli Maurer, Tatsuaki Okamoto, and Scott Vanstone
Advances in Cryptology — CRYPTO '91, Lecture Notes in Computer Science, Springer-Verlag, vol. 576, pp. 252–266, Aug 1991.

### Perfect Cryptographic Security from Partially Independent Channels

Ueli Maurer
Proc. 23rd ACM Symposium on Theory of Computing — STOC '91, ACM, pp. 561–572, Aug 1991.

### New Approaches to the Design of Self-Synchronizing Stream Ciphers

Ueli Maurer
Advances in Cryptology — EUROCRYPT '91, Lecture Notes in Computer Science, Springer-Verlag, vol. 547, pp. 458–471, May 1991.

### Non-Interactive Public-key Cryptography

Ueli Maurer and Yacov Yacobi
Advances in Cryptology — EUROCRYPT '91, Lecture Notes in Computer Science, Springer-Verlag, vol. 547, pp. 498–507, Apr 1991, Final version: [MauYac96], see also the note in [MauYac92].

### Local Randomness in Pseudo-Random Sequences

Ueli Maurer and James L. Massey
Journal of Cryptology, vol. 4, no. 2, pp. 135–149, 1991, Preliminary version: [MauMas89].

### A Universal Statistical Test for Random Bit Generators

Ueli Maurer
Advances in Cryptology — CRYPTO '90, Lecture Notes in Computer Science, Springer-Verlag, vol. 537, pp. 409–420, Aug 1990, Final version: [Maurer92a].

### A Provably-Secure Strongly-Randomized Cipher

Ueli Maurer
Advances in Cryptology — EUROCRYPT '90, Lecture Notes in Computer Science, Springer-Verlag, vol. 473, pp. 361–373, May 1990, Final version: [Maurer92b].

### Cascade Ciphers: The Importance of Being First

Ueli Maurer and James L. Massey
IEEE International Symposium on Information Theory — ISIT '90, IEEE, pp. 118, Jan 1990, Final version: [MauMas93a].

### Perfect Local Randomness in Pseudo-Random Sequences

Ueli Maurer and James L. Massey
Advances in Cryptology — CRYPTO '89, Lecture Notes in Computer Science, Springer-Verlag, vol. 435, pp. 100–112, Aug 1989, Final version: [MauMas91a].

### Fast Generation of RSA-Moduli with Almost Maximal Diversity

Ueli Maurer
Advances in Cryptology — EUROCRYPT '89, Lecture Notes in Computer Science, Springer-Verlag, vol. 434, pp. 636–647, Apr 1989, Final version: [Maurer95a].

### Non-Expanding, Key-Minimal, Robustly-Perfect, Linear and Bilinear Ciphers

James L. Massey, Ueli Maurer, and Muzhong Wang
Advances in Cryptology — EUROCRYPT '87, Lecture Notes in Computer Science, Springer-Verlag, vol. 304, pp. 237–247, Apr 1987.