Sotabase

Career

· Founder, Algorand Inc.2017–
· Chief Scientist, CoreStreet Ltd2001–2009
· Ford Professor of Engineering, Massachusetts Institute of Technology (MIT)1983–
· Researcher / Post-doctoral Fellow, University of Toronto1982–1983
· PhD in Computer Science, University of California, Berkeley1978–1982
· Laurea in Mathematics, La Sapienza University of Rome1973–1978
· Faculty Member, University of Pennsylvania

Publications (474)

The Knowledge Complexity of Interactive Proof Systems
SIAM journal on computing (Print) · 1989
4,690
cited
How to play ANY mental game
Symposium on the Theory of Computing · 1987
4,497
cited
Probabilistic Encryption
Journal of computer and system sciences (Print) · 1984
3,306
cited
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
SIAM journal on computing (Print) · 1988
3,016
cited
How to construct random functions
JACM · 1986
2,301
cited
Algorand: Scaling Byzantine Agreements for Cryptocurrencies
IACR Cryptology ePrint Archive · 2017
1,693
cited
How to generate cryptographically strong sequences of pseudo random bits
23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · 1982
1,573
cited
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
JACM · 1991
1,535
cited
Non-interactive zero-knowledge and its applications
Symposium on the Theory of Computing · 1988
1,144
cited
Probabilistic encryption & how to play mental poker keeping secret all partial information
Symposium on the Theory of Computing · 1982
1,062
cited
Verifiable secret sharing and achieving simultaneity in the presence of faults
26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · 1985
975
cited
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
21st Annual Symposium on Foundations of Computer Science (sfcs 1980) · 1980
789
cited
Verifiable random functions
40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · 1999
759
cited
Computationally Private Information Retrieval with Polylogarithmic Communication
International Conference on the Theory and Application of Cryptographic Techniques · 1999
705
cited
The round complexity of secure protocols
Symposium on the Theory of Computing · 1990
683
cited
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
27th Annual Symposium on Foundations of Computer Science (sfcs 1986) · 1986
637
cited
Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements
International Conference on the Theory and Application of Cryptographic Techniques · 2000
543
cited
The knowledge complexity of interactive proof-systems
Symposium on the Theory of Computing · 1985
464
cited
Computationally Sound Proofs
SIAM journal on computing (Print) · 2000
461
cited
On-line/off-line digital signatures
Journal of Cryptology · 1996
449
cited
Sotabase
Silvio Micali | Researcher Profile | Sotabase | Sotabase