Ueli Maurer

Ueli Maurer 's AcademicInfluence.com Rankings

Ueli Maurer

Computer Science

#2736

World Rank

#2864

Historical Rank

Database

#2161

World Rank

#2274

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Ueli Maurer Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Ueli Maurer is a professor of cryptography at the Swiss Federal Institute of Technology Zurich . Education Maurer studied electrical engineering at ETH Zurich and obtained his PhD in 1990, advised by James Massey. He joined Princeton University as a postdoc from 1990 to 1991.

(See a Problem?)

Ueli Maurer 's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Generalized privacy amplification (1994) (1400)
Advances in Cryptology — EUROCRYPT ’96 (2001) (590)
Secret key agreement by public discussion from common information (1993) (517)
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme (2000) (511)
Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology (2004) (492)
Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free (2000) (483)
Modelling a Public-Key Infrastructure (1996) (367)
Conditionally-perfect secrecy and a provably-secure randomized cipher (1992) (262)
A universal statistical test for random bit generators (1990) (255)
Unconditionally Secure Key Agreement and the Intrinsic Conditional Information (1999) (241)
Player Simulation and General Adversary Structures in Perfect Multiparty Computation (2000) (236)
Indistinguishability of Random Systems (2002) (228)
Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms (1994) (227)
Digital Payment Systems With Passive Anonymity-Revoking Trustees (1996) (194)
Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract) (1997) (194)
Abstract Models of Computation in Cryptography (2005) (193)
Bitcoin as a Transaction Ledger: A Composable Treatment (2017) (191)
Unconditional Security Against Memory-Bounded Adversaries (1997) (184)
New Public-Key Schemes Based on Elliptic Curves over the Ring Zn (1991) (182)
Non-interactive Public-Key Cryptography (1991) (180)
Authentication theory and hypothesis testing (2000) (166)
Abstract Cryptography (2011) (163)
Secret-key agreement over unauthenticated public channels I: Definitions and a completeness result (2003) (158)
The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms (1999) (158)
Constructive Cryptography - A New Paradigm for Security Definitions and Proofs (2011) (156)
Secure multi-party computation made simple (2002) (154)
Universally Composable Synchronous Computation (2013) (149)
Privacy Amplification Secure Against Active Adversaries (1997) (143)
The Strong Secret Key Rate of Discrete Random Triples (1994) (139)
Diffie-Hellman Oracles (1996) (133)
Efficient Secure Multi-party Computation (2000) (133)
Secret key agreement by public discussion (1993) (124)
Small accessible quantum information does not imply security. (2007) (122)
Linking information reconciliation and privacy amplification (1997) (122)
Secret-key agreement over unauthenticated public channels III: Privacy amplification (2003) (119)
Quantum solution to the Byzantine agreement problem. (2001) (113)
Protocols for Secret Key Agreement by Public Discussion Based on Common Information (1992) (109)
Indistinguishability Amplification (2007) (106)
The Diffie–Hellman Protocol (2000) (101)
Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion (1997) (99)
Secret-key agreement over unauthenticated public channels II: the simulatability condition (2003) (96)
New Approaches to the Design of Self-Synchronizing Stream Ciphers (1991) (94)
Rational Protocol Design: Cryptography against Incentive-Driven Adversaries (2013) (93)
On the power of quantum memory (2003) (92)
Fast generation of prime numbers and secure public-key cryptographic parameters (1995) (90)
Lower Bounds on Generic Algorithms in Groups (1998) (86)
Robustness for Free in Unconditional Multi-party Computation (2001) (85)
Information-Theoretic Cryptography (1999) (84)
Unifying Zero-Knowledge Proofs of Knowledge (2009) (81)
The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations (2003) (75)
On Generating the Initial Key in the Bounded-Storage Model (2004) (73)
A Non-interactive Public-Key Distribution System (1996) (73)
From partial consistency to global broadcast (2000) (72)
Efficient Byzantine Agreement Secure Against General Adversaries (1998) (67)
Optimal Randomizer Efficiency in the Bounded-Storage Model (2003) (66)
From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes (2015) (64)
But Why does it Work? A Rational Protocol Design Treatment of Bitcoin (2018) (64)
Cascade ciphers: The importance of being first (1993) (62)
Directed Acyclic Graphs, One-way Functions and Digital Signatures (1994) (61)
On the Efficiency of One-Time Digital Signatures (1996) (59)
A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generator (1992) (58)
Confidence Valuation in a Public-Key Infrastructure Based on Uncertain Evidence (2000) (57)
Breaking RSA Generically Is Equivalent to Factoring (2009) (56)
Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract) (1998) (56)
Tight security proofs for the bounded-storage model (2002) (56)
General Adversaries in Unconditional Multi-party Computation (1999) (55)
Optimal Tree-Based One-Time Digital Signature Schemes (1996) (54)
Composition of Random Systems: When Two Weak Make One Strong (2004) (53)
Efficient Ratcheting: Almost-Optimal Guarantees for Secure Messaging (2019) (51)
A non-interactive public-key distribution system (1996) (51)
Causal Boxes: Quantum Information-Processing Systems Closed Under Composition (2015) (51)
On the soundness of authenticate-then-encrypt: formalizing the malleability of symmetric encryption (2010) (51)
A Calculus for Security Bootstrapping in Distributed Systems (1996) (50)
Perfect cryptographic security from partially independent channels (1991) (49)
The role of cryptography in database security (2004) (49)
A Simpliied and Generalized Treatment of Luby-rackoo Pseudorandom Permutation Generators (1992) (48)
Domain Extension of Public Random Functions: Beyond the Birthday Barrier (2007) (47)
Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch (2002) (47)
A Provably-Secure Strongly-Randomized Cipher (1991) (45)
Byzantine Agreement Given Partial Broadcast (2005) (45)
A Calculus for Secure Channel Establishment in Open Networks (1994) (45)
Single-Key AIL-MACs from Any FIL-MAC (2005) (43)
New approaches to digital evidence (2004) (41)
Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity (1990) (40)
Resource-Restricted Indifferentiability (2013) (40)
Cascade Encryption Revisited (2009) (39)
Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order (2005) (39)
On the secret-key rate of binary random variables (1994) (37)
Towards Characterizing When Information-Theoretic Secret Key Agreement Is Possible (1996) (37)
Unbreakable Keys from Random Noise (2007) (37)
A Uniied and Generalized Treatment of Authentication Theory (1996) (36)
A Unified and Generalized Treatment of Authentification Theory (1996) (36)
Reasoning about public-key certification: on bindings between entities and public keys (1999) (35)
Quantum technology: from research to application (2016) (35)
Confidentiality and Integrity: A Constructive Perspective (2012) (34)
A Remark on a Non-interactive Public-Key Distribution System (1992) (33)
Computational Indistinguishability Amplification: Tight Product Theorems for System Composition (2009) (32)
Trading Correctness for Privacy in Unconditional Multi-Party Computation ? Corrected Version ?? (1998) (31)
Minimal Complete Primitives for Secure Multi-Party Computation (2004) (30)
Diffie-Hellman, decision Diffie-Hellman, and discrete logarithms (1998) (29)
Augmented Secure Channels and the Goal of the TLS 1.3 Record Layer (2015) (29)
The intrinsic conditional mutual information and perfect secrecy (1997) (29)
Collusion-Preserving Computation (2012) (27)
From weak to strong information-theoretic key agreement (2000) (26)
MPC vs. SFE : Unconditional and Computational Security (2008) (26)
Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks (2002) (26)
Constructing Confidential Channels from Authenticated Channels - Public-Key Encryption Revisited (2013) (25)
A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch (2010) (24)
From Indifferentiability to Constructive Cryptography (and Back) (2016) (24)
Perfect Local Randomness in Pseudo-Random Sequences (1989) (24)
A Dynamic Tradeoff Between Active and Passive Corruptions in Secure Multi-Party Computation (2013) (24)
A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security (2007) (23)
Span Programs and General Secure Multi-Party Computation (1997) (23)
Zero-knowledge proofs of knowledge for group homomorphisms (2015) (23)
(De-)Constructing TLS 1.3 (2015) (22)
Byzantine Agreement Secure against General Adversaries in the Dual Failure Model (1999) (22)
Locking of accessible information and implications for the security of quantum cryptography (2005) (22)
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations (2007) (22)
MPC vs. SFE: Perfect Security in a Unified Corruption Model (2008) (22)
A Unified and Composable Take on Ratcheting (2019) (20)
The Role of Information Theory in Cryptography (1993) (20)
(De-)Constructing TLS (2014) (20)
Strengthening Access Control Encryption (2017) (19)
Conditional equivalence of random systems and indistinguishability proofs (2013) (19)
Luby-Rackoff Ciphers from Weak Round Functions? (2006) (19)
Asymptotically-Tight Bounds on the Number of Cycles in Generalized de Bruijn-Good Graphs (1992) (18)
Formalizing Constructive Cryptography using CryptHOL (2019) (18)
Anonymity-Preserving Public-Key Encryption: A Constructive Approach (2013) (18)
Key Exchange with Unilateral Authentication: Composable Security Definition and Modular Protocol Design (2013) (17)
Factoring with an Oracle (1992) (16)
Minimal Complete Primitives for Secure Multi-party Computation (2001) (16)
On the oracle complexity of factoring integers (1995) (16)
Introduction to the Special Issue on Information Theoretic Security (2008) (16)
The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement (2008) (16)
On the complexity of breaking the Diffie-Hellman protocol (1996) (16)
Realistic Failures in Secure Multi-party Computation (2009) (15)
Constructive Cryptography - A Primer (2010) (15)
The one-time pad revisited (2013) (15)
Intrinsic Limitations of Digital Signatures and How to Cope with Them (2003) (15)
Network-Hiding Communication and Applications to Multi-Party Protocols (2016) (15)
Hybrid-secure MPC: trading information-theoretic robustness for computational privacy (2010) (15)
Graceful Degradation in Multi-Party Computation (Extended Abstract) (2011) (14)
Local randomness in pseudorandom sequences (2004) (14)
Smoothing probability distributions and smooth entropy (1997) (13)
Complete Classification of Bilinear Hard-Core Functions (2004) (13)
Generalized Strong Extractors and Deterministic Privacy Amplification (2005) (12)
Overcoming Impossibility Results in Composable Security using Interval-Wise Guarantees (2020) (12)
Robust Authenticated Encryption and the Limits of Symmetric Cryptography (2015) (11)
Anonymous Authentication with Shared Secrets (2014) (11)
Generalized Privacy Ampliication (1995) (11)
Free-Start Distinguishing: Combining Two Types of Indistinguishability Amplification (2009) (11)
Unbreakable Keys from Random Noise; ; ; Security with noisy data : on private biometrics, secure key storage and anti-counterfeiting (2007) (11)
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy (2011) (11)
Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography (2008) (10)
Extracting randomness from generalized symbol-fixing and Markov sources (2004) (10)
A Definitional Framework for Functional Encryption (2015) (10)
Cryptography 2000±10 (2001) (9)
Abstraction in Cryptography (2009) (9)
Communications and Cryptography (1994) (9)
Passive Corruption in Statistical Multi-Party Computation (2012) (9)
Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio (2018) (9)
Idealizing Identity-Based Encryption (2015) (8)
A Constructive Perspective on Signcryption Security (2018) (8)
Privacy-preserving outsourcing of brute-force key searches (2011) (8)
Topology-Hiding Computation Beyond Semi-Honest Adversaries (2018) (8)
Random Systems: Theory and Applications (2009) (7)
Composable and Robust Outsourced Storage (2018) (7)
Toward an Algebraic Theory of Systems (2016) (6)
Broadcast Amplification (2013) (6)
Graceful Degradation in Multi-Party Computation (2011) (6)
Domain Expansion of MACs: Alternative Uses of the FIL-MAC (2005) (6)
Key-Indistinguishable Message Authentication Codes (2014) (6)
MPC with Synchronous Security and Asynchronous Responsiveness (2020) (6)
UOWHFs from OWFs: Trading Regularity for Efficiency (2012) (6)
The Equivalence of Strong RSA and Factoring in the Generic Ring Model of Computation (2011) (5)
Non-Expanding, Key-Minimal, Robustly-Perfect, Linear and Bilinear Ciphers (1987) (5)
Synchronous Constructive Cryptography (2020) (5)
Advances in cryptology-EUROCRYPT '96 : International Conference on the Theory and Application of Cryptographic Techniques, Saragossa, Spain, May 12-16, 1996 : proceedings (1996) (5)
Robust MPC: Asynchronous Responsiveness yet Synchronous Security (2019) (5)
Towards a Theory of Consistency Primitives (2004) (5)
On Composable Security for Digital Signatures (2018) (5)
A Constructive Perspective on Key Encapsulation (2013) (5)
On the E ciency of One-time Digital (1996) (4)
Unifying Generic Group Models (2020) (4)
Agree-and-Prove: Generalized Proofs Of Knowledge and Applications (2019) (4)
Per-Session Security: Password-Based Cryptography Revisited (2017) (4)
Authentication amplification by synchronization (2013) (4)
Privacy amplification secure against an adversary with selectable knowledge (2004) (4)
A Fresh Approach to Updatable Symmetric Encryption (2021) (4)
Giving an Adversary Guarantees (Or: How to Model Designated Verifier Signatures in a Composable Framework) (2021) (4)
Composable and Finite Computational Security of Quantum Message Transmission (2019) (3)
Linking Information Reconciliation and Privacy Amplification (Extended Abstract) (1994) (3)
Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques (1996) (3)
A Constructive Approach to Functional Encryption (2013) (3)
Abstract Storage Devices (2007) (3)
The Di e-Hellman Protocol (1999) (3)
Anonymous Symmetric-Key Communication (2020) (3)
Revisiting (R)CCA Security and Replay Protection (2020) (3)
Provable security in cryptography (1990) (3)
Practical Provably Secure Flooding for Blockchains (2022) (3)
Hierarchy of three-party consistency specifications (2016) (2)
New perspectives on weak Oblivious Transfer (2016) (2)
Optimally Hybrid-Secure MPC (2009) (2)
Security Definitions for Hash Functions: Combining UCE and Indifferentiability (2018) (2)
An information-theoretic approach to hardness amplification (2017) (2)
Query-Complexity Amplification for Random Oracles (2015) (2)
Passive Corruption in Statistical Multi-Party Computation - (Extended Abstract) (2012) (2)
Unfair coin tossing (2013) (2)
Erratum to: Per-Session Security: Password-Based Cryptography Revisited (2017) (2)
Topology-Hiding Computation for Networks with Unknown Delays (2020) (2)
On the Hardness of the Diffie-Hellman Decision Problem (1998) (2)
Coupling of Random Systems (2020) (2)
Context-Restricted Indifferentiability: Generalizing UCE and Implications on the Soundness of Hash-Function Constructions (2017) (2)
Adaptive Security of Multi-Party Protocols, Revisited (2021) (2)
Memory Erasability Amplification (2016) (2)
Generalized Proofs of Knowledge with Fully Dynamic Setup (2021) (1)
Optimality of non-adaptive strategies: The case of parallel games (2014) (1)
Modelling a Public-Key Infrastructure 1 (1996) (1)
Unconditionally secure secret key agreement and the intrinsic conditional mutual information (1997) (1)
A Tribute to David Kahn (2009) (1)
Synchrony amplification (2012) (1)
Erratum: A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation (2013) (1)
Information-Theoretic Secure Multiparty Computation (2013) (1)
EÆ ient Se ure Multi-Party Computation ? ( Extended Abstra t ) (2000) (1)
Information Security (Part I) (2013) (1)
Strong Separations Between Broadcast and Authenticated Channels (2018) (1)
Common randomness amplification: A constructive view (2012) (1)
Combining Computational and Information-Theoretic Security in Multi-Party Computation (2008) (1)
Efficient Secure Multi-Party Computation ? ( Extended Abstract ) (1)
Concordium White Paper [Vol. 1.0-April 2020] (2020) (1)
Efficiency lower bounds for commit-and-prove constructions (2017) (1)
Probability , and Computing Fall 2011 Exercise Sheet 6-Master Solution Exercise 1-Pfaffian Orientations (2011) (0)
Certain Investigations of Security Algorithms and its Vulnerabilities for Wireless Networks (2017) (0)
Global broadcast by broadcasts among subsets of players (2000) (0)
Cryptography Foundations Solution Exercise 11 11 . 1 Conditional Probability Distributions (2018) (0)
Practical Perfect Cryptographic Security (1990) (0)
Quantum technology: from research to application (2016) (0)
Cryptography Foundations Solution Exercise 1 1 . 1 Variant (2018) (0)
Composable Notions for Anonymous and Authenticated Communication (2021) (0)
Direct Product Hardness Amplification (2021) (0)
Multi-Designated Receiver Signed Public Key Encryption (2022) (0)
Effects of Quantization on the Multiple-Round Secret-Key Capacity (2021) (0)
From Known-Plaintext to Chosen-Ciphertext Security (2006) (0)
Cryptography and Computation after Turing (2016) (0)
Editor's Note (2007) (0)
Cryptography Foundations Solution Exercise 8 8 . 1 Changing the Distribution of Bit-Guessing Problems a ) (2018) (0)
On the Diiculty of Breaking the Diie-hellman Protocol (1995) (0)
Probability , and Computing Fall 2012 Exercise Sheet 3-Master Solution Exercise 1-Comparisons in Quicksort (2013) (0)
Unfair Coin Tossing Grégory (2013) (0)
07381 Executive Summary - Cryptography (2007) (0)
Zero-knowledge proofs of knowledge for group homomorphisms (2015) (0)
Banfi Cryptography Foundations Solution Exercise 13 13 . 1 Key-Agreement Using a Trapdoor One-Way Permutation in the ROM (2018) (0)
Anamorphic Encryption, Revisited (2023) (0)
Algorithms , Probability , and Computing Fall 2011 Special Assignment Set 2 (2011) (0)
Generalized indistinguishability (2002) (0)
The Generic Complexity of Index-Search Problemsand Applications to Cryptography (1998) (0)
Public-Key Cryptography (Dagstuhl Seminar 11391) (2011) (0)
Deniable Authentication when Signing Keys Leak (2023) (0)
Player Elimination : How to make Cheating Harmlessin Multi-Party Computation (1999) (0)
Witness-hiding proofs of knowledge for cable locks (2017) (0)
07381 Abstracts Collection -- Cryptography (2007) (0)
Achievability in Incomplete Minicast Models (2019) (0)
On the impossibility of information-theoretic composable coin toss extension (2016) (0)
Anonymous Authenticated Communication (2022) (0)
Collection Cryptography Dagstuhl Seminar (2008) (0)
Brief Announcement: Towards Byzantine Broadcast in Generalized Communication and Adversarial Models (2019) (0)
On Broadcast in Generalized Network and Adversarial Models (2020) (0)
Information theory and secure multi-party computation (1998) (0)
On the Eeciency of One-time Digital Signatures (2007) (0)
4 Cryptography and Computation after Turing (2015) (0)
Cryptography Foundations Solution Exercise 11 11 . 1 Constructing Uniform Bits from Biased Bits (2018) (0)
United States Patent Kasahara (2017) (0)
A calculus of conditional independence and its applications in cryptography (2000) (0)
Secure Cooperation SECCO : Secure Cooperation (2000) (0)
Abstract Modeling of System Communication in Constructive Cryptography using CryptHOL (2021) (0)
cient Byzantine Agreement Secure Against General Adversaries ? ( Extended Abstract ) (0)
Towards a Theory of Consistency Primitives (Extended Abstract) (2004) (0)
Corporate portal as security backbone (2005) (0)

This paper list is powered by the following services:

Other Resources About Ueli Maurer

en.wikipedia.org

What Schools Are Affiliated With Ueli Maurer ?

Ueli Maurer is affiliated with the following schools:

ETH Zurich