Silvio Micali

Silvio Micali (born October 13, 1954) is an Italian computer scientist at MIT Computer Science and Artificial Intelligence Laboratory and a professor of computer science in MIT's Department of Electrical Engineering and Computer Science since 1983. His research centers on the theory of cryptography and information security.[4][5][6][7][8][9][10][11][12][13][14][15]

Silvio Micali
Born (1954-10-13) October 13, 1954
Alma materLa Sapienza University of Rome
University of California, Berkeley (PhD)
Known forGoldwasser–Micali cryptosystem
Zero-knowledge proof[1]
Pseudorandom Functions
Scientific career
FieldsComputer Science
InstitutionsMIT Computer Science and Artificial Intelligence Laboratory
ThesisRandomness versus Hardness (1983)
Doctoral advisorManuel Blum[2]
Doctoral students

Micali won Turing award together with Shafi Goldwasser in 2012.[16]

Micali has been on the faculty at MIT, Electrical Engineering and Computer Science Department, since 1983. His research interests are cryptography, zero knowledge, pseudorandom generation, secure protocols, and mechanism design.

In 2017, Micali founded Algorand, a fully decentralized, secure, and scalable blockchain which provides a common platform for building products and services for a decentralized economy. At Algorand, he oversees all research, including theory, security and crypto finance.

Micali is the recipient of the Turing Award (in computer science), of the Gödel Prize (in theoretical computer science) and the RSA prize (in cryptography). He is a member of the National Academy of Sciences, the National Academy of Engineering, and the American Academy of Arts and Sciences.


Micali graduated in mathematics at La Sapienza University of Rome in 1978 and earned a Ph.D. degree in computer science from the University of California, Berkeley in 1982;[17] for research supervised by Manuel Blum.[2]


Micali is best known for some of his fundamental early work on public-key cryptosystems, pseudorandom functions, digital signatures, oblivious transfer, secure multiparty computation, and is one of the co-inventors of zero-knowledge proofs.[18] His former doctoral students include Mihir Bellare, Bonnie Berger, Shai Halevi, Rafail Ostrovsky, Rafael Pass, Chris Peikert, and Phillip Rogaway.[2][3]

Awards and honors

Micali won the Gödel Prize in 1993.[19] In 2007, he was selected to be a member of the National Academy of Sciences and a Fellow of the International Association for Cryptologic Research (IACR). He is also a member of the National Academy of Engineering and the American Academy of Arts and Sciences.[20] He received the Turing Award[1] for the year 2012 along with Shafi Goldwasser for their work in the field of cryptography.[21] In 2015 the University of Salerno acknowledged his studies by giving him an honoris causa degree in Computer Science. He was elected as an ACM Fellow in 2017.[22]


  1. Savage, Neil (2013). "Proofs probable: Shafi Goldwasser and Silvio Micali laid the foundations for modern cryptography, with contributions including interactive and zero-knowledge proofs". Communications of the ACM. 56 (6): 22. doi:10.1145/2461256.2461265.
  2. Silvio Micali at the Mathematics Genealogy Project
  3. "CV" (PDF).
  4. Fischer, M. J.; Micali, S.; Rackoff, C. (1996). "A secure protocol for the oblivious transfer (extended abstract)". Journal of Cryptology. 9 (3). doi:10.1007/BF00208002.
  5. Goldreich, O.; Micali, S.; Wigderson, A. (July 1991). "Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems" (PDF). Journal of the ACM. 38 (3): 690. doi:10.1145/116825.116852.
  6. Blum, M.; De Santis, A.; Micali, S.; Persiano, G. (1991). "Noninteractive Zero-Knowledge" (PDF). SIAM Journal on Computing. 20 (6): 1084. doi:10.1137/0220068.
  7. Ben-Or, M.; Goldreich, O.; Micali, S.; Rivest, R. L. (1990). "A fair protocol for signing contracts" (PDF). IEEE Transactions on Information Theory. 36: 40. doi:10.1109/18.50372.
  8. Goldwasser, S.; Micali, S.; Rackoff, C. (1989). "The Knowledge Complexity of Interactive Proof Systems" (PDF). SIAM J. Comput. 18 (1): 186–208. doi:10.1137/0218012.
  9. Goldwasser, S.; Micali, S.; Rivest, R. L. (1988). "A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks". SIAM Journal on Computing. 17 (2): 281. CiteSeerX doi:10.1137/0217017.
  10. Micali, S.; Rackoff, C.; Sloan, B. (1988). "The Notion of Security for Probabilistic Cryptosystems". SIAM Journal on Computing. 17 (2): 412. doi:10.1137/0217025.
  11. Goldreich, O.; Micali, S.; Wigderson, A. (1987). "How to play ANY mental game". Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87. pp. 218–229. doi:10.1145/28395.28420. ISBN 0897912217.
  12. Goldwasser, S.; Micali, S. (1984). "Probabilistic encryption". Journal of Computer and System Sciences. 28 (2): 270. doi:10.1016/0022-0000(84)90070-9.
  13. Blum, Manuel; Micali, Silvio (1984). "How to Generate Cryptographically Strong Sequences of Pseudorandom Bits" (PDF). SIAM Journal on Computing. 13 (4): 850. doi:10.1137/0213053.
  14. Silvio Micali at DBLP Bibliography Server
  15. Silvio Micali author profile page at the ACM Digital Library
  16. "Silvio Micali - A.M. Turing Award Laureate".
  17. "Silvio's Home Page". Retrieved 2018-03-12.
  18. Blum, M.; Feldman, P.; Micali, S. (1988). "Non-interactive zero-knowledge and its applications". Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88. p. 103. doi:10.1145/62212.62222. ISBN 0897912640.
  19. "1993 Gödel Prize". Archived from the original on 2015-12-08. Retrieved 2018-04-21.
  20. "MIT CSAIL Theory of Computation". Retrieved 2018-03-12.
  21. "Goldwasser, Micali Receive ACM Turing Award for Advances in Cryptography". ACM. Archived from the original on 16 March 2013. Retrieved 13 March 2013.
  22. ACM Recognizes 2017 Fellows for Making Transformative Contributions and Advancing Technology in the Digital Age, Association for Computing Machinery, December 11, 2017, retrieved 2017-11-13
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.