Silvio Micali

Affiliations:
  • Massachusetts Institute of Technology (MIT), Computer Science and Artificial Intelligence Laboratory (CSAIL), Cambridge, MA, USA
  • University of California at Berkeley, CA, USA (PhD 1983)


According to our database1, Silvio Micali authored at least 156 papers between 1980 and 2020.

Collaborative distances:

Awards

Turing Prize recipient

Turing Prize 2012, "For transformative work that laid the complexity-theoretic foundations for the science of cryptography and in the process pioneered new methods for efficient verification of mathematical proofs in complexity theory." awarded to Silvio Micali and Shafi Goldwasser.

ACM Fellow

ACM Fellow 2017, "For transformative work that laid the complexity-theoretic foundations for the science of cryptography".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Compact Certificates of Collective Knowledge.
IACR Cryptol. ePrint Arch., 2020

2019
Algorand: A secure and efficient distributed ledger.
Theor. Comput. Sci., 2019

A "paradoxical" solution to the signature problem.
Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019

The knowledge complexity of interactive proof-systems.
Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019

Probabilistic encryption & how to play mental poker keeping secret all partial information.
Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019

How to play any mental game, or a completeness theorem for protocols with honest majority.
Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019

Proofs that yield nothing but their validity and a methodology of cryptographic protocol design.
Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019

How to generate cryptographically strong sequences of pseudo random bits.
Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019

How to construct random functions.
Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019

Non-interactive zero-knowledge and its applications.
Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019

2018
ALGORAND AGREEMENT: Super Fast and Partition Resilient Byzantine Agreement.
IACR Cryptol. ePrint Arch., 2018

2017
Algorand: Scaling Byzantine Agreements for Cryptocurrencies.
IACR Cryptol. ePrint Arch., 2017

Collusion, efficiency, and dominant strategies.
Games Econ. Behav., 2017

Very Simple and Efficient Byzantine Agreement.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016
Leveraging Possibilistic Beliefs in Unrestricted Combinatorial Auctions.
Games, 2016

Reconstructing Markov processes from independent and anonymous experiments.
Discret. Appl. Math., 2016

ALGORAND: The Efficient and Democratic Ledger.
CoRR, 2016

Mechanisms With Costly Knowledge.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

Auction Revenue in the General Spiteful-Utility Model.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

2015
Mechanism design with possibilistic beliefs.
J. Econ. Theory, 2015

Democoin: A Publicly Verifiable and Jointly Serviced Cryptocurrency.
IACR Cryptol. ePrint Arch., 2015

What it means to receive the Turing award.
Commun. ACM, 2015

Better Outcomes from More Rationality.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

2014
The Query Complexity of Scoring Rules.
ACM Trans. Economics and Comput., 2014

Johnson-Lindenstrauss Compression with Neuroscience-Based Constraints.
CoRR, 2014

Knightian Robustness of the Vickrey Mechanism.
CoRR, 2014

Knightian Robustness of Single-Parameter Domains.
CoRR, 2014

Knightian Analysis of the VCG Mechanism in Unrestricted Combinatorial Auctions.
CoRR, 2014

Knightian Robustness from Regret Minimization.
CoRR, 2014

Bridging Utility Maximization and Regret Minimization.
CoRR, 2014

Cryptography miracles, secure auctions, matching problem verification.
Commun. ACM, 2014

Knightian self uncertainty in the vcg mechanism for unrestricted combinatorial auctions.
Proceedings of the ACM Conference on Economics and Computation, 2014

Rational and resilient protocols.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

2013
Optimal and Efficient Parametric Auctions.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Super-efficient rational proofs.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Parametric digital auctions.
Proceedings of the Innovations in Theoretical Computer Science, 2013

2012
Collusive dominant-strategy truthfulness.
J. Econ. Theory, 2012

Rational proofs.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Mechanism design with approximate valuations.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

Crowdsourced Bayesian auctions.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

2011
Perfect implementation.
Games Econ. Behav., 2011

Knightian Auctions
CoRR, 2011

Mechanism Design with Set-Theoretic Beliefs.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Crowdsourced Bayesian Auctions - (Abstract).
Proceedings of the Auctions, Market Mechanisms, and Their Applications, 2011

2010
Optimal Error Correction for Computationally Bounded Noise.
IEEE Trans. Inf. Theory, 2010

Robustly Leveraging Collusion in Combinatorial Auctions.
Proceedings of the Innovations in Computer Science, 2010

Robust Perfect Revenue From Perfectly Informed Players.
Proceedings of the Innovations in Computer Science, 2010

Perfect concrete implementation of arbitrary mechanisms: a quick summary of joint work with Sergei Izmalkov and Matt Lepinski.
Proceedings of the Behavioral and Quantitative Game Theory, 2010

2009
Purely Rational Secret Sharing (Extended Abstract).
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

A new approach to auctions and resilient mechanism design.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008
Verifiably Secure Devices.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Online-Untransferable Signatures.
Proceedings of the Public Key Cryptography, 2008

2006
Independent Zero-Knowledge Sets.
IACR Cryptol. ePrint Arch., 2006

Local zero knowledge.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Input-Indistinguishable Computation.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005
Optimal Error Correction Against Computationally Bounded Noise.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Fair-Zero Knowledge.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Collusion-free protocols.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Rational Secure Computation and Ideal Mechanism Design.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004
Physically Observable Cryptography (Extended Abstract).
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering.
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

Completely fair SFE and coalition-safe cheap talk.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2003
Physically Observable Cryptography.
IACR Cryptol. ePrint Arch., 2003

Sequential Aggregate Signatures from Trapdoor Permutations.
IACR Cryptol. ePrint Arch., 2003

Simple and fast optimistic protocols for fair electronic exchange.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Zero-Knowledge Sets.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

Fractal Merkle Tree Representation and Traversal.
Proceedings of the Topics in Cryptology, 2003

Plaintext Awareness via Key Registration.
Proceedings of the Advances in Cryptology, 2003

2002
Improving the Exact Security of Digital Signature Schemes.
J. Cryptol., 2002

Transitive Signature Schemes.
Proceedings of the Topics in Cryptology, 2002

Micropayments Revisited.
Proceedings of the Topics in Cryptology, 2002

2001
Amortized E-Cash.
Proceedings of the Financial Cryptography, 2001

Min-round Resettable Zero-Knowledge in the Public-Key Model.
Proceedings of the Advances in Cryptology, 2001

Soundness in the Public-Key Model.
Proceedings of the Advances in Cryptology, 2001

Accountable-subgroup multisignatures: extended abstract.
Proceedings of the CCS 2001, 2001

Mutually Independent Commitments.
Proceedings of the Advances in Cryptology, 2001

2000
Computationally Sound Proofs.
SIAM J. Comput., 2000

Reducibility and Completeness in Private Computations.
SIAM J. Comput., 2000

Identification Protocols Secure Against Reset Attacks.
IACR Cryptol. ePrint Arch., 2000

Resettable zero-knowledge (extended abstract).
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements.
Proceedings of the Advances in Cryptology, 2000

Parallel Reducibility for Information-Theoretically Secure Computation.
Proceedings of the Advances in Cryptology, 2000

1999
Resettable Zero-Knowledge.
Electron. Colloquium Comput. Complex., 1999

Interleaved Zero-Knowledge in the Public-Key Model.
Electron. Colloquium Comput. Complex., 1999

Verifiable Random Functions.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

Lower Bounds for Oblivious Transfer Reductions.
Proceedings of the Advances in Cryptology, 1999

Computationally Private Information Retrieval with Polylogarithmic Communication.
Proceedings of the Advances in Cryptology, 1999

The All-or-Nothing Nature of Two-Party Secure Computation.
Proceedings of the Advances in Cryptology, 1999

Improving the Exact Security of Fiat-Shamir Signature Schemes.
Proceedings of the Secure Networking - CQRE (Secure) '99, International Exhibition and Congress Düsseldorf, Germany, November 30, 1999

1998
More on Proofs of Knowledge.
IACR Cryptol. ePrint Arch., 1998

Computationally-Sound Checkers.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997
An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement.
SIAM J. Comput., 1997

1996
A Secure Protocol for the Oblivious Transfer (Extended Abstract).
J. Cryptol., 1996

On-Line/Off-Line Digital Signatures.
J. Cryptol., 1996

Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing.
Proceedings of the Advances in Cryptology, 1996

1995
Verifiable Secret Sharing as Secure Computation.
Proceedings of the Advances in Cryptology, 1995

A Simple Method for Generating and Sharing Pseudo-Random Functions, with Applications to Clipper-like Escrow Systems.
Proceedings of the Advances in Cryptology, 1995

1994
CS Proofs (Extended Abstracts)
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

Reducibility and Completeness in Multi-Party Private Computations
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993
Secret-Key Agreement without Public-Key Cryptography.
Proceedings of the Advances in Cryptology, 1993

1992
How to Sign Given Any Trapdoor Permutation.
J. ACM, 1992

Fair Public-Key Cryptosystems.
Proceedings of the Advances in Cryptology, 1992

1991
Noninteractive Zero-Knowledge.
SIAM J. Comput., 1991

Efficient, Perfect Polynomial Random Number Generators.
J. Cryptol., 1991

Proofs that Yield Nothing But Their Validity for All Languages in NP Have Zero-Knowledge Proof Systems.
J. ACM, 1991

Secure Computation (Abstract).
Proceedings of the Advances in Cryptology, 1991

1990
A fair protocol for signing contracts.
IEEE Trans. Inf. Theory, 1990

The (True) Complexity of Statistical Zero Knowledge
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Perfect Zero-Knowledge in Constant Rounds
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

The Round Complexity of Secure Protocols (Extended Abstract)
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Collective Coin Tossing Without Assumptions nor Broadcasting.
Proceedings of the Advances in Cryptology, 1990

1989
The Knowledge Complexity of Interactive Proof Systems.
SIAM J. Comput., 1989

"Perfect" Pseudo-Random Number Generation.
Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

An Optimal Probabilistic Algorithm For Synchronous Byzantine Agreement.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

Minimum Resource Zero-Knowledge Proofs (Extended Abstract).
Proceedings of the Advances in Cryptology, 1989

On-Line/Off-Line Digital Schemes.
Proceedings of the Advances in Cryptology, 1989

Non-Interactive Oblivious Transfer and Applications.
Proceedings of the Advances in Cryptology, 1989

1988
The Notion of Security for Probabilistic Cryptosystems.
SIAM J. Comput., 1988

A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks.
SIAM J. Comput., 1988

Optimal Algorithms for Byzantine Agreement
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

How to Sign Given Any Trapdoor Function (Extended Abstract)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Non-Interactive Zero-Knowledge with Preprocessing.
Proceedings of the Advances in Cryptology, 1988

An Improvement of the Fiat-Shamir Identification and Signature Scheme.
Proceedings of the Advances in Cryptology, 1988

Efficient, Perfect Random Number Generators.
Proceedings of the Advances in Cryptology, 1988

Proving Security Against Chosen Cyphertext Attacks.
Proceedings of the Advances in Cryptology, 1988

Everything Provable is Provable in Zero-Knowledge.
Proceedings of the Advances in Cryptology, 1988

How To Sign Given Any Trapdoor Function.
Proceedings of the Advances in Cryptology, 1988

1987
How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

Non-Interactive Zero-Knowledge Proof Systems.
Proceedings of the Advances in Cryptology, 1987

1986
An O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs.
SIAM J. Comput., 1986

How to construct random functions.
J. ACM, 1986

Knowledge and Efficient Computation.
Proceedings of the 1st Conference on Theoretical Aspects of Reasoning about Knowledge, 1986

Proofs that Release Minimum Knowledge.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design (Extended Abstract)
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

Dynamic deadlock resolution protocols (Extended Abstract)
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design.
Proceedings of the Advances in Cryptology, 1986

1985
The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract)
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

A Fair Protocol for Signing Contracts (Extended Abstract).
Proceedings of the Automata, 1985

Byzantine Agreement in Constant Expected Time (and Trusting No One)
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract)
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984
How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits.
SIAM J. Comput., 1984

Probabilistic Encryption.
J. Comput. Syst. Sci., 1984

A "Paradoxical" Solution to the Signature Problem (Extended Abstract)
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

How to Construct Random Functions (Extended Abstract)
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

A "Paradoxical'"Solution to the Signature Problem (Abstract).
Proceedings of the Advances in Cryptology, 1984

On the Cryptographic Applications of Random Functions.
Proceedings of the Advances in Cryptology, 1984

1983
Strong Signature Schemes
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982
Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

Why and How to Establish a Private Code on a Public Network (Extended Abstract)
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

Priority Queues with Variable Priority and an O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

On Signatures and Authentication.
Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

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

1980
Minimal Forms in lambda-Calculus Computations.
J. Symb. Log., 1980

An O(sqrt(|v|) |E|) Algorithm for Finding Maximum Matching in General Graphs
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980


  Loading...