• Publications
  • Influence
Probabilistic Encryption
A new probabilistic model of data encryption is introduced. For this model, under suitable complexity assumptions, it is proved that extracting any information about the cleartext from the cyphertextExpand
  • 2,777
  • 227
  • PDF
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
TLDR
We present a digital signature scheme based on the computational difficulty of integer factorization. Expand
  • 2,762
  • 176
  • PDF
How to play ANY mental game
TLDR
We present a polynomial-time algorithm that, given as a input the description of a game with incomplete information and any number of players, produces a protocol for playing the game that leaks no partial information, provided the majority of the players is honest. Expand
  • 2,989
  • 153
  • PDF
How to construct random functions
TLDR
A constructive theory of randomness for functions, based on computational complexity, is developed, and a pseudorandom function generator is presented. Expand
  • 1,830
  • 120
  • PDF
Algorand: Scaling Byzantine Agreements for Cryptocurrencies
TLDR
Algorand is a new cryptocurrency that confirms transactions with latency on the order of a minute while scaling to many users. Expand
  • 611
  • 111
  • PDF
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
TLDR
In this paper the generality and wide applicability of Zero-knowledge proofs, a notion introduced by Goldwasser, Micali, and Rackoff is demonstrated. Expand
  • 1,305
  • 92
  • PDF
The knowledge complexity of interactive proof-systems
TLDR
Permission to copy without fee all or part of this material is granted provided that the copies arc not made or distributed for direct commercial advantage, and notice is given that copying is by permission of the Association for Computing Machinery. Expand
  • 2,302
  • 91
  • PDF
How to play any mental game, or a completeness theorem for protocols with honest majority
TLDR
Permission to copy without fee all or part of this material is granted provided that the copies are not made or Idistributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machimery. Expand
  • 645
  • 84
How to generate cryptographically strong sequences of pseudo random bits
  • M. Blum, S. Micali
  • Mathematics, Computer Science
  • 23rd Annual Symposium on Foundations of Computer…
  • 16 November 1984
TLDR
We give a set of conditions that allow one to generate 50–50 unpredictable bits.Based on those conditions, we present a general algorithmic scheme for constructing polynomial-time deterministic algorithms that stretch a short secret random input into a long sequence of unpredictable pseudo-random bits. Expand
  • 1,298
  • 74
  • PDF
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
  • S. Micali, V. Vazirani
  • Mathematics, Computer Science
  • 21st Annual Symposium on Foundations of Computer…
  • 13 October 1980
TLDR
In this paper we present an 0(√|V|¿|E|) algorithm for finding a maximum matching in general graphs. Expand
  • 865
  • 63