• Publications
  • Influence
Probabilistic Encryption
It is proved that extracting any information about the cleartext from the cyphertext is hard on the average for an adversary with polynomially bounded computational resources.
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
A digital signature scheme based on the computational difficulty of integer factorization possesses the novel property of being robust against an adaptive chosen-message attack: an adversary who receives signatures for messages of his choice cannot later forge the signature of even a single additional message.
How to play ANY mental game
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
Algorand: Scaling Byzantine Agreements for Cryptocurrencies
Experimental results show that Algorand confirms transactions in under a minute, achieves 125x Bitcoin's throughput, and incurs almost no penalty for scaling to more users.
How to construct random functions
A constructive theory of randomness for functions, based on computational complexity, is developed, and a pseudorandom function generator is presented that has applications in cryptography, random constructions, and complexity theory.
The knowledge complexity of interactive proof-systems
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. rhe ACM copyright notice and the title of
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
In this paper the generality and wide applicability of Zero-knowledge proofs, a notion introduced by Goldwasser, Micali, and Rackoff is demonstrated. These are probabilistic and interactive proofs
How to play any mental game, or a completeness theorem for protocols with honest majority
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
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
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 is presented.
Verifiable random functions
This work efficiently combines unpredictability and verifiability by extending the Goldreich-Goldwasser-Micali (1986) construction of pseudorandom functions f/sub s/ from a secret seed s to provide an NP-proof that the value f/ sub s/(x) is indeed correct without compromising the unpredictability of f/ Sub s/ at any other point for which no such a proof was provided.