• Publications
  • Influence
Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology
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
Generalized privacy amplification
This paper provides a general treatment of privacy amplification by public discussion, a concept introduced by Bennett, Brassard and Robert (1988) for a special scenario. The results have
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
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,
Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free
TLDR
This paper shows that not only secret-key agreement satisfying the strong secrecy condition is possible, but even that the achievable key-generation rates are equal to the previous weak notions of secrecy capacity and secret- key rate.
Generalized privacy amplification
TLDR
This paper provides a general treatment of privacy amplification by public discussion, a concept introduced by Bennett, Brassard, and Robert for a special scenario, and yields results on wiretap and broadcast channels for a considerably strengthened definition of secrecy capacity.
Modelling a Public-Key Infrastructure
  • U. Maurer
  • Computer Science
    ESORICS
  • 25 September 1996
TLDR
An approach to modelling and reasoning about a PKI from a user Alice's point of view is proposed, which includes confidence values for statements and can exploit arbitrary certification structures containing multiple intersecting certification paths to achieve a higher confidence value than for any single certification path.
Secret key agreement by public discussion from common information
  • U. Maurer
  • Mathematics, Computer Science
    IEEE Trans. Inf. Theory
  • 1 May 1993
TLDR
It is shown that such a secret key agreement is possible for a scenario in which all three parties receive the output of a binary symmetric source over independent binary asymmetric channels, even when the enemy's channel is superior to the other two channels.
Conditionally-perfect secrecy and a provably-secure randomized cipher
  • U. Maurer
  • Mathematics, Computer Science
    Journal of Cryptology
  • 3 January 1992
TLDR
Two modifications of this cipher are discussed that may lead to practical provably-secure ciphers based on either of two assumptions that appear to be novel in cryptography, viz., the (sole) assumption that the enemy's memory capacity (but not his computing power) is restricted and the assumption that an explicit function is, in a specified sense, controllably-difficult to compute, but not necessarily one-way.
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
...
1
2
3
4
5
...