Silvio Micali is an MIT computer scientist and cryptographer whose work with collaborators helped formalize probabilistic encryption, zero-knowledge proofs, and verifiable random functions. He shared the 2012 ACM A.M. Turing Award with Shafi Goldwasser and founded Algorand in 2017.
Academic Background
Micali studied mathematics at the University of Rome, earning his degree in 1978. He completed a PhD in computer science at the University of California, Berkeley, in 1982 under Manuel Blum, then joined MIT’s faculty in 1983. MIT lists his research areas as cryptography, zero knowledge, pseudorandom generation, secure protocols, mechanism design, and blockchain.
Contributions to Cryptography
With Shafi Goldwasser, Micali developed probabilistic encryption: a public-key encryption approach in which randomness makes repeated encryptions of the same message look different. Their work helped make security definitions precise by asking what information an efficient attacker could learn from ciphertexts.
Micali, Goldwasser, and Charles Rackoff developed interactive-proof theory and foundational zero-knowledge work. These protocols let a prover convince a verifier that a statement is true while revealing no additional information beyond what the proof establishes. This is a general cryptographic concept; it does not mean every system using a zero-knowledge proof is automatically private or secure.
With Michael Rabin and Salil Vadhan, Micali introduced verifiable random functions (VRFs). A VRF produces a pseudorandom output and a proof that others can verify, while keeping the output unpredictable to parties without the secret key. Algorand later used VRFs in its committee-selection design.
Algorand
Micali founded Algorand in 2017 with a team of cryptographers and engineers. The network’s Pure Proof-of-Stake design uses a VRF-based process to select block proposers and committee members. Selected participants can prove they were selected, while outsiders cannot predict the selection in advance. These are protocol design goals described by Algorand; they are not guarantees that a transaction-speed figure will hold under every real-world condition.
Micali’s research and Algorand’s engineering are related but distinct: his research contributed cryptographic tools, while the network applies them within a larger consensus protocol.
Key Dates
- 1978: Earned a mathematics degree from the University of Rome.
- 1982: Completed his PhD in computer science at UC Berkeley.
- 1983: Joined MIT’s faculty.
- 1984: Goldwasser and Micali’s “Probabilistic Encryption” appeared in the Journal of Computer and System Sciences.
- 1985: Goldwasser, Micali, and Rackoff presented foundational work on interactive proofs and zero knowledge.
- 1999: Micali, Rabin, and Vadhan published “Verifiable Random Functions.”
- 2012: Shared the ACM A.M. Turing Award with Shafi Goldwasser.
- 2017: Founded Algorand.
Related Terms
See Also
- What Are Zero-Knowledge Proofs? — explains the proof system Micali helped develop.
- Is Ethereum Staking Making the Network More Centralized? — compares design trade-offs in stake-based consensus.
- Are Layer 2 Networks Actually Decentralized? — explores decentralization across blockchain architectures.
Swap crypto with ChangeNOW.
Sources
- MIT CSAIL: Silvio Micali — confirms his MIT faculty role, research areas, and founding of Algorand in 2017.
- ACM A.M. Turing Award: Silvio Micali — covers his education, 2012 award, and collaborative contributions to cryptography.
- Goldwasser and Micali, “Probabilistic Encryption” (1984) — the journal paper introducing a formal probabilistic encryption model.
- Goldwasser, Micali, and Rackoff, “The Knowledge Complexity of Interactive Proof Systems” — foundational work on interactive proofs and zero knowledge.
- Micali, Rabin, and Vadhan, “Verifiable Random Functions” (1999) — defines the verifiable, unpredictable function later used in protocols.
- Algorand: Founding Story — describes the project’s 2017 origins and development of Pure Proof-of-Stake.
- Algorand: Pure Proof-of-Stake — explains VRF-based proposer and committee selection.