• 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. ThisExpand
  • 434
  • 40
  • PDF
Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free
TLDR
We give natural stronger definitions of secrecy capacity and secret-key rate, requiring that the adversary obtains virtually no information about the entire key. Expand
  • 467
  • 33
  • PDF
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
TLDR
We show that verifiable secret sharing (VSS) and secure multi-party computation among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) for the players, provided that the access structure of the LSSS allows MPC or VSS at all. Expand
  • 453
  • 33
Modelling a Public-Key Infrastructure
  • U. Maurer
  • Computer Science
  • ESORICS
  • 25 September 1996
TLDR
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. Expand
  • 355
  • 32
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. Expand
  • 850
  • 27
  • PDF
Secret key agreement by public discussion from common information
  • U. Maurer
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 1 May 1993
TLDR
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. Expand
  • 458
  • 25
  • PDF
Conditionally-perfect secrecy and a provably-secure randomized cipher
  • U. Maurer
  • Mathematics, Computer Science
  • Journal of Cryptology
  • 3 January 1992
TLDR
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 a randomized cipher in which the secretkey is short but the plain text can be very long. Expand
  • 253
  • 19
Secret key agreement by public discussion
  • 129
  • 18
Unconditional Security Against Memory-Bounded Adversaries
TLDR
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 limited. Expand
  • 169
  • 17
  • PDF
A universal statistical test for random bit generators
  • U. Maurer
  • Mathematics, Computer Science
  • Journal of Cryptology
  • 1 March 1992
TLDR
A new statistical test for random bit generators is presented which, in contrast to presently used statistical tests, is universal in the sense that it can detect any significant deviation of a device's output statistics from the statistics of a truly random bit source when the device can be modeled as an ergodic stationary source with finite memory but arbitrary transition probabilities. Expand
  • 209
  • 16