Non-Expanding, Key-Minimal, Robustly-Perfect, Linear and Bilinear Ciphers. - James L. Massey; Ueli M. Maurer; Muzhong Wang (EUROCRYPT, 1987)

Perfect Local Randomness in Pseudo-Random Sequences. - Ueli M. Maurer; James L. Massey (CRYPTO, 1989)

Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity. - Ueli M. Maurer (EUROCRYPT, 1989)

A Universal Statistical Test for Random Bit Generators. - Ueli M. Maurer (CRYPTO, 1990)

Practical Perfect Cryptographic Security. - Ueli M. Maurer (Advances In Computational Complexity Theory, 1990)

A Provably-Secure Strongly-Randomized Cipher. - Ueli M. Maurer (EUROCRYPT, 1990)

New Public-Key Schemes Based on Elliptic Curves over the Ring Zn. - Kenji Koyama; Ueli M. Maurer; Tatsuaki Okamoto; Scott A. Vanstone (CRYPTO, 1991)

New Approaches to the Design of Self-Synchronizing Stream Ciphers. - Ueli M. Maurer (EUROCRYPT, 1991)

Non-interactive Public-Key Cryptography. - Ueli M. Maurer; Yacov Yacobi (EUROCRYPT, 1991)

Perfect Cryptographic Security from Partially Independent Channels - Ueli M. Maurer (STOC, 1991)

Local Randomness in Pseudorandom Sequences. - Ueli M. Maurer; James L. Massey (J. Cryptol., 1991)

Protocols for Secret Key Agreement by Public Discussion Based on Common Information. - Ueli M. Maurer (CRYPTO, 1992)

A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generator. - Ueli M. Maurer (EUROCRYPT, 1992)

Factoring with an Oracle. - Ueli M. Maurer (EUROCRYPT, 1992)

A Remark on a Non-interactive Public-Key Distribution System. - Ueli M. Maurer; Yacov Yacobi (EUROCRYPT, 1992)

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

Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher. - Ueli M. Maurer (J. Cryptol., 1992)

Cascade Ciphers: The Importance of Being First. - Ueli M. Maurer; James L. Massey (J. Cryptol., 1993)

Secret key agreement by public discussion from common information. - Ueli M. Maurer (IEEE Trans. Inf. Theory, 1993)

Directed Acyclic Graphs, One-way Functions and Digital Signatures. - Daniel Bleichenbacher; Ueli M. Maurer (CRYPTO, 1994)

Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms - Ueli M. Maurer (CRYPTO, 1994)

A Calculus for Secure Channel Establishment in Open Networks. - Ueli M. Maurer; Pierre E. Schmid (ESORICS, 1994)

Linking Information Reconciliation and Privacy Amplification (Extended Abstract). - Christian Cachin; Ueli M. Maurer (EUROCRYPT, 1994)

On the Oracle Complexity of Factoring Integers. - Ueli M. Maurer (Comput. Complex., 1995)

Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters. - Ueli M. Maurer (J. Cryptol., 1995)

Generalized privacy amplification. - Charles H. Bennett; Gilles Brassard; Claude Crépeau; Ueli M. Maurer (IEEE Trans. Inf. Theory, 1995)

On the Efficiency of One-Time Digital Signatures. - Daniel Bleichenbacher; Ueli M. Maurer (ASIACRYPT, 1996)

Towards Characterizing When Information-Theoretic Secret Key Agreement Is Possible. - Ueli M. Maurer; Stefan Wolf 001 (ASIACRYPT, 1996)

Diffie-Hellman Oracles. - Ueli M. Maurer; Stefan Wolf 001 (CRYPTO, 1996)

Digital Payment Systems with Passive Anonymity-Revoking Trustees. - Jan Camenisch; Ueli M. Maurer; Markus Stadler (ESORICS, 1996)

Modelling a Public-Key Infrastructure. - Ueli M. Maurer (ESORICS, 1996)

Optimal Tree-Based One-Time Digital Signature Schemes. - Daniel Bleichenbacher; Ueli M. Maurer (STACS, 1996)

A Unified and Generalized Treatment of Authentification Theory. - Ueli M. Maurer (STACS, 1996)

A Non-interactive Public-Key Distribution System. - Ueli M. Maurer; Yacov Yacobi (Des. Codes Cryptogr., 1996)

A Calculus for Security Bootstrapping in Distributed Systems. - Ueli M. Maurer; Pierre E. Schmid (J. Comput. Secur., 1996)

Unconditional Security Against Memory-Bounded Adversaries. - Christian Cachin; Ueli M. Maurer (CRYPTO, 1997)

Privacy Amplification Secure Against Active Adversaries. - Ueli M. Maurer; Stefan Wolf 001 (CRYPTO, 1997)

Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion. - Ueli M. Maurer (EUROCRYPT, 1997)

Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation (Extended Abstract). - Martin Hirt; Ueli M. Maurer (PODC, 1997)

Linking Information Reconciliation and Privacy Amplification. - Christian Cachin; Ueli M. Maurer (J. Cryptol., 1997)

Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract). - Matthias Fitzi; Martin Hirt; Ueli M. Maurer (CRYPTO, 1998)

Lower Bounds on Generic Algorithms in Groups. - Ueli M. Maurer; Stefan Wolf 001 (EUROCRYPT, 1998)

Efficient Byzantine Agreement Secure Against General Adversaries. - Matthias Fitzi; Ueli M. Maurer (DISC, 1998)

General Adversaries in Unconditional Multi-party Computation. - Matthias Fitzi; Martin Hirt; Ueli M. Maurer (ASIACRYPT, 1999)

Information-Theoretic Cryptography. - Ueli M. Maurer (CRYPTO, 1999)

Reasoning about Public-Key Certification: On Bindings between Entities and Public Keys. - Reto Kohlas; Ueli M. Maurer (Financial Cryptography, 1999)

Kryptographie: Basistechnologie der Informationsgesellschaft (Zusammenfassung). - Ueli M. Maurer (GI Jahrestagung, 1999)

Byzantine Agreement Secure against General Adversaries in the Dual Failure Model. - Bernd Altmann; Matthias Fitzi; Ueli M. Maurer (DISC, 1999)

The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms. - Ueli M. Maurer; Stefan Wolf 001 (SIAM J. Comput., 1999)

Unconditionally Secure Key Agreement and the Intrinsic Conditional Information. - Ueli M. Maurer; Stefan Wolf 001 (IEEE Trans. Inf. Theory, 1999)

Efficient Secure Multi-party Computation. - Martin Hirt; Ueli M. Maurer; Bartosz Przydatek (ASIACRYPT, 2000)

General Secure Multi-party Computation from any Linear Secret-Sharing Scheme. - Ronald Cramer; Ivan Damgård; Ueli M. Maurer (EUROCRYPT, 2000)

Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free. - Ueli M. Maurer; Stefan Wolf 001 (EUROCRYPT, 2000)

Confidence Valuation in a Public-Key Infrastructure Based on Uncertain Evidence. - Reto Kohlas; Ueli M. Maurer (Public Key Cryptography, 2000)

From partial consistency to global broadcast. - Matthias Fitzi; Ueli M. Maurer (STOC, 2000)

The Diffie-Hellman Protocol. - Ueli M. Maurer; Stefan Wolf 001 (Des. Codes Cryptogr., 2000)

Player Simulation and General Adversary Structures in Perfect Multiparty Computation. - Martin Hirt; Ueli M. Maurer (J. Cryptol., 2000)

Authentication theory and hypothesis testing. - Ueli M. Maurer (IEEE Trans. Inf. Theory, 2000)

Minimal Complete Primitives for Secure Multi-party Computation. - Matthias Fitzi; Juan A. Garay; Ueli M. Maurer; Rafail Ostrovsky (CRYPTO, 2001)

Robustness for Free in Unconditional Multi-party Computation. - Martin Hirt; Ueli M. Maurer (CRYPTO, 2001)

Cryptography 2000±10. - Ueli M. Maurer (Informatics, 2001)

Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks. - Serge Fehr; Ueli M. Maurer (CRYPTO, 2002)

Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch. - Matthias Fitzi; Nicolas Gisin; Ueli M. Maurer; Oliver von Rotz (EUROCRYPT, 2002)

Indistinguishability of Random Systems. - Ueli M. Maurer (EUROCRYPT, 2002)

Secure Multi-party Computation Made Simple. - Ueli M. Maurer (SCN, 2002)

Tight security proofs for the bounded-storage model. - Stefan Dziembowski; Ueli M. Maurer (STOC, 2002)

The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations. - Ueli M. Maurer; Krzysztof Pietrzak (EUROCRYPT, 2003)

Intrinsic Limitations of Digital Signatures and How to Cope with Them. - Ueli M. Maurer (ISC, 2003)

Secret-key agreement over unauthenticated public channels I: Definitions and a completeness result. - Ueli M. Maurer; Stefan Wolf 001 (IEEE Trans. Inf. Theory, 2003)

Secret-key agreement over unauthenticated public channels II: the simulatability condition. - Ueli M. Maurer; Stefan Wolf 001 (IEEE Trans. Inf. Theory, 2003)

Secret-key agreement over unauthenticated public channels III: Privacy amplification. - Ueli M. Maurer; Stefan Wolf 001 (IEEE Trans. Inf. Theory, 2003)

Complete Classification of Bilinear Hard-Core Functions. - Thomas Holenstein; Ueli M. Maurer; Johan Sjödin (CRYPTO, 2004)

On Generating the Initial Key in the Bounded-Storage Model. - Stefan Dziembowski; Ueli M. Maurer (EUROCRYPT, 2004)

Extracting randomness from generalized symbol-fixing and Markov sources. - Robert König; Ueli Maurer (ISIT, 2004)

Privacy amplification secure against an adversary with selectable knowledge. - Robert König; Ueli Maurer; Renato Renner (ISIT, 2004)

The Role of Cryptography in Database Security. - Ueli M. Maurer (SIGMOD Conference, 2004)

Composition of Random Systems: When Two Weak Make One Strong. - Ueli M. Maurer; Krzysztof Pietrzak (TCC, 2004)

Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology. - Ueli M. Maurer; Renato Renner; Clemens Holenstein (TCC, 2004)

Towards a Theory of Consistency Primitives. - Ueli M. Maurer (DISC, 2004)

Optimal Randomizer Efficiency in the Bounded-Storage Model. - Stefan Dziembowski; Ueli M. Maurer (J. Cryptol., 2004)

New Approaches to Digital Evidence. - Ueli M. Maurer (Proc. IEEE, 2004)

Single-Key AIL-MACs from Any FIL-MAC. - Ueli M. Maurer; Johan Sjödin (ICALP, 2005)

Generalized Strong Extractors and Deterministic Privacy Amplification. - Robert König; Ueli M. Maurer (IMACC, 2005)

Abstract Models of Computation in Cryptography. - Ueli M. Maurer (IMACC, 2005)

Domain Expansion of MACs: Alternative Uses of the FIL-MAC. - Ueli M. Maurer; Johan Sjödin (IMACC, 2005)

Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order. - Endre Bangerter; Jan Camenisch; Ueli M. Maurer (Public Key Cryptography, 2005)

Byzantine Agreement Given Partial Broadcast. - Jeffrey Considine; Matthias Fitzi; Matthew K. Franklin; Leonid A. Levin; Ueli M. Maurer; David Metcalf (J. Cryptol., 2005)

On the power of quantum memory. - Robert König; Ueli M. Maurer; Renato Renner (IEEE Trans. Inf. Theory, 2005)

Luby-Rackoff Ciphers from Weak Round Functions? - Ueli M. Maurer; Yvonne Anne Oswald; Krzysztof Pietrzak; Johan Sjödin (EUROCRYPT, 2006)

Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations. - Ueli M. Maurer; Dominik Raub (ASIACRYPT, 2007)

Indistinguishability Amplification. - Ueli M. Maurer; Krzysztof Pietrzak; Renato Renner (CRYPTO, 2007)

Domain Extension of Public Random Functions: Beyond the Birthday Barrier. - Ueli M. Maurer; Stefano Tessaro (CRYPTO, 2007)

07381 Executive Summary - Cryptography. - Johannes Blömer; Dan Boneh; Ronald Cramer; Ueli M. Maurer (Cryptography, 2007)

07381 Abstracts Collection – Cryptography. - Johannes Blömer; Dan Boneh; Ronald Cramer; Ueli M. Maurer (Cryptography, 2007)

A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security. - Ueli M. Maurer; Johan Sjödin (EUROCRYPT, 2007)

Random Systems: Theory and Applications. - Ueli Maurer (ICITS, 2007)

MPC vs. SFE : Unconditional and Computational Security. - Martin Hirt; Ueli M. Maurer; Vassilis Zikas (ASIACRYPT, 2008)

Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography. - Ueli M. Maurer; Stefano Tessaro (ASIACRYPT, 2008)

Rethinking Digital Signatures. - Ueli M. Maurer (SECRYPT, 2008)

MPC vs. SFE: Perfect Security in a Unified Corruption Model. - Zuzana Beerliová-Trubíniová; Matthias Fitzi; Martin Hirt; Ueli M. Maurer; Vassilis Zikas (TCC, 2008)

The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement. - Stefan Dziembowski; Ueli M. Maurer (IEEE Trans. Inf. Theory, 2008)

Introduction to the Special Issue on Information Theoretic Security. - Hideki Imai; Goichiro Hanaoka; Ueli M. Maurer; Yuliang Zheng 001 (IEEE Trans. Inf. Theory, 2008)

Unifying Zero-Knowledge Proofs of Knowledge. - Ueli M. Maurer (AFRICACRYPT, 2009)

Cascade Encryption Revisited. - Peter Gazi; Ueli M. Maurer (ASIACRYPT, 2009)

Abstraction in Cryptography. - Ueli M. Maurer (CRYPTO, 2009)

Computational Indistinguishability Amplification: Tight Product Theorems for System Composition. - Ueli M. Maurer; Stefano Tessaro (CRYPTO, 2009)

Breaking RSA Generically Is Equivalent to Factoring. - Divesh Aggarwal; Ueli M. Maurer (EUROCRYPT, 2009)

Free-Start Distinguishing: Combining Two Types of Indistinguishability Amplification. - Peter Gazi; Ueli Maurer (ICITS, 2009)

Abstract Storage Devices. - Robert König; Ueli M. Maurer; Stefano Tessaro (SOFSEM, 2009)

Realistic Failures in Secure Multi-party Computation. - Vassilis Zikas; Sarah Hauser; Ueli M. Maurer (TCC, 2009)

On the soundness of authenticate-then-encrypt: formalizing the malleability of symmetric encryption. - Ueli Maurer; Björn Tackmann (CCS, 2010)

Constructive Cryptography - A Primer. - Ueli Maurer (Financial Cryptography, 2010)

Hybrid-secure MPC: trading information-theoretic robustness for computational privacy. - Christoph Lucas; Dominik Raub; Ueli M. Maurer (PODC, 2010)

A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch. - Ueli M. Maurer; Stefano Tessaro (TCC, 2010)

The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy. - Divesh Aggarwal; Ueli Maurer (ASIACRYPT, 2011)

Privacy-preserving outsourcing of brute-force key searches. - Ghassan Karame; Srdjan Capkun; Ueli Maurer (CCSW, 2011)

Graceful Degradation in Multi-Party Computation (Extended Abstract). - Martin Hirt; Christoph Lucas; Ueli Maurer; Dominik Raub (ICITS, 2011)

Abstract Cryptography. - Ueli Maurer; Renato Renner (ICS, 2011)

Constructive Cryptography - A New Paradigm for Security Definitions and Proofs. - Ueli Maurer (TOSCA, 2011)

Public-Key Cryptography (Dagstuhl Seminar 11391). - Marc Fischlin; Anna Lysyanskaya; Ueli Maurer; Alexander May 001 (Dagstuhl Reports, 2011)

Graceful Degradation in Multi-Party Computation. - Martin Hirt; Christoph Lucas; Ueli Maurer; Dominik Raub (IACR Cryptol. ePrint Arch., 2011)

Collusion-Preserving Computation. - Joël Alwen; Jonathan Katz; Ueli Maurer; Vassilis Zikas (CRYPTO, 2012)

Passive Corruption in Statistical Multi-Party Computation - (Extended Abstract). - Martin Hirt; Christoph Lucas; Ueli Maurer; Dominik Raub (ICITS, 2012)

Synchrony amplification. - Ueli Maurer; Björn Tackmann (ISIT, 2012)

Common randomness amplification: A constructive view. - Grégory Demay; Ueli Maurer (ITW, 2012)

UOWHFs from OWFs: Trading Regularity for Efficiency. - Kfir Barhum; Ueli Maurer (LATINCRYPT, 2012)

Confidentiality and Integrity: A Constructive Perspective. - Ueli Maurer; Andreas Rüedlinger; Björn Tackmann (TCC, 2012)

Passive Corruption in Statistical Multi-Party Computation. - Martin Hirt; Christoph Lucas; Ueli Maurer; Dominik Raub (IACR Cryptol. ePrint Arch., 2012)

Constructing Confidential Channels from Authenticated Channels - Public-Key Encryption Revisited. - Sandro Coretti; Ueli Maurer; Björn Tackmann (ASIACRYPT (1), 2013)

A Constructive Perspective on Key Encapsulation. - Sandro Coretti; Ueli Maurer; Björn Tackmann (Number Theory and Cryptography, 2013)

A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation. - Martin Hirt; Christoph Lucas; Ueli Maurer (CRYPTO (2), 2013)

Erratum: A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation. - Martin Hirt; Christoph Lucas; Ueli Maurer (CRYPTO (2), 2013)

Resource-Restricted Indifferentiability. - Grégory Demay; Peter Gazi; Martin Hirt; Ueli Maurer (EUROCRYPT, 2013)

Rational Protocol Design: Cryptography against Incentive-Driven Adversaries. - Juan A. Garay; Jonathan Katz; Ueli Maurer; Björn Tackmann; Vassilis Zikas (FOCS, 2013)

Unfair coin tossing. - Grégory Demay; Ueli Maurer (ISIT, 2013)

The one-time pad revisited. - Christian Matt 002; Ueli Maurer (ISIT, 2013)

Authentication amplification by synchronization. - Ueli Maurer (ISIT, 2013)

Conditional equivalence of random systems and indistinguishability proofs. - Ueli Maurer (ISIT, 2013)

Anonymity-Preserving Public-Key Encryption: A Constructive Approach. - Markulf Kohlweiss; Ueli Maurer; Cristina Onete; Björn Tackmann; Daniele Venturi 001 (Privacy Enhancing Technologies, 2013)

Universally Composable Synchronous Computation. - Jonathan Katz; Ueli Maurer; Björn Tackmann; Vassilis Zikas (TCC, 2013)

A Constructive Approach to Functional Encryption. - Christian Matt 002; Ueli Maurer (IACR Cryptol. ePrint Arch., 2013)

Key Exchange with Unilateral Authentication: Composable Security Definition and Modular Protocol Design. - Ueli Maurer; Björn Tackmann; Sandro Coretti (IACR Cryptol. ePrint Arch., 2013)

Information-Theoretic Secure Multiparty Computation. - Ueli Maurer; Vassilis Zikas (Secure Multi-Party Computation, 2013)

Optimality of non-adaptive strategies: The case of parallel games. - Grégory Demay; Peter Gazi; Ueli Maurer; Björn Tackmann (ISIT, 2014)

Anonymous Authentication with Shared Secrets. - Joël Alwen; Martin Hirt; Ueli Maurer; Arpita Patra; Pavel Raykov (LATINCRYPT, 2014)

Key-Indistinguishable Message Authentication Codes. - Joël Alwen; Martin Hirt; Ueli Maurer; Arpita Patra; Pavel Raykov (SCN, 2014)

Broadcast Amplification. - Martin Hirt; Ueli Maurer; Pavel Raykov (TCC, 2014)

(De-)Constructing TLS. - Markulf Kohlweiss; Ueli Maurer; Cristina Onete; Björn Tackmann; Daniele Venturi 001 (IACR Cryptol. ePrint Arch., 2014)

Idealizing Identity-Based Encryption. - Dennis Hofheinz; Christian Matt 002; Ueli Maurer (ASIACRYPT (1), 2015)

A Definitional Framework for Functional Encryption. - Christian Matt 002; Ueli Maurer (CSF, 2015)

Query-Complexity Amplification for Random Oracles. - Grégory Demay; Peter Gazi; Ueli Maurer; Björn Tackmann (ICITS, 2015)

Robust Authenticated Encryption and the Limits of Symmetric Cryptography. - Christian Badertscher; Christian Matt 002; Ueli Maurer; Phillip Rogaway; Björn Tackmann (IMACC, 2015)

(De-)Constructing TLS 1.3. - Markulf Kohlweiss; Ueli Maurer; Cristina Onete; Björn Tackmann; Daniele Venturi 001 (INDOCRYPT, 2015)

Augmented Secure Channels and the Goal of the TLS 1.3 Record Layer. - Christian Badertscher; Christian Matt 002; Ueli Maurer; Phillip Rogaway; Björn Tackmann (ProvSec, 2015)

From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes. - Sandro Coretti; Ueli Maurer; Björn Tackmann; Daniele Venturi 001 (TCC (1), 2015)

Zero-knowledge proofs of knowledge for group homomorphisms. - Ueli Maurer (Des. Codes Cryptogr., 2015)

Cryptography and Computation after Turing. - Ueli Maurer (The Once and Future Turing, 2016)

Network-Hiding Communication and Applications to Multi-party Protocols. - Martin Hirt; Ueli Maurer; Daniel Tschudi; Vassilis Zikas (CRYPTO (2), 2016)

Hierarchy of three-party consistency specifications. - Julian Loss; Ueli Maurer; Daniel Tschudi (ISIT, 2016)

New perspectives on weak Oblivious Transfer. - Ueli Maurer; João Ribeiro 002 (ISIT, 2016)

On the impossibility of information-theoretic composable coin toss extension. - Gregor Seiler; Ueli Maurer (ISIT, 2016)

Memory Erasability Amplification. - Jan Camenisch; Robert R. Enderlein; Ueli Maurer (SCN, 2016)

From Indifferentiability to Constructive Cryptography (and Back). - Ueli Maurer; Renato Renner (TCC (B1), 2016)

Strengthening Access Control Encryption. - Christian Badertscher; Christian Matt 002; Ueli Maurer (ASIACRYPT (1), 2017)

Bitcoin as a Transaction Ledger: A Composable Treatment. - Christian Badertscher; Ueli Maurer; Daniel Tschudi; Vassilis Zikas (CRYPTO (1), 2017)

Per-Session Security: Password-Based Cryptography Revisited. - Grégory Demay; Peter Gazi; Ueli Maurer; Björn Tackmann (ESORICS (1), 2017)

Efficiency lower bounds for commit-and-prove constructions. - Christian Badertscher; Sandro Coretti; Chen-Da Liu Zhang; Ueli Maurer (ISIT, 2017)

An information-theoretic approach to hardness amplification. - Ueli Maurer (ISIT, 2017)

Witness-hiding proofs of knowledge for cable locks. - Chen-Da Liu Zhang; Ueli Maurer; Martin Raszyk; Daniel Tschudi (ISIT, 2017)

Context-Restricted Indifferentiability: Generalizing UCE and Implications on the Soundness of Hash-Function Constructions. - Daniel Jost 001; Ueli Maurer (IACR Cryptol. ePrint Arch., 2017)

Causal Boxes: Quantum Information-Processing Systems Closed Under Composition. - Christopher Portmann; Christian Matt 002; Ueli Maurer; Renato Renner; Björn Tackmann (IEEE Trans. Inf. Theory, 2017)

Composable and Robust Outsourced Storage. - Christian Badertscher; Ueli Maurer (CT-RSA, 2018)

But Why Does It Work? A Rational Protocol Design Treatment of Bitcoin. - Christian Badertscher; Juan A. Garay; Ueli Maurer; Daniel Tschudi; Vassilis Zikas (EUROCRYPT (2), 2018)

On Composable Security for Digital Signatures. - Christian Badertscher; Ueli Maurer; Björn Tackmann (Public Key Cryptography (1), 2018)

A Constructive Perspective on Signcryption Security. - Christian Badertscher; Fabio Banfi; Ueli Maurer (SCN, 2018)

Security Definitions for Hash Functions: Combining UCE and Indifferentiability. - Daniel Jost 001; Ueli Maurer (SCN, 2018)

Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio. - Daniel Jost 001; Ueli Maurer; João L. Ribeiro 001 (TCC (1), 2018)

Topology-Hiding Computation Beyond Semi-Honest Adversaries. - Rio LaVigne; Chen-Da Liu Zhang; Ueli Maurer; Tal Moran; Marta Mularczyk; Daniel Tschudi (TCC (2), 2018)

Strong Separations Between Broadcast and Authenticated Channels. - Julian Loss; Ueli Maurer; Daniel Tschudi (DISC, 2018)

Toward an algebraic theory of systems. - Christian Matt 002; Ueli Maurer; Christopher Portmann; Renato Renner; Björn Tackmann (Theor. Comput. Sci., 2018)

Formalizing Constructive Cryptography using CryptHOL. - Andreas Lochbihler; S. Reza Sefidgar; David A. Basin; Ueli Maurer (CSF, 2019)

Efficient Ratcheting: Almost-Optimal Guarantees for Secure Messaging. - Daniel Jost 001; Ueli Maurer; Marta Mularczyk (EUROCRYPT (1), 2019)

Composable and Finite Computational Security of Quantum Message Transmission. - Fabio Banfi; Ueli Maurer; Christopher Portmann; Jiamin Zhu (TCC (1), 2019)

A Unified and Composable Take on Ratcheting. - Daniel Jost 001; Ueli Maurer; Marta Mularczyk (TCC (2), 2019)

Brief Announcement: Towards Byzantine Broadcast in Generalized Communication and Adversarial Models. - Chen-Da Liu Zhang; Varun Maram; Ueli Maurer (DISC, 2019)

Agree-and-Prove: Generalized Proofs Of Knowledge and Applications. - Christian Badertscher; Daniel Jost 001; Ueli Maurer (IACR Cryptol. ePrint Arch., 2019)

Robust MPC: Asynchronous Responsiveness yet Synchronous Security. - Chen-Da Liu Zhang; Julian Loss; Ueli Maurer; Tal Moran; Daniel Tschudi (IACR Cryptol. ePrint Arch., 2019)

MPC with Synchronous Security and Asynchronous Responsiveness. - Chen-Da Liu-Zhang; Julian Loss; Ueli Maurer; Tal Moran; Daniel Tschudi (ASIACRYPT (3), 2020)

Overcoming Impossibility Results in Composable Security Using Interval-Wise Guarantees. - Daniel Jost 001; Ueli Maurer (CRYPTO (1), 2020)

On Broadcast in Generalized Network and Adversarial Models. - Chen-Da Liu-Zhang; Varun Maram; Ueli Maurer (OPODIS, 2020)

Topology-Hiding Computation for Networks with Unknown Delays. - Rio LaVigne; Chen-Da Liu Zhang; Ueli Maurer; Tal Moran; Marta Mularczyk; Daniel Tschudi (Public Key Cryptography (2), 2020)

Anonymous Symmetric-Key Communication. - Fabio Banfi; Ueli Maurer (SCN, 2020)

Coupling of Random Systems. - David Lanzenberger; Ueli Maurer (TCC (3), 2020)

Synchronous Constructive Cryptography. - Chen-Da Liu-Zhang; Ueli Maurer (TCC (2), 2020)

Unifying Generic Group Models. - Ueli Maurer; Christopher Portmann; Jiamin Zhu (IACR Cryptol. ePrint Arch., 2020)

Non-malleable Encryption: Simpler, Shorter, Stronger. - Sandro Coretti; Yevgeniy Dodis; Ueli Maurer; Björn Tackmann; Daniele Venturi 001 (J. Cryptol., 2020)

Giving an Adversary Guarantees (Or: How to Model Designated Verifier Signatures in a Composable Framework). - Ueli Maurer; Christopher Portmann; Guilherme Rito (ASIACRYPT (3), 2021)

Abstract Modeling of System Communication in Constructive Cryptography using CryptHOL. - David A. Basin; Andreas Lochbihler; Ueli Maurer; S. Reza Sefidgar (CSF, 2021)

Revisiting (R)CCA Security and Replay Protection. - Christian Badertscher; Ueli Maurer; Christopher Portmann; Guilherme Rito (Public Key Cryptography (2), 2021)

Generalized Proofs of Knowledge with Fully Dynamic Setup. - Christian Badertscher; Daniel Jost 001; Ueli Maurer (TCC (1), 2021)

Adaptive Security of Multi-party Protocols, Revisited. - Martin Hirt; Chen-Da Liu-Zhang; Ueli Maurer (TCC (1), 2021)

Direct Product Hardness Amplification. - David Lanzenberger; Ueli Maurer (TCC (2), 2021)

Composable Notions for Anonymous and Authenticated Communication. - Fabio Banfi; Ueli Maurer (IACR Cryptol. ePrint Arch., 2021)

A Fresh Approach to Updatable Symmetric Encryption. - Andrés Fábrega; Ueli Maurer; Marta Mularczyk (IACR Cryptol. ePrint Arch., 2021)

Effects of Quantization on the Multiple-Round Secret-Key Capacity. - Onur Günlü; Ueli Maurer; João Ribeiro 002 (IACR Cryptol. ePrint Arch., 2021)

Practical Provably Secure Flooding for Blockchains. - Chen-Da Liu-Zhang; Christian Matt 002; Ueli Maurer; Guilherme Rito; Søren Eller Thomsen (ASIACRYPT (1), 2022)

Multi-Designated Receiver Signed Public Key Encryption. - Ueli Maurer; Christopher Portmann; Guilherme Rito (EUROCRYPT (2), 2022)

Anonymous Authenticated Communication. - Fabio Banfi; Ueli Maurer (SCN, 2022)

Deniable Authentication When Signing Keys Leak. - Suvradip Chakraborty; Dennis Hofheinz; Ueli Maurer; Guilherme Rito (EUROCRYPT (3), 2023)

Anamorphic Encryption, Revisited. - Fabio Banfi; Konstantin Gegier; Martin Hirt; Ueli Maurer (IACR Cryptol. ePrint Arch., 2023)

On the Security of Universal Re-Encryption. - Fabio Banfi; Ueli Maurer; Silvia Ritsch (IACR Cryptol. ePrint Arch., 2023)

Anamorphic Encryption, Revisited. - Fabio Banfi; Konstantin Gegier; Martin Hirt; Ueli Maurer; Guilherme Rito (EUROCRYPT (2), 2024)