- Towards a Theory of Consistency Primitives Extended Abstract
- ISIT 2002, Lausanne, Switzerland, June 30 { July 5, 2002 Generalized Indistinguishability
- Innovations in Computer Science 2011 Abstract Cryptography
- Confidence Valuation in a PublicKey Infrastructure based on Uncertain Evidence
- On the Efficiency of Onetime Digital Signatures Daniel Bleichenbacher 1 and Ueli Maurer 2
- To appear in Proc. of 1994 European Symposium on Research in Computer Security (ESORICS' 94), Brighton, England, Nov. 79, 1994.
- On the Complexity of Breaking the DiffieHellman Protocol
- Complete Classification of Bilinear Hard-Core Functions
- On Generating the Initial Key in the Bounded-Storage Model
- The Security of Many-Round Luby-Racko Pseudo-Random Permutations
- The Generic Complexity of IndexSearch Problems and Applications to Cryptography \Lambda
- Towards the Equivalence of Breaking the DiffieHellman Protocol and Computing
- Optimal Treebased Onetime Digital Signature Schemes Daniel Bleichenbacher and Ueli M. Maurer
- Appeared in Journal of Cryptology, vol. 6, no. 1, pp. 5561, 1993. Cascade Ciphers: The Importance of Being First 1
- Unbreakable Keys from Random Noise Ueli Maurer, Renato Renner, and Stefan Wolf
- Smoothing Probability Distributions and Smooth Entropy
- To appear in Journal of Computer Security, 1996. A Calculus for Security Bootstrapping
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 39, NO. 3, MAY 1993 733 Secret Key Agreement by Public Discussion
- Reasoning About Public-Key Certification: On Bindings Between Entities and Public Keys
- Breaking RSA Generically is Equivalent to Divesh Aggarwal and Ueli Maurer
- Luby-Rackoff Ciphers from Weak Round Functions?
- Efficient Proofs Of Knowledge of Discrete Logarithms and Representations in Groups with
- Intrinsic Limitations of Digital Signatures and How to Cope With Them #
- Lower Bounds on Generic Algorithms in Groups ? Ueli Maurer Stefan Wolf
- Random Systems: Theory and Applications Ueli Maurer
- Abstraction in Cryptography Ueli Maurer
- Ecient Proofs Of Knowledge of Discrete Logarithms and Representations in Groups with
- ISIT 1997, Ulm, Germany, June 29 --July 4 The Intrinsic Conditional Mutual Information and Perfect Secrecy
- A Noninteractive PublicKey Distribution Ueli M. Maurer
- Constructive Cryptography A Primer Ueli Maurer
- Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric
- Domain Expansion MACs: Alternative Uses of the FILMAC
- Reasoning About PublicKey Certification: On Bindings Between Entities and Public Keys ?
- Abstraction in Cryptography Ueli Maurer
- Realistic Failures in Secure MultiParty Computation # Vassilis Zikas 1 , Sarah Hauser 2 , and Ueli Maurer 1
- SecretKey Agreement over Unauthenticated Public Channels --
- Some Numbertheoretic Conjectures and Their Relation to the Generation of
- InformationTheoretically Secure SecretKey Agreement by NOT Authenticated
- Abstract Models of Computation in Cryptography
- Indistinguishability of Random Systems Ueli Maurer
- HybridSecure MPC: Trading InformationTheoretic Robustness for Computational Privacy
- Generalized Privacy Amplification \Lambda Charles H. Bennett
- From Partial Consistency to Global Broadcast \Lambda Matthias Fitzi Ueli Maurer
- Unifying Zero-Knowledge Proofs of Knowledge Ueli Maurer
- ISIT 2002, Lausanne, Switzerland, June 30 { July 5, 2002 About the Mutual (Conditional) Information
- Erschien in Elemente der Mathematik, Birkh auser, Vol. 50, No. 3, pp. 89106, 1995. Kryptologie: eine neuartige Anwendung
- Secret-Key Agreement over Unauthenticated Public Channels
- The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key
- Realistic Failures in Secure Multi-Party Computation Vassilis Zikas1
- Free-Start Distinguishing: Combining Two Types of Indistinguishability Amplification
- Singlekey AILMACs from any FILMAC # Ueli Maurer and Johan Sjodin ##
- Cryptography 2000 \Sigma 10 ? Ueli Maurer
- Appeared in Journal of Cryptology, vol. 5, no. 2, 1992, pp. 89105. A Universal Statistical Test for
- To appear in Proc. of 4th IMA Conference on Cryptography and Coding, Cirencester, England, Dec. 1315, 1993 (invited paper).
- Perfect Cryptographic Security from Partially Independent Channels \Lambda
- General Secure MultiParty Computation from any Linear SecretSharing Scheme
- Unconditional Byzantine Agreement and Multi-Party Computation Secure Against
- Appeared in Communication and Cryptography --Two Sides of One Tapestry, (R. Blahut et al., Eds.), Kluwer Academic Publishers, pp. 271285, 1994.
- InformationTheoretic Bounds in Authentication Theory 1 Ueli M. Maurer
- Privacy Amplification Secure Against an Adversary with Selectable Knowledge 1
- The DiffieHellman Protocol \Lambda Ueli M. Maurer Stefan Wolf
- SecretKey Agreement over Unauthenticated Public Channels --
- Complete Classification of Bilinear HardCore Functions
- Privacy Amplification Secure Against Active Adversaries ?
- Appeared in Advances in Cryptology -EUROCRYPT '92, Lecture Notes in Com-puter Science, Berlin: Springer-Verlag, vol. 658, pp. 239-255, 1992.
- Composition of Random Systems: When Two Weak Make One Strong
- Indistinguishability of Random Systems Ueli Maurer ?
- Indi erentiability, Impossibility Results on Reductions, and Applications to the Random
- Appeared in Journal of Cryptology, vol. 4, No. 2, pp. 135149, 1991. Local Randomness in Pseudorandom Sequences 1
- Secure MultiParty Computation Made Simple Ueli Maurer ?
- Single-key AIL-MACs from any FIL-MAC Ueli Maurer and Johan Sjodin
- About the mutual (conditional) information Renato Renner Ueli Maurer
- ISIT 1998, Cambridge, MA, USA, August 16 --August 21 DiffieHellman, Decision DiffieHellman, and Discrete Logarithms
- Presented at 1994 IEEE International Symposium on Information Theory, Trondheim, Nor way, June 27 July 1, 1994.
- To appear in Journal of Cryptology. Fast Generation of Prime Numbers and Secure
- Efficient Byzantine Agreement Secure Against General Adversaries ?
- On the Hardness of the DiffieHellman Decision Problem
- (Preprint of a Paper to appear in the Proceedings of EUROCRYPT 87, in Advances in Cryptol ogy, Lecture Notes in Computer Science, published by SpringerVerlag.)
- Tight Security Proofs for the BoundedStorage Model Stefan Dziembowski y
- InformationTheoretic Cryptography (Extended Abstract)
- InformationTheoretic Key Agreement: From Weak to Strong Secrecy for Free
- The Relationship Between Breaking the DiffieHellman Protocol and Computing
- Appeared in Journal of Cryptology, vol. 5, no. 1, pp. 5366, 1992. ConditionallyPerfect Secrecy and
- Directed Acyclic Graphs, Oneway Functions and Digital Signatures
- To appear in Journal of Computer Security, IOS Press. Digital Payment Systems with Passive Anonymity
- This paper appeared in IEEE Transactions on Information Theory, Vol. 39, pp. 733742, Secret Key Agreement by Public Discussion
- Authentication Theory and Hypothesis Ueli M. Maurer, Senior Member, IEEE
- Towards Characterizing when InformationTheoretic Secret Key Agreement is
- Cascade Encryption Revisited Peter Gazi1,2
- A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
- Appeared in Proc. 13th Symp. on Theoretical Aspects of Computer Science STACS'96, Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 1046, pp. 387-398, 1996.
- New PublicKey Schemes Based on Elliptic Curves over the Ring Z n
- DiffieHellman Oracles Ueli M. Maurer and Stefan Wolf
- ISIT2000, Sorrento, Italy, June 25--30, 2000 From Weak to Strong InformationTheoretic Key Agreement
- Minimal Complete Primitives for Secure Multi-Party Computation
- ON THE ORACLE COMPLEXITY OF FACTORING INTEGERS
- ISIT 2002, Lausanne, Switzerland, June 30 July 5, 2002 Generalized Indistinguishability
- Byzantine Agreement Secure Against General Adversaries in the Dual Failure Model ?
- LubyRacko# Ciphers from Weak Round Functions?
- SecretKey Agreement over Unauthenticated Public Channels --
- Optimal Randomizer Efficiency in the BoundedStorage Stefan Dziembowski ??
- TRANSACTIONS INFORMATION THEORY, 45, MARCH 1999
- Appeared in Proc. 13th Symp. on Theoretical Aspects of Computer Science (STACS'96), Lecture Notes in Computer Science, Berlin: SpringerVerlag, vol. 1046, pp. 387398, 1996.
- Modelling a PublicKey Infrastructure 1 Ueli Maurer 2
- Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations ?
- Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks
- Unconditional Byzantine Agreement and Multi-Party Computation Secure Against
- Appeared in the proceedings of EUROCRYPT '91, Brighton, England, April 8-11, 1991. New Approaches to the Design
- Reasoning About PublicKey Certification: On Bindings Between Entities and Public Keys
- Secret-Key Agreement over Unauthenticated Public Channels
- Secure Multi-Party Computation Made Simple ? Ueli Maurer ??
- ISIT2000, Sorrento, Italy, June 25--30, 2000 Global Broadcast by Broadcasts Among Subsets of Players
- Random Systems: Theory and Applications Ueli Maurer
- ISIT2000, Sorrento, Italy, June 2530, 2000 Global Broadcast by Broadcasts Among Subsets of Players
- Abstract Storage Devices Robert Konig1,
- Reasoning About Public-Key Certification: On Bindings Between Entities and Public Keys
- The Leakage-Resilience Limit of a Computational Problem Is Equal to Its
- Constructive Cryptography A New Paradigm for Security Definitions and Proofs
- Confidentiality and Integrity: A Constructive Perspective
