Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology
- U. Maurer, R. Renner, C. Holenstein
- Computer Science
- TCC
- 19 February 2004
The goals of this paper are two-fold. First we introduce and motivate a generalization of the fundamental concept of the indistinguishability of two systems, called indifferentiability. This… Expand
Secret key agreement by public discussion from common information
- U. Maurer
- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 1 May 1993
The problem of generating a shared secret key S by two parties knowing dependent random variables X and Y, respectively, but not sharing a secret key initially, is considered. An enemy who knows the… Expand
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
- R. Cramer, I. Damgård, U. Maurer
- Computer Science
- EUROCRYPT
- 14 May 2000
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) for the players,… Expand
Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free
One of the basic problems in cryptography is the generation of a common secret key between two parties, for instance in order to communicate privately. In this paper we consider… Expand
Modelling a Public-Key Infrastructure
- U. Maurer
- Computer Science
- ESORICS
- 25 September 1996
A global public-key infrastructure (PKI), components of which are emerging in the near future, is a prerequisite for security in distributed systems and for electronic commerce. The purpose of this… Expand
Generalized privacy amplification
- C. H. Bennett, G. Brassard, C. Crépeau, U. Maurer
- Computer Science
- IEEE Trans. Inf. Theory
- 27 June 1994
This paper, provides a general treatment of privacy amplification by public discussion, a concept introduced by Bennett, Brassard, and Robert for a special scenario. Privacy amplification is a… Expand
Conditionally-perfect secrecy and a provably-secure randomized cipher
- U. Maurer
- Computer Science
- Journal of Cryptology
- 3 January 1992
Shannon's pessimistic theorem, which states that a cipher can be perfect only when the entropy of the secret key is at least as great as that of the plaintext, is relativized by the demonstration of… Expand
Indistinguishability of Random Systems
- U. Maurer
- Computer Science
- EUROCRYPT
- 2 May 2002
An (X, Y)-random system takes inputs X1, X2, . . . ? ? and generates, for each new input Xi, an output Yi ? Y, depending probabilistically on X1, . . . , Xi and Y1, . . . , Yi-1. Many cryptographic… Expand
Unconditional Security Against Memory-Bounded Adversaries
We propose a private-key cryptosystem and a protocol for key agreement by public discussion that are unconditionally secure based on the sole assumption that an adversary's memory capacity is… Expand