An O(sqrt(|v|) |E|) Algorithm for Finding Maximum Matching in General Graphs - Silvio Micali; Vijay V. Vazirani (FOCS, 1980)

Minimal Forms in lambda-Calculus Computations. - Corrado Böhm; Silvio Micali (J. Symb. Log., 1980)

Two-Way Deterministic Finite Automata are Exponentially More Succinct Than Sweeping Automata. - Silvio Micali (Inf. Process. Lett., 1981)

On Signatures and Authentication. - Shafi Goldwasser; Silvio Micali; Andrew Chi-Chih Yao (CRYPTO, 1982)

Priority Queues with Variable Priority and an O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs - Zvi Galil; Silvio Micali; Harold N. Gabow (FOCS, 1982)

Why and How to Establish a Private Code on a Public Network (Extended Abstract) - Shafi Goldwasser; Silvio Micali; Po Tong (FOCS, 1982)

Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information - Shafi Goldwasser; Silvio Micali (STOC, 1982)

How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin - Michael Luby; Silvio Micali; Charles Rackoff (FOCS, 1983)

Strong Signature Schemes - Shafi Goldwasser; Silvio Micali; Andrew Chi-Chih Yao (STOC, 1983)

On the Cryptographic Applications of Random Functions. - Oded Goldreich 001; Shafi Goldwasser; Silvio Micali (CRYPTO, 1984)

A "Paradoxical'"Solution to the Signature Problem (Abstract). - Shafi Goldwasser; Silvio Micali; Ronald L. Rivest (CRYPTO, 1984)

How to Construct Random Functions (Extended Abstract) - Oded Goldreich 001; Shafi Goldwasser; Silvio Micali (FOCS, 1984)

A "Paradoxical" Solution to the Signature Problem (Extended Abstract) - Shafi Goldwasser; Silvio Micali; Ronald L. Rivest (FOCS, 1984)

Probabilistic Encryption. - Shafi Goldwasser; Silvio Micali (J. Comput. Syst. Sci., 1984)

How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. - Manuel Blum 001; Silvio Micali (SIAM J. Comput., 1984)

Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract) - Benny Chor; Shafi Goldwasser; Silvio Micali; Baruch Awerbuch (FOCS, 1985)

Byzantine Agreement in Constant Expected Time (and Trusting No One) - Paul Feldman; Silvio Micali (FOCS, 1985)

A Fair Protocol for Signing Contracts (Extended Abstract). - Michael Ben-Or; Oded Goldreich 001; Silvio Micali; Ronald L. Rivest (ICALP, 1985)

The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract) - Shafi Goldwasser; Silvio Micali; Charles Rackoff (STOC, 1985)

How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design. - Oded Goldreich 001; Silvio Micali; Avi Wigderson (CRYPTO, 1986)

Dynamic deadlock resolution protocols (Extended Abstract) - Baruch Awerbuch; Silvio Micali (FOCS, 1986)

Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design (Extended Abstract) - Oded Goldreich 001; Silvio Micali; Avi Wigderson (FOCS, 1986)

Proofs that Release Minimum Knowledge. - Oded Goldreich 001; Silvio Micali; Avi Wigderson (MFCS, 1986)

Knowledge and Efficient Computation. - Silvio Micali (TARK, 1986)

How to construct random functions. - Oded Goldreich 001; Shafi Goldwasser; Silvio Micali (J. ACM, 1986)

An O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs. - Zvi Galil; Silvio Micali; Harold N. Gabow (SIAM J. Comput., 1986)

Non-Interactive Zero-Knowledge Proof Systems. - Alfredo De Santis; Silvio Micali; Giuseppe Persiano (CRYPTO, 1987)

How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority - Oded Goldreich 001; Silvio Micali; Avi Wigderson (STOC, 1987)

How To Sign Given Any Trapdoor Function. - Mihir Bellare; Silvio Micali (CRYPTO, 1988)

Everything Provable is Provable in Zero-Knowledge. - Michael Ben-Or; Oded Goldreich 001; Shafi Goldwasser; Johan Håstad; Joe Kilian; Silvio Micali; Phillip Rogaway (CRYPTO, 1988)

Proving Security Against Chosen Cyphertext Attacks. - Manuel Blum 001; Paul Feldman; Silvio Micali (CRYPTO, 1988)

Efficient, Perfect Random Number Generators. - Silvio Micali; Claus-Peter Schnorr (CRYPTO, 1988)

An Improvement of the Fiat-Shamir Identification and Signature Scheme. - Silvio Micali; Adi Shamir (CRYPTO, 1988)

Non-Interactive Zero-Knowledge with Preprocessing. - Alfredo De Santis; Silvio Micali; Giuseppe Persiano (CRYPTO, 1988)

How to Sign Given Any Trapdoor Function (Extended Abstract) - Mihir Bellare; Silvio Micali (STOC, 1988)

Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract) - Manuel Blum 001; Paul Feldman; Silvio Micali (STOC, 1988)

Optimal Algorithms for Byzantine Agreement - Paul Feldman; Silvio Micali (STOC, 1988)

A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. - Shafi Goldwasser; Silvio Micali; Ronald L. Rivest (SIAM J. Comput., 1988)

The Notion of Security for Probabilistic Cryptosystems. - Silvio Micali; Charles Rackoff; Bob Sloan (SIAM J. Comput., 1988)

Non-Interactive Oblivious Transfer and Applications. - Mihir Bellare; Silvio Micali (CRYPTO, 1989)

On-Line/Off-Line Digital Schemes. - Shimon Even; Oded Goldreich 001; Silvio Micali (CRYPTO, 1989)

Minimum Resource Zero-Knowledge Proofs (Extended Abstract). - Joe Kilian; Silvio Micali; Rafail Ostrovsky (CRYPTO, 1989)

An Optimal Probabilistic Algorithm For Synchronous Byzantine Agreement. - Paul Feldman; Silvio Micali (ICALP, 1989)

"Perfect" Pseudo-Random Number Generation. - Silvio Micali (IFIP Congress, 1989)

The Knowledge Complexity of Interactive Proof Systems. - Shafi Goldwasser; Silvio Micali; Charles Rackoff (SIAM J. Comput., 1989)

Collective Coin Tossing Without Assumptions nor Broadcasting. - Silvio Micali; Tal Rabin (CRYPTO, 1990)

The Round Complexity of Secure Protocols (Extended Abstract) - Donald Beaver; Silvio Micali; Phillip Rogaway (STOC, 1990)

Perfect Zero-Knowledge in Constant Rounds - Mihir Bellare; Silvio Micali; Rafail Ostrovsky (STOC, 1990)

The (True) Complexity of Statistical Zero Knowledge - Mihir Bellare; Silvio Micali; Rafail Ostrovsky (STOC, 1990)

A fair protocol for signing contracts. - Michael Ben-Or; Oded Goldreich 001; Silvio Micali; Ronald L. Rivest (IEEE Trans. Inf. Theory, 1990)

Secure Computation (Abstract). - Silvio Micali; Phillip Rogaway (CRYPTO, 1991)

Proofs that Yield Nothing But Their Validity for All Languages in NP Have Zero-Knowledge Proof Systems. - Oded Goldreich 001; Silvio Micali; Avi Wigderson (J. ACM, 1991)

Efficient, Perfect Polynomial Random Number Generators. - Silvio Micali; Claus-Peter Schnorr (J. Cryptol., 1991)

Noninteractive Zero-Knowledge. - Manuel Blum 001; Alfredo De Santis; Silvio Micali; Giuseppe Persiano (SIAM J. Comput., 1991)

Fair Public-Key Cryptosystems. - Silvio Micali (CRYPTO, 1992)

How to Sign Given Any Trapdoor Permutation. - Mihir Bellare; Silvio Micali (J. ACM, 1992)

Secret-Key Agreement without Public-Key Cryptography. - Frank Thomson Leighton; Silvio Micali (CRYPTO, 1993)

Reducibility and Completeness in Multi-Party Private Computations - Eyal Kushilevitz; Silvio Micali; Rafail Ostrovsky (FOCS, 1994)

CS Proofs (Extended Abstracts) - Silvio Micali (FOCS, 1994)

A Simple Method for Generating and Sharing Pseudo-Random Functions, with Applications to Clipper-like Escrow Systems. - Silvio Micali; Ray Sidney (CRYPTO, 1995)

Verifiable Secret Sharing as Secure Computation. - Rosario Gennaro; Silvio Micali (EUROCRYPT, 1995)

Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing. - Shai Halevi; Silvio Micali (CRYPTO, 1996)

On-Line/Off-Line Digital Signatures. - Shimon Even; Oded Goldreich 001; Silvio Micali (J. Cryptol., 1996)

A Secure Protocol for the Oblivious Transfer (Extended Abstract). - Michael J. Fischer; Silvio Micali; Charles Rackoff (J. Cryptol., 1996)

An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement. - Pesech Feldman; Silvio Micali (SIAM J. Comput., 1997)

Computationally-Sound Checkers. - Silvio Micali (MFCS, 1998)

More on Proofs of Knowledge. - Shai Halevi; Silvio Micali (IACR Cryptol. ePrint Arch., 1998)

Improving the Exact Security of Fiat-Shamir Signature Schemes. - Silvio Micali; Leonid Reyzin (CQRE, 1999)

The All-or-Nothing Nature of Two-Party Secure Computation. - Amos Beimel; Tal Malkin; Silvio Micali (CRYPTO, 1999)

Computationally Private Information Retrieval with Polylogarithmic Communication. - Christian Cachin; Silvio Micali; Markus Stadler (EUROCRYPT, 1999)

Lower Bounds for Oblivious Transfer Reductions. - Yevgeniy Dodis; Silvio Micali (EUROCRYPT, 1999)

Verifiable Random Functions. - Silvio Micali; Michael O. Rabin; Salil P. Vadhan (FOCS, 1999)

Interleaved Zero-Knowledge in the Public-Key Model. - Oded Goldreich 001; Shafi Goldwasser; Silvio Micali (Electron. Colloquium Comput. Complex., 1999)

Resettable Zero-Knowledge. - Ran Canetti; Oded Goldreich 001; Shafi Goldwasser; Silvio Micali (Electron. Colloquium Comput. Complex., 1999)

Parallel Reducibility for Information-Theoretically Secure Computation. - Yevgeniy Dodis; Silvio Micali (CRYPTO, 2000)

Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements. - Mihir Bellare; Alexandra Boldyreva; Silvio Micali (EUROCRYPT, 2000)

Resettable zero-knowledge (extended abstract). - Ran Canetti; Oded Goldreich 001; Shafi Goldwasser; Silvio Micali (STOC, 2000)

Identification Protocols Secure Against Reset Attacks. - Mihir Bellare; Marc Fischlin; Shafi Goldwasser; Silvio Micali (IACR Cryptol. ePrint Arch., 2000)

Reducibility and Completeness in Private Computations. - Joe Kilian; Eyal Kushilevitz; Silvio Micali; Rafail Ostrovsky (SIAM J. Comput., 2000)

Computationally Sound Proofs. - Silvio Micali (SIAM J. Comput., 2000)

Mutually Independent Commitments. - Moses D. Liskov; Anna Lysyanskaya; Silvio Micali; Leonid Reyzin; Adam D. Smith 001 (ASIACRYPT, 2001)

Accountable-subgroup multisignatures: extended abstract. - Silvio Micali; Kazuo Ohta; Leonid Reyzin (CCS, 2001)

Soundness in the Public-Key Model. - Silvio Micali; Leonid Reyzin (CRYPTO, 2001)

Min-round Resettable Zero-Knowledge in the Public-Key Model. - Silvio Micali; Leonid Reyzin (EUROCRYPT, 2001)

Amortized E-Cash. - Moses D. Liskov; Silvio Micali (Financial Cryptography, 2001)

Micropayments Revisited. - Silvio Micali; Ronald L. Rivest (CT-RSA, 2002)

Transitive Signature Schemes. - Silvio Micali; Ronald L. Rivest (CT-RSA, 2002)

Improving the Exact Security of Digital Signature Schemes. - Silvio Micali; Leonid Reyzin (J. Cryptol., 2002)

Plaintext Awareness via Key Registration. - Jonathan Herzog; Moses D. Liskov; Silvio Micali (CRYPTO, 2003)

Fractal Merkle Tree Representation and Traversal. - Markus Jakobsson; Frank Thomson Leighton; Silvio Micali; Michael Szydlo (CT-RSA, 2003)

Zero-Knowledge Sets. - Silvio Micali; Michael O. Rabin; Joe Kilian (FOCS, 2003)

Simple and fast optimistic protocols for fair electronic exchange. - Silvio Micali (PODC, 2003)

Sequential Aggregate Signatures from Trapdoor Permutations. - Anna Lysyanskaya; Silvio Micali; Leonid Reyzin; Hovav Shacham (IACR Cryptol. ePrint Arch., 2003)

Physically Observable Cryptography. - Silvio Micali; Leonid Reyzin (IACR Cryptol. ePrint Arch., 2003)

Completely fair SFE and coalition-safe cheap talk. - Matt Lepinski; Silvio Micali; Chris Peikert; Abhi Shelat (PODC, 2004)

Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering. - Rosario Gennaro; Anna Lysyanskaya; Tal Malkin; Silvio Micali; Tal Rabin (TCC, 2004)

Physically Observable Cryptography (Extended Abstract). - Silvio Micali; Leonid Reyzin (TCC, 2004)

Rational Secure Computation and Ideal Mechanism Design. - Sergei Izmalkov; Silvio Micali; Matt Lepinski (FOCS, 2005)

Collusion-free protocols. - Matt Lepinski; Silvio Micali; Abhi Shelat (STOC, 2005)

Fair-Zero Knowledge. - Matt Lepinski; Silvio Micali; Abhi Shelat (TCC, 2005)

Optimal Error Correction Against Computationally Bounded Noise. - Silvio Micali; Chris Peikert; Madhu Sudan 001; David A. Wilson (TCC, 2005)

Input-Indistinguishable Computation. - Silvio Micali; Rafael Pass; Alon Rosen (FOCS, 2006)

Local zero knowledge. - Silvio Micali; Rafael Pass (STOC, 2006)

Independent Zero-Knowledge Sets. - Rosario Gennaro; Silvio Micali (IACR Cryptol. ePrint Arch., 2006)

Online-Untransferable Signatures. - Moses D. Liskov; Silvio Micali (Public Key Cryptography, 2008)

Verifiably Secure Devices. - Sergei Izmalkov; Matt Lepinski; Silvio Micali (TCC, 2008)

A new approach to auctions and resilient mechanism design. - Jing Chen 017; Silvio Micali (STOC, 2009)

Purely Rational Secret Sharing (Extended Abstract). - Silvio Micali; Abhi Shelat (TCC, 2009)

Perfect concrete implementation of arbitrary mechanisms: a quick summary of joint work with Sergei Izmalkov and Matt Lepinski. - Silvio Micali (BQGT, 2010)

Robust Perfect Revenue From Perfectly Informed Players. - Jing Chen 017; Avinatan Hassidim; Silvio Micali (ICS, 2010)

Robustly Leveraging Collusion in Combinatorial Auctions. - Jing Chen 017; Silvio Micali; Paul Valiant (ICS, 2010)

Optimal Error Correction for Computationally Bounded Noise. - Silvio Micali; Chris Peikert; Madhu Sudan 001; David A. Wilson (IEEE Trans. Inf. Theory, 2010)

Crowdsourced Bayesian Auctions - (Abstract). - Pablo Daniel Azar; Jing Chen 017; Silvio Micali (AMMA, 2011)

Mechanism Design with Set-Theoretic Beliefs. - Jing Chen 017; Silvio Micali (FOCS, 2011)

Knightian Auctions - Alessandro Chiesa; Silvio Micali; Zeyuan Allen Zhu (CoRR, 2011)

Perfect implementation. - Sergei Izmalkov; Matt Lepinski; Silvio Micali (Games Econ. Behav., 2011)

Crowdsourced Bayesian auctions. - Pablo Azar 002; Jing Chen 017; Silvio Micali (ITCS, 2012)

Mechanism design with approximate valuations. - Alessandro Chiesa; Silvio Micali; Zeyuan Allen Zhu (ITCS, 2012)

Rational proofs. - Pablo Daniel Azar; Silvio Micali (STOC, 2012)

Collusive dominant-strategy truthfulness. - Jing Chen 017; Silvio Micali (J. Econ. Theory, 2012)

Parametric digital auctions. - Pablo Daniel Azar; Silvio Micali (ITCS, 2013)

Super-efficient rational proofs. - Pablo Daniel Azar; Silvio Micali (EC, 2013)

Optimal and Efficient Parametric Auctions. - Pablo Daniel Azar; Constantinos Daskalakis; Silvio Micali; S. Matthew Weinberg (SODA, 2013)

Rational and resilient protocols. - Silvio Micali (PODC, 2014)

Knightian self uncertainty in the vcg mechanism for unrestricted combinatorial auctions. - Alessandro Chiesa; Silvio Micali; Zeyuan Allen Zhu (EC, 2014)

Cryptography miracles, secure auctions, matching problem verification. - Silvio Micali; Michael O. Rabin (Commun. ACM, 2014)

Bridging Utility Maximization and Regret Minimization. - Alessandro Chiesa; Silvio Micali; Zeyuan Allen Zhu (CoRR, 2014)

Knightian Robustness from Regret Minimization. - Alessandro Chiesa; Silvio Micali; Zeyuan Allen Zhu (CoRR, 2014)

Knightian Analysis of the VCG Mechanism in Unrestricted Combinatorial Auctions. - Alessandro Chiesa; Silvio Micali; Zeyuan Allen Zhu (CoRR, 2014)

Knightian Robustness of Single-Parameter Domains. - Alessandro Chiesa; Silvio Micali; Zeyuan Allen Zhu (CoRR, 2014)

Knightian Robustness of the Vickrey Mechanism. - Alessandro Chiesa; Silvio Micali; Zeyuan Allen Zhu (CoRR, 2014)

Johnson-Lindenstrauss Compression with Neuroscience-Based Constraints. - Zeyuan Allen Zhu; Rati Gelashvili; Silvio Micali; Nir Shavit (CoRR, 2014)

The Query Complexity of Scoring Rules. - Pablo Daniel Azar; Silvio Micali (ACM Trans. Economics and Comput., 2014)

Better Outcomes from More Rationality. - Jing Chen 017; Silvio Micali; Rafael Pass (ITCS, 2015)

What it means to receive the Turing award. - Silvio Micali (Commun. ACM, 2015)

Democoin: A Publicly Verifiable and Jointly Serviced Cryptocurrency. - Sergey Gorbunov 001; Silvio Micali (IACR Cryptol. ePrint Arch., 2015)

Mechanism design with possibilistic beliefs. - Jing Chen 017; Silvio Micali (J. Econ. Theory, 2015)

Auction Revenue in the General Spiteful-Utility Model. - Jing Chen 017; Silvio Micali (ITCS, 2016)

Mechanisms With Costly Knowledge. - Atalay Mert Ileri; Silvio Micali (ITCS, 2016)

ALGORAND: The Efficient and Democratic Ledger. - Silvio Micali (CoRR, 2016)

Reconstructing Markov processes from independent and anonymous experiments. - Silvio Micali; Zeyuan Allen Zhu (Discret. Appl. Math., 2016)

Leveraging Possibilistic Beliefs in Unrestricted Combinatorial Auctions. - Jing Chen 017; Silvio Micali (Games, 2016)

Very Simple and Efficient Byzantine Agreement. - Silvio Micali (ITCS, 2017)

Collusion, efficiency, and dominant strategies. - Alan Deckelbaum; Silvio Micali (Games Econ. Behav., 2017)

Algorand: Scaling Byzantine Agreements for Cryptocurrencies. - Yossi Gilad; Rotem Hemo; Silvio Micali; Georgios Vlachos; Nickolai Zeldovich (IACR Cryptol. ePrint Arch., 2017)

ALGORAND AGREEMENT: Super Fast and Partition Resilient Byzantine Agreement. - Jing Chen 017; Sergey Gorbunov 001; Silvio Micali; Georgios Vlachos (IACR Cryptol. ePrint Arch., 2018)

Non-interactive zero-knowledge and its applications. - Manuel Blum 001; Paul Feldman; Silvio Micali (Providing Sound Foundations for Cryptography, 2019)

How to construct random functions. - Oded Goldreich 001; Shafi Goldwasser; Silvio Micali (Providing Sound Foundations for Cryptography, 2019)

How to generate cryptographically strong sequences of pseudo random bits. - Manuel Blum 001; Silvio Micali (Providing Sound Foundations for Cryptography, 2019)

Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. - Oded Goldreich 001; Silvio Micali; Avi Wigderson (Providing Sound Foundations for Cryptography, 2019)

How to play any mental game, or a completeness theorem for protocols with honest majority. - Oded Goldreich 001; Silvio Micali; Avi Wigderson (Providing Sound Foundations for Cryptography, 2019)

Probabilistic encryption & how to play mental poker keeping secret all partial information. - Shafi Goldwasser; Silvio Micali (Providing Sound Foundations for Cryptography, 2019)

The knowledge complexity of interactive proof-systems. - Shafi Goldwasser; Silvio Micali; Charles Rackoff (Providing Sound Foundations for Cryptography, 2019)

A "paradoxical" solution to the signature problem. - Shafi Goldwasser; Silvio Micali; Ronald L. Rivest (Providing Sound Foundations for Cryptography, 2019)

Algorand: A secure and efficient distributed ledger. - Jing Chen 017; Silvio Micali (Theor. Comput. Sci., 2019)

Compact Certificates of Collective Knowledge. - Silvio Micali; Leonid Reyzin; Georgios Vlachos; Riad S. Wahby; Nickolai Zeldovich (IACR Cryptol. ePrint Arch., 2020)