Silvio Micali | Academic Influence

Silvio Micali's AcademicInfluence.com Rankings

Silvio Micali

Computer Science

#145

World Rank

#152

Historical Rank

#87

USA Rank

Distributed Computing

#5

World Rank

#5

Historical Rank

#4

USA Rank

Database

#262

World Rank

#273

Historical Rank

#126

USA Rank

computer-science Degrees

Download Badge

Computer Science

Silvio Micali's Degrees

PhD Computer Science University of California, Berkeley

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2024

Why Is Silvio Micali Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Silvio Micali is an Italian computer scientist, professor at the Massachusetts Institute of Technology and the founder of Algorand, a proof-of-stake blockchain cryptocurrency protocol. Micali's research at the MIT Computer Science and Artificial Intelligence Laboratory centers on cryptography and information security.

(See a Problem?)

Silvio Micali's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The knowledge complexity of interactive proof-systems (1985) (3994)
How to play ANY mental game (1987) (3927)
Probabilistic Encryption (1984) (3161)
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks (1988) (2948)
How to construct random functions (1986) (2109)
How to generate cryptographically strong sequences of pseudo random bits (1982) (1496)
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (1991) (1407)
Algorand: Scaling Byzantine Agreements for Cryptocurrencies (2017) (1161)
Probabilistic encryption & how to play mental poker keeping secret all partial information (1982) (977)
Verifiable secret sharing and achieving simultaneity in the presence of faults (1985) (884)
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs (1980) (869)
Non-interactive zero-knowledge and its applications (2019) (776)
Computationally Private Information Retrieval with Polylogarithmic Communication (1999) (659)
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design (1986) (616)
The round complexity of secure protocols (1990) (605)
Verifiable random functions (1999) (547)
Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements (2000) (507)
On-line/off-line digital signatures (1996) (428)
Physically Observable Cryptography (Extended Abstract) (2004) (415)
Computationally Sound Proofs (2000) (388)
Non-Interactive Oblivious Transfer and Spplications (1989) (332)
Noninteractive Zero-Knowledge (1991) (328)
Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract) (1988) (322)
Sequential Aggregate Signatures from Trapdoor Permutations (2004) (315)
A fair protocol for signing contracts (1990) (291)
The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract) (1985) (284)
The Round Complexity of Secure Protocols (Extended Abstract) (1990) (272)
Optimal algorithms for Byzantine agreement (1988) (253)
Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing (1996) (239)
Everything Provable is Provable in Zero-Knowledge (1990) (237)
An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement (1997) (229)
Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering (2004) (218)
Secure Computation (Abstract) (1991) (211)
Accountable-subgroup multisignatures: extended abstract (2001) (202)
Resettable zero-knowledge (extended abstract) (2000) (197)
Simple and fast optimistic protocols for fair electronic exchange (2003) (189)
On the Cryptographic Applications of Random Functions (1984) (187)
The Notion of Security for Probabilistic Cryptosystems (1986) (185)
ALGORAND: The Efficient and Democratic Ledger (2016) (185)
Non-Interactive Zero-Knowledge Proof Systems (1987) (180)
How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design (1986) (175)
How to Construct Random Functions (Extended Abstract) (1984) (171)
Zero-knowledge sets (2003) (169)
Physically Observable Cryptography (2003) (167)
CS proofs (1994) (166)
Algorand: A secure and efficient distributed ledger (2019) (166)
Micropayments Revisited (2002) (164)
Resettable Zero-Knowledge (1999) (161)
Rational secure computation and ideal mechanism design (2005) (158)
Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs (1982) (158)
Non-Interactive Zero Knowledge (1990) (155)
Fair Public-Key Cryptosystems (1992) (153)
NOVOMODO : Scalable Certificate Validation and Simplified PKI Management (2002) (151)
CS Proofs (Extended Abstracts) (1994) (150)
On-Line/Off-Line Digital Schemes (1989) (144)
Transitive Signature Schemes (2002) (131)
Secret-Key Agreement without Public-Key Cryptography (1993) (119)
Accountable-Subgroup Multisignatures (2001) (117)
Fractal Merkle Tree Representation and Traversal (2003) (113)
Identification Protocols Secure against Reset Attacks (2001) (106)
Soundness in the Public-Key Model (2001) (103)
Perfect zero-knowledge in constant rounds (1990) (102)
Completely fair SFE and coalition-safe cheap talk (2004) (99)
How to sign given any trapdoor function (1988) (91)
How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin (1983) (90)
Collusion-free protocols (2005) (89)
Why and how to establish a private code on a public network (1982) (87)
Improving the exact security of digital signature schemes (2002) (85)
Plaintext Awareness via Key Registration (2003) (82)
The (true) complexity of statistical zero knowledge (1990) (79)
An Improvement of the Fiat-Shamir Identification and Signature Scheme (1988) (76)
Optimal Error Correction Against Computationally Bounded Noise (2005) (74)
The All-or-Nothing Nature of Two-Party Secure Computation (1999) (68)
An O(sqrt(|v|) |E|) Algorithm for Finding Maximum Matching in General Graphs (1980) (67)
Local zero knowledge (2006) (65)
Eecient Certiicate Revocation (1996) (65)
Parallel Reducibility for Information-Theoretically Secure Computation (2000) (64)
Non-Interactive Zero-Knowledge with Preprocessing (1988) (64)
Minimum resource zero knowledge proofs (1989) (63)
How to sign given any trapdoor permutation (1992) (60)
Reducibility and completeness in multi-party private computations (1994) (60)
How To Construct Randolli Functions (1984) (60)
ALGORAND AGREEMENT: Super Fast and Partition Resilient Byzantine Agreement (2018) (59)
Optimal and Efficient Parametric Auctions (2013) (58)
Input-Indistinguishable Computation (2006) (56)
Verifiable Secret Sharing as Secure Computation (1994) (55)
Strong signature schemes (1983) (55)
Reducibility and Completeness in Private Computations (2000) (55)
A Simple Method for Generating and Sharing Pseudo-Random Functions, with Applications to Clipper-like Escrow Systems (1995) (52)
A "Paradoxical" Solution to the Signature Problem (Extended Abstract) (1984) (51)
Lower Bounds for Oblivious Transfer Reductions (1999) (50)
A "Paradoxical'"Solution to the Signature Problem (Abstract) (1984) (46)
Purely Rational Secret Sharing (Extended Abstract) (2009) (43)
Two-Way Deterministic Finite Automata are Exponentially More Succinct Than Sweeping Automata (1981) (39)
Sparse sign-consistent Johnson–Lindenstrauss matrices: Compression with neuroscience-based constraints (2014) (38)
Fair cryptosystems (1994) (38)
An Optimal Probabilistic Algorithm For Synchronous Byzantine Agreement (1989) (38)
Verifiably Secure Devices (2008) (38)
Min-round Resettable Zero-Knowledge in the Public-Key Model (2001) (37)
The Order Independence of Iterated Dominance in Extensive Games, with Connections to Mechanism Design and Backward Induction (2012) (37)
Independent Zero-Knowledge Sets (2006) (36)
Rational proofs (2012) (34)
Efficient, Perfect Random Number Generators (1988) (34)
Byzantine Agreement in Constant Expected Time (and Trusting No One) (1985) (33)
On Play by Means of Computing Machines (Preliminary Version).@@@A Theory of Higher Order Probabilities.@@@Knowledge and Efficient Computation.@@@Realizability Semantics for Error-Tolerant Logics (Preliminary Version). (1988) (31)
Reconstructing Markov processes from independent and anonymous experiments (2016) (30)
Proving Security Against Chosen Cyphertext Attacks (1988) (30)
Advances in Computing Research: The Theory of Databases (1986) (29)
Secret-key agreement without public-key (1994) (28)
Efficient, perfect polynomial random number generators (2004) (28)
Fair-Zero Knowledge (2005) (28)
Enhanced Certificate Revocation System (1995) (28)
A secure protocol for the oblivious transfer (extended abstract) (1996) (26)
Byzantine agreement in constant expected time (1985) (25)
Minimum Resource Zero-Knowledge Proofs (Extended Abstract) (1989) (24)
A Fair Protocol for Signing Contracts (Extended Abstract) (1985) (24)
Byzantine Agreement , Made Trivial (2017) (23)
Perfect implementation (2011) (21)
Collusive dominant-strategy truthfulness (2012) (21)
Parametric digital auctions (2013) (21)
Optimal and Player-Replaceable Consensus with an Honest Majority (2017) (21)
Knowledge and Efficient Computation (1986) (20)
Cryptography miracles, secure auctions, matching problem verification (2014) (20)
Very Simple and Efficient Byzantine Agreement (2017) (20)
Crowdsourced Bayesian auctions (2012) (19)
Minimum resource zero-knowledge proofs (extended abstracts) (1989) (18)
Mechanism design with approximate valuations (2012) (18)
Robust Perfect Revenue From Perfectly Informed Players (2010) (18)
Dynamic deadlock resolution protocols (1986) (18)
Collective Coin Tossing Without Assumptions nor Broadcasting (1990) (17)
A "paradoxical" solution to the signature problem (2019) (17)
Optimal Error Correction for Computationally Bounded Noise (2010) (16)
Mutually Independent Commitments (2001) (16)
A new approach to auctions and resilient mechanism design (2009) (15)
Knightian Analysis of the Vickrey Mechanism (2014) (15)
A Digital Signature Scheme Secure Against Adaptive Chosen Message Attack*: Extended Abstract (1987) (15)
More on Proofs of Knowledge (1998) (15)
Tight Revenue Bounds With Possibilistic Beliefs and Level‐k Rationality (2015) (14)
Democoin: A Publicly Verifiable and Jointly Serviced Cryptocurrency (2015) (13)
Mechanism design with possibilistic beliefs (2015) (13)
A history of the PCP Theorem (2005) (13)
Perfect Implementation of Normal-Form Mechanisms (2007) (12)
Mechanism Design with Set-Theoretic Beliefs (2011) (12)
Revenue in Truly Combinatorial Auctions and Adversarial Mechanism Design (2007) (11)
Cryptographically Strong Sequences Of Pseudo Random Bits (1982) (10)
Leveraging Collusion In Combinatorial Auctions (2009) (10)
Robustly Leveraging Collusion in Combinatorial Auctions (2010) (10)
Johnson-Lindenstrauss Compression with Neuroscience-Based Constraints (2014) (9)
Secret-Key Agreement without Public-Key Cryptography (Extended Abstract) (1994) (9)
Knightian self uncertainty in the vcg mechanism for unrestricted combinatorial auctions (2014) (8)
Interleaved Zero-Knowledge in the Public-Key Model (1999) (8)
Collusion, efficiency, and dominant strategies (2017) (8)
Online-Untransferable Signatures (2008) (7)
Resilient Mechanisms For Truly Combinatorial Auctions (2008) (6)
Computational principal–agent problems (2018) (5)
Improving the Exact Security of Fiat-Shamir Signature Schemes (1999) (5)
Optimal Parametric Auctions (2012) (5)
On Signatures and Authentication (1982) (4)
Precise Zero Knowledge (2011) (4)
Knightian Robustness of the Vickrey Mechanism (2014) (4)
How to Solve any Protocol (1987) (4)
Bridging Utility Maximization and Regret Minimization (2013) (4)
Amortized E-Cash (2002) (4)
Knightian Robustness from Regret Minimization (2014) (3)
Precise Cryptography (2007) (3)
Auction Revenue in the General Spiteful-Utility Model (2016) (3)
Knightian Robustness of Single-Parameter Domains (2014) (3)
Knightian Analysis of the VCG Mechanism in Unrestricted Combinatorial Auctions (2014) (3)
Collusion-Resilient Revenue In Combinatorial Auctions (2007) (3)
Possibilistic Beliefs and Higher-Level Rationality (2014) (3)
Proofs that Release Minimum Knowledge (1986) (3)
Rational Robustness for Mechanism Design (2009) (3)
Rational Robustness for Mechanism Design ( First Draft ) (2009) (2)
Computationally-Sound Checkers (1998) (2)
Algorand the Efficient Public Ledger (2)
Minimal forms in λ-cakulus computations (1980) (2)
Transparent Computation and Correlated Equilibrium ∗ (2007) (2)
On the Existance of 3-Round Zero-Knowledge Proof Systems (2001) (2)
Achieving Privacy and Trust In Mediated Normal-Form Mechanisms (2008) (2)
Resilient Knowledge-Based Mechanisms For Truly Combinatorial Auctions (And Implementation in Surviving Strategies) (2008) (2)
Removing interaction from zero-knowledge proofs (1990) (2)
Crowdsourced Bayesian Auctions - (Abstract) (2011) (1)
Resilient Mechanism Design Foundations for Governance of Cyberspace: Exploration in Theory, Strategy, and Policy (2013) (1)
Knightian Auctions (2011) (1)
Leveraging Possibilistic Beliefs in Unrestricted Combinatorial Auctions (2016) (1)
Perfect concrete implementation of arbitrary mechanisms: a quick summary of joint work with Sergei Izmalkov and Matt Lepinski (2010) (1)
A Useful Homomorphic Encryption Method (2009) (1)
On Play by Means of Computing Machines .A Theory of Higher Order Probabilities.Knowledge and Efficient Computation.Realizability Semantics for Error-Tolerant Logics (1988) (1)
How To Sign Given Any Trapdoor Function (extended abstract) (1988) (1)
Signing with Partially Adversarial Hashing (1998) (1)
Rational and resilient protocols (2014) (1)
What it means to receive the Turing award (2014) (1)
Mechanism Design With Approximate Player Types (2011) (1)
1st Annual PKI Research Workshop---Proceedings (2002) (1)
An O{VTVT· IE I) Algorithm. for Finding lIaDmum Matching in General Graphs (1980) (1)
Compact Certificates of Collective Knowledge (2021) (1)
The Query Complexity of Scoring Rules (2014) (1)
Knowledge Benchmarks in Adversarial Mechanism Design and Implementation in Surviving Strategies ( Part I ) (2008) (0)
Computationally-Sound Proofs (1995) (0)
Proof According to Silvio (2007) (0)
Resilient Provision of a Public Good (2008) (0)
Mechanisms With Costly Knowledge (2016) (0)
The Efficient Public Ledger (0)
Negociations electroniques ideales (1997) (0)
A method to identify a person by means of authority proof (1990) (0)
Testing Symmetric Properties of Distributions by Paul Valiant (2009) (0)
Better Outcomes from More Rationality (2015) (0)
1 . 1 The Goal of Maximum Privacy ( and Minimum Trust ) (2010) (0)
Multi-Unit Auction Revenue with Possibilistic Beliefs (2017) (0)
Key Escrow Cryptosystems (1995) (0)
1 . 1 A Set-Theoretic Model of Incomplete Information (2011) (0)
Transactions electroniques simultanees (1996) (0)
Transitive Transfer of Conndence: a Per- Fect Zero-knowledge Interactive Proto- Col for Sat and Beyond. 5.1 Additional Security for the User (1997) (0)
"Perfect" Pseudo-Random Number Generation (1989) (0)
2 A Characterization of Constant-Round Rational Proofs (2011) (0)
NON-INTERACTIVE q ZERO KNOWLEDGE DTIC (0)
Conservative-Bayesian Mechanisms (2010) (0)
Knowledge Benchmarks in Adversarial Mechanism Design (Part I) and Implementation in Surviving Strategies (Part I) (2008) (0)
Acknowledgements: I'd like to Thank the Anonymous Referees for Several Enlightening Comments, Benny Chor for Suggesting This Area of Research, Josh Benaloh for His Help and Yuval Ishai for His Usual Insights. References (1999) (0)
A Social-Welfare Optimal Probabilistic Mechanism for Knightian Single-Good Auctions (2012) (0)
Leveraging Player Knowledge in Combinatorial Auctions (and Implementation in Surviving Strategies) (2008) (0)
Epistemic Implementation and The Arbitrary-Belief Auction (2012) (0)
2 Prior Problems and Concerns (0)
MUTUALLY INDEPENDENT COMMITMENT (2001) (0)
ALGORAND the distributed ledger for the borderless economy (2019) (0)
Delegating Computation on Costly Data (2015) (0)
Computer Science and Artificial Intelligence Laboratory Subcontracted Rational SFE (2005) (0)
The Security Power of the Ballot Box Matt Lepinski and (2005) (0)
Perfect Implementation Accessed Terms of Use Perfect Implementation (2010) (0)
Resilient Auctions of One Good in Limited Supply (2008) (0)
Improvements in Probabilistic Micropayment Schemes (2004) (0)
Access control area. (2004) (0)
Testing Symmetric Properties of Distributions Jul 0 1 2008 Librarifs Testing Symmetric Properties of Distributions (2009) (0)
Apparatus and method for personal identification. (1989) (0)
A Necessity of Shared Randomness 5 Final Remarks (1997) (0)
United States Patent 19 Micali 54 SIMULTANEOUSELECTRONIC TRANSACTIONS 76 Inventor : (2017) (0)
Perfect and General Virtual Implementation For Perfectly Informed Players (2009) (0)
Subcontracted Rational SFE (2005) (0)
A Digital Signature Scheme Secure Against Adaptive Chosen Message Attack**This research was supported by NSF grant MCS-80-06938, an IBM/MIT Faculty Development Award, and DARPA contract N00014-85-K-0125. (1987) (0)
A Stronger Notion of Proofs of Knowledge (2007) (0)
Conservative-Bayesian Mechanism Design (2010) (0)
Resilient Provision of a Public and/or Private Good, or: Resilient Auctions of One Good in Unlimited Supply (2008) (0)
Byzantine Agreement , Made Trivial Silvio Micali (2018) (0)
Probabilistic encryption goldwasser pdf (2015) (0)
Verifiable Random Functions The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters (2009) (0)
Conservative Rationalizability and The Second-Knowledge Mechanism (2010) (0)
New Resiliency in Truly Combinatorial Auctions (and Implementation in Surviving Strategies) (2008) (0)
Dynamic deadlock resolution protocols (Extended Abstract) (1986) (0)
Collusion-Resilient Truly Combinatorial Auctions , Player-Knowledge Benchmarks , and Equilibrium-Less Solution Concepts (2009) (0)

This paper list is powered by the following services:

Other Resources About Silvio Micali

What Schools Are Affiliated With Silvio Micali?

Silvio Micali is affiliated with the following schools:

Image Attributions

Image Source for Silvio Micali