Ueli Maurer

Affiliations:
  • ETH Zurich, Switzerland


According to our database1, Ueli Maurer authored at least 203 papers between 1987 and 2021.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 2015, "For contributions to cryptography and information security.".

IEEE Fellow

IEEE Fellow 2003, "For contributions to the theory and practice of cryptography.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Giving an Adversary Guarantees (Or: How to Model Designated Verifier Signatures in a Composable Framework).
IACR Cryptol. ePrint Arch., 2021

Direct Product Hardness Amplification.
IACR Cryptol. ePrint Arch., 2021

Adaptive Security of Multi-Party Protocols, Revisited.
IACR Cryptol. ePrint Arch., 2021

Effects of Quantization on the Multiple-Round Secret-Key Capacity.
IACR Cryptol. ePrint Arch., 2021

A Fresh Approach to Updatable Symmetric Encryption.
IACR Cryptol. ePrint Arch., 2021

Abstract Modeling of System Communication in Constructive Cryptography using CryptHOL.
Proceedings of the 34th IEEE Computer Security Foundations Symposium, 2021

2020
Non-malleable Encryption: Simpler, Shorter, Stronger.
J. Cryptol., 2020

Unifying Generic Group Models.
IACR Cryptol. ePrint Arch., 2020

On Broadcast in Generalized Network and Adversarial Models.
IACR Cryptol. ePrint Arch., 2020

Synchronous Constructive Cryptography.
IACR Cryptol. ePrint Arch., 2020

Coupling of Random Systems.
IACR Cryptol. ePrint Arch., 2020

Overcoming Impossibility Results in Composable Security using Interval-Wise Guarantees.
IACR Cryptol. ePrint Arch., 2020

Anonymous Symmetric-Key Communication.
IACR Cryptol. ePrint Arch., 2020

Revisiting (R)CCA Security and Replay Protection.
IACR Cryptol. ePrint Arch., 2020

MPC with Synchronous Security and Asynchronous Responsiveness.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019
Robust MPC: Asynchronous Responsiveness yet Synchronous Security.
IACR Cryptol. ePrint Arch., 2019

Topology-Hiding Computation for Networks with Unknown Delays.
IACR Cryptol. ePrint Arch., 2019

A Unified and Composable Take on Ratcheting.
IACR Cryptol. ePrint Arch., 2019

Composable and Finite Computational Security of Quantum Message Transmission.
IACR Cryptol. ePrint Arch., 2019

Agree-and-Prove: Generalized Proofs Of Knowledge and Applications.
IACR Cryptol. ePrint Arch., 2019

Brief Announcement: Towards Byzantine Broadcast in Generalized Communication and Adversarial Models.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Formalizing Constructive Cryptography using CryptHOL.
Proceedings of the 32nd IEEE Computer Security Foundations Symposium, 2019

2018
Toward an algebraic theory of systems.
Theor. Comput. Sci., 2018

Topology-Hiding Computation Beyond Semi-Honest Adversaries.
IACR Cryptol. ePrint Arch., 2018

Efficient Ratcheting: Almost-Optimal Guarantees for Secure Messaging.
IACR Cryptol. ePrint Arch., 2018

On Composable Security for Digital Signatures.
IACR Cryptol. ePrint Arch., 2018

But Why does it Work? A Rational Protocol Design Treatment of Bitcoin.
IACR Cryptol. ePrint Arch., 2018

A Constructive Perspective on Signcryption Security.
IACR Cryptol. ePrint Arch., 2018

Strong Separations Between Broadcast and Authenticated Channels.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Security Definitions for Hash Functions: Combining UCE and Indifferentiability.
Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

2017
Causal Boxes: Quantum Information-Processing Systems Closed Under Composition.
IEEE Trans. Inf. Theory, 2017

Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio.
IACR Cryptol. ePrint Arch., 2017

Context-Restricted Indifferentiability: Generalizing UCE and Implications on the Soundness of Hash-Function Constructions.
IACR Cryptol. ePrint Arch., 2017

Bitcoin as a Transaction Ledger: A Composable Treatment.
IACR Cryptol. ePrint Arch., 2017

Composable and Robust Outsourced Storage.
IACR Cryptol. ePrint Arch., 2017

Strengthening Access Control Encryption.
IACR Cryptol. ePrint Arch., 2017

Witness-hiding proofs of knowledge for cable locks.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

An information-theoretic approach to hardness amplification.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Efficiency lower bounds for commit-and-prove constructions.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Breaking RSA Generically Is Equivalent to Factoring.
IEEE Trans. Inf. Theory, 2016

From Indifferentiability to Constructive Cryptography (and Back).
IACR Cryptol. ePrint Arch., 2016

Network-Hiding Communication and Applications to Multi-Party Protocols.
IACR Cryptol. ePrint Arch., 2016

Per-Session Security: Password-Based Cryptography Revisited.
IACR Cryptol. ePrint Arch., 2016

Memory Erasability Amplification.
IACR Cryptol. ePrint Arch., 2016

On the impossibility of information-theoretic composable coin toss extension.
Proceedings of the IEEE International Symposium on Information Theory, 2016

New perspectives on weak Oblivious Transfer.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Hierarchy of three-party consistency specifications.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Cryptography and Computation after Turing.
Proceedings of the Once and Future Turing: Computing the World, 2016

2015
Idealizing Identity-Based Encryption.
IACR Cryptol. ePrint Arch., 2015

Query-Complexity Amplification for Random Oracles.
IACR Cryptol. ePrint Arch., 2015

Robust Authenticated Encryption and the Limits of Symmetric Cryptography.
IACR Cryptol. ePrint Arch., 2015

Augmented Secure Channels and the Goal of the TLS 1.3 Record Layer.
IACR Cryptol. ePrint Arch., 2015

Zero-knowledge proofs of knowledge for group homomorphisms.
Des. Codes Cryptogr., 2015

(De-)Constructing TLS 1.3.
Proceedings of the Progress in Cryptology - INDOCRYPT 2015, 2015

A Definitional Framework for Functional Encryption.
Proceedings of the IEEE 28th Computer Security Foundations Symposium, 2015

2014
(De-)Constructing TLS.
IACR Cryptol. ePrint Arch., 2014

Optimality of Non-Adaptive Strategies: The Case of Parallel Games.
IACR Cryptol. ePrint Arch., 2014

From Single-Bit to Multi-Bit Public-Key Encryption via Non-Malleable Codes.
IACR Cryptol. ePrint Arch., 2014

Key-Indistinguishable Message Authentication Codes.
IACR Cryptol. ePrint Arch., 2014

Anonymous Authentication with Shared Secrets.
IACR Cryptol. ePrint Arch., 2014

2013
Information-Theoretic Secure Multiparty Computation.
Proceedings of the Secure Multi-Party Computation, 2013

Key Exchange with Unilateral Authentication: Composable Security Definition and Modular Protocol Design.
IACR Cryptol. ePrint Arch., 2013

A Constructive Approach to Functional Encryption.
IACR Cryptol. ePrint Arch., 2013

Anonymity-preserving Public-Key Encryption: A Constructive Approach.
IACR Cryptol. ePrint Arch., 2013

Broadcast Amplification.
IACR Cryptol. ePrint Arch., 2013

A Dynamic Tradeoff Between Active and Passive Corruptions in Secure Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2013

Rational Protocol Design: Cryptography Against Incentive-driven Adversaries.
IACR Cryptol. ePrint Arch., 2013

Constructing Confidential Channels from Authenticated Channels - Public-Key Encryption Revisited.
IACR Cryptol. ePrint Arch., 2013

Conditional equivalence of random systems and indistinguishability proofs.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Authentication amplification by synchronization.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

The one-time pad revisited.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Unfair coin tossing.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Erratum: A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

A Constructive Perspective on Key Encapsulation.
Proceedings of the Number Theory and Cryptography, 2013

2012
Passive Corruption in Statistical Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2012

Resource-Restricted Indifferentiability.
IACR Cryptol. ePrint Arch., 2012

Confidentiality and Integrity: A Constructive Perspective.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

UOWHFs from OWFs: Trading Regularity for Efficiency.
Proceedings of the Progress in Cryptology - LATINCRYPT 2012, 2012

Common randomness amplification: A constructive view.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Synchrony amplification.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Passive Corruption in Statistical Multi-Party Computation - (Extended Abstract).
Proceedings of the Information Theoretic Security - 6th International Conference, 2012

2011
Universally Composable Synchronous Computation.
IACR Cryptol. ePrint Arch., 2011

Graceful Degradation in Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2011

Collusion-Preserving Computation.
IACR Cryptol. ePrint Arch., 2011

Public-Key Cryptography (Dagstuhl Seminar 11391).
Dagstuhl Reports, 2011

Constructive Cryptography - A New Paradigm for Security Definitions and Proofs.
Proceedings of the Theory of Security and Applications - Joint Workshop, 2011

Abstract Cryptography.
Proceedings of the Innovations in Computer Science, 2011

Graceful Degradation in Multi-Party Computation (Extended Abstract).
Proceedings of the Information Theoretic Security - 5th International Conference, 2011

Privacy-preserving outsourcing of brute-force key searches.
Proceedings of the 3rd ACM Cloud Computing Security Workshop, 2011

The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy.
Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2010
A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Constructive Cryptography - A Primer.
Proceedings of the Financial Cryptography and Data Security, 14th International Conference, 2010

On the soundness of authenticate-then-encrypt: formalizing the malleability of symmetric encryption.
Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010

2009
Computational Indistinguishability Amplification: Tight Product Theorems for System Composition.
IACR Cryptol. ePrint Arch., 2009

Hybrid-Secure MPC: Trading Information-Theoretic Robustness for Computational Privacy.
IACR Cryptol. ePrint Arch., 2009

Cascade Encryption Revisited.
IACR Cryptol. ePrint Arch., 2009

Realistic Failures in Secure Multi-party Computation.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Abstract Storage Devices.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Free-Start Distinguishing: Combining Two Types of Indistinguishability Amplification.
Proceedings of the Information Theoretic Security, 4th International Conference, 2009

Abstraction in Cryptography.
Proceedings of the Advances in Cryptology, 2009

Unifying Zero-Knowledge Proofs of Knowledge.
Proceedings of the Progress in Cryptology, 2009

2008
Introduction to the Special Issue on Information Theoretic Security.
IEEE Trans. Inf. Theory, 2008

The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement.
IEEE Trans. Inf. Theory, 2008

Rethinking Digital Signatures.
Proceedings of the SECRYPT 2008, 2008

Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography.
Proceedings of the Advances in Cryptology, 2008

MPC vs. SFE : Unconditional and Computational Security.
Proceedings of the Advances in Cryptology, 2008

2007
Domain Extension of Public Random Functions: Beyond the Birthday Barrier.
IACR Cryptol. ePrint Arch., 2007

Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations.
IACR Cryptol. ePrint Arch., 2007

MPC vs. SFE: Perfect Security in a Unified Corruption Model.
IACR Cryptol. ePrint Arch., 2007

Random Systems: Theory and Applications.
Proceedings of the Information Theoretic Security - Second International Conference, 2007

07381 Abstracts Collection -- Cryptography.
Proceedings of the Cryptography, 16.09. - 21.09.2007, 2007

07381 Executive Summary - Cryptography.
Proceedings of the Cryptography, 16.09. - 21.09.2007, 2007

2006
A Fast and Key-Efficient Reduction of Chosen- Ciphertext to Known-Plaintext Security.
IACR Cryptol. ePrint Arch., 2006

Indistinguishability Amplification.
IACR Cryptol. ePrint Arch., 2006

Luby-Rackoff Ciphers from Weak Round Functions?
IACR Cryptol. ePrint Arch., 2006

Secure multi-party computation made simple.
Discret. Appl. Math., 2006

2005
On the power of quantum memory.
IEEE Trans. Inf. Theory, 2005

Minimal Complete Primitives for Secure Multi-Party Computation.
J. Cryptol., 2005

Byzantine Agreement Given Partial Broadcast.
J. Cryptol., 2005

Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order.
Proceedings of the Public Key Cryptography, 2005

Domain Expansion of MACs: Alternative Uses of the FIL-MAC.
Proceedings of the Cryptography and Coding, 2005

Abstract Models of Computation in Cryptography.
Proceedings of the Cryptography and Coding, 2005

Generalized Strong Extractors and Deterministic Privacy Amplification.
Proceedings of the Cryptography and Coding, 2005

Single-Key AIL-MACs from Any FIL-MAC.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004
New Approaches to Digital Evidence.
Proc. IEEE, 2004

Optimal Randomizer Efficiency in the Bounded-Storage Model.
J. Cryptol., 2004

Towards a Theory of Consistency Primitives.
Proceedings of the Distributed Computing, 18th International Conference, 2004

Composition of Random Systems: When Two Weak Make One Strong.
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

The Role of Cryptography in Database Security.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2004

Privacy amplification secure against an adversary with selectable knowledge.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Extracting randomness from generalized symbol-fixing and Markov sources.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

On Generating the Initial Key in the Bounded-Storage Model.
Proceedings of the Advances in Cryptology, 2004

Complete Classification of Bilinear Hard-Core Functions.
Proceedings of the Advances in Cryptology, 2004

2003
Secret-key agreement over unauthenticated public channels III: Privacy amplification.
IEEE Trans. Inf. Theory, 2003

Secret-key agreement over unauthenticated public channels II: the simulatability condition.
IEEE Trans. Inf. Theory, 2003

Secret-key agreement over unauthenticated public channels I: Definitions and a completeness result.
IEEE Trans. Inf. Theory, 2003

Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology.
IACR Cryptol. ePrint Arch., 2003

Intrinsic Limitations of Digital Signatures and How to Cope with Them.
Proceedings of the Information Security, 6th International Conference, 2003

The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations.
Proceedings of the Advances in Cryptology, 2003

2002
Tight security proofs for the bounded-storage model.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Indistinguishability of Random Systems.
Proceedings of the Advances in Cryptology - EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28, 2002

Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch.
Proceedings of the Advances in Cryptology - EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28, 2002

Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks.
Proceedings of the Advances in Cryptology, 2002

2001
Robustness for Free in Unconditional Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2001

Cryptography 2000±10.
Proceedings of the Informatics - 10 Years Back. 10 Years Ahead., 2001

2000
Authentication theory and hypothesis testing.
IEEE Trans. Inf. Theory, 2000

Reasoning about public-key certification: on bindings between entities and public keys.
IEEE J. Sel. Areas Commun., 2000

Player Simulation and General Adversary Structures in Perfect Multiparty Computation.
J. Cryptol., 2000

General Secure Multi-Party Computation from any Linear Secret Sharing Scheme.
IACR Cryptol. ePrint Arch., 2000

The Diffie-Hellman Protocol.
Des. Codes Cryptogr., 2000

From partial consistency to global broadcast.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Confidence Valuation in a Public-Key Infrastructure Based on Uncertain Evidence.
Proceedings of the Public Key Cryptography, 2000

Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free.
Proceedings of the Advances in Cryptology, 2000

Efficient Secure Multi-party Computation.
Proceedings of the Advances in Cryptology, 2000

1999
Unconditionally Secure Key Agreement and the Intrinsic Conditional Information.
IEEE Trans. Inf. Theory, 1999

The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms.
SIAM J. Comput., 1999

Byzantine Agreement Secure against General Adversaries in the Dual Failure Model.
Proceedings of the Distributed Computing, 1999

Kryptographie: Basistechnologie der Informationsgesellschaft (Zusammenfassung).
Proceedings of the Informatik '99, 1999

Information-Theoretic Cryptography.
Proceedings of the Advances in Cryptology, 1999

General Adversaries in Unconditional Multi-party Computation.
Proceedings of the Advances in Cryptology, 1999

1998
Efficient Byzantine Agreement Secure Against General Adversaries.
Proceedings of the Distributed Computing, 12th International Symposium, 1998

Lower Bounds on Generic Algorithms in Groups.
Proceedings of the Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998

Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract).
Proceedings of the Advances in Cryptology, 1998

1997
Linking Information Reconciliation and Privacy Amplification.
J. Cryptol., 1997

Digital Payment Systems With Passive Anonymity-Revoking Trustees.
J. Comput. Secur., 1997

Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation (Extended Abstract).
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion.
Proceedings of the Advances in Cryptology, 1997

Privacy Amplification Secure Against Active Adversaries.
Proceedings of the Advances in Cryptology, 1997

Unconditional Security Against Memory-Bounded Adversaries.
Proceedings of the Advances in Cryptology, 1997

1996
A Calculus for Security Bootstrapping in Distributed Systems.
J. Comput. Secur., 1996

A Non-interactive Public-Key Distribution System.
Des. Codes Cryptogr., 1996

A Unified and Generalized Treatment of Authentification Theory.
Proceedings of the STACS 96, 1996

Optimal Tree-Based One-Time Digital Signature Schemes.
Proceedings of the STACS 96, 1996

Modelling a Public-Key Infrastructure.
Proceedings of the Computer Security, 1996

Diffie-Hellman Oracles.
Proceedings of the Advances in Cryptology, 1996

Towards Characterizing When Information-Theoretic Secret Key Agreement Is Possible.
Proceedings of the Advances in Cryptology, 1996

On the Efficiency of One-Time Digital Signatures.
Proceedings of the Advances in Cryptology, 1996

1995
Generalized privacy amplification.
IEEE Trans. Inf. Theory, 1995

Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters.
J. Cryptol., 1995

On the Oracle Complexity of Factoring Integers.
Comput. Complex., 1995

1994
Linking Information Reconciliation and Privacy Amplification (Extended Abstract).
Proceedings of the Advances in Cryptology, 1994

A Calculus for Secure Channel Establishment in Open Networks.
Proceedings of the Computer Security, 1994

Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms
Proceedings of the Advances in Cryptology, 1994

Directed Acyclic Graphs, One-way Functions and Digital Signatures.
Proceedings of the Advances in Cryptology, 1994

1993
Secret key agreement by public discussion from common information.
IEEE Trans. Inf. Theory, 1993

Cascade Ciphers: The Importance of Being First.
J. Cryptol., 1993

1992
A Universal Statistical Test for Random Bit Generators.
J. Cryptol., 1992

Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher.
J. Cryptol., 1992

Asymptotically-Tight Bounds on the Number of Cycles in Generalized de Bruijn-Good Graphs.
Discret. Appl. Math., 1992

A Remark on a Non-interactive Public-Key Distribution System.
Proceedings of the Advances in Cryptology, 1992

Factoring with an Oracle.
Proceedings of the Advances in Cryptology, 1992

A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generator.
Proceedings of the Advances in Cryptology, 1992

Protocols for Secret Key Agreement by Public Discussion Based on Common Information.
Proceedings of the Advances in Cryptology, 1992

1991
Local Randomness in Pseudorandom Sequences.
J. Cryptol., 1991

Perfect Cryptographic Security from Partially Independent Channels
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Non-interactive Public-Key Cryptography.
Proceedings of the Advances in Cryptology, 1991

New Approaches to the Design of Self-Synchronizing Stream Ciphers.
Proceedings of the Advances in Cryptology, 1991

New Public-Key Schemes Based on Elliptic Curves over the Ring Z<sub>n</sub>.
Proceedings of the Advances in Cryptology, 1991

1990
A Provably-Secure Strongly-Randomized Cipher.
Proceedings of the Advances in Cryptology, 1990

Practical Perfect Cryptographic Security.
Proceedings of the Advances In Computational Complexity Theory, 1990

1989
Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity.
Proceedings of the Advances in Cryptology, 1989

Perfect Local Randomness in Pseudo-Random Sequences.
Proceedings of the Advances in Cryptology, 1989

1987
Non-Expanding, Key-Minimal, Robustly-Perfect, Linear and Bilinear Ciphers.
Proceedings of the Advances in Cryptology, 1987


  Loading...