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:
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 OtherLinks
Online presence:
-
on zbmath.org
-
on acm.org
-
on viaf.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on isni.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2020
2019
Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019
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
Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019
Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019
Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019
2018
IACR Cryptol. ePrint Arch., 2018
2017
IACR Cryptol. ePrint Arch., 2017
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017
2016
Discret. Appl. Math., 2016
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016
2015
IACR Cryptol. ePrint Arch., 2015
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015
2014
CoRR, 2014
Commun. ACM, 2014
Knightian self uncertainty in the vcg mechanism for unrestricted combinatorial auctions.
Proceedings of the ACM Conference on Economics and Computation, 2014
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014
2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013
Proceedings of the Innovations in Theoretical Computer Science, 2013
2012
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012
2011
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
Proceedings of the Auctions, Market Mechanisms, and Their Applications, 2011
2010
IEEE Trans. Inf. Theory, 2010
Proceedings of the Innovations in Computer Science, 2010
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
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009
2008
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008
2006
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006
2005
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005
2004
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
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004
2003
IACR Cryptol. ePrint Arch., 2003
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003
Proceedings of the Topics in Cryptology, 2003
Proceedings of the Advances in Cryptology, 2003
2002
2001
Proceedings of the Advances in Cryptology, 2001
Proceedings of the CCS 2001, 2001
2000
IACR Cryptol. ePrint Arch., 2000
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000
Proceedings of the Advances in Cryptology, 2000
Proceedings of the Advances in Cryptology, 2000
1999
Electron. Colloquium Comput. Complex., 1999
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999
Proceedings of the Advances in Cryptology, 1999
Proceedings of the Advances in Cryptology, 1999
Proceedings of the Advances in Cryptology, 1999
Proceedings of the Secure Networking - CQRE (Secure) '99, International Exhibition and Congress Düsseldorf, Germany, November 30, 1999
1998
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998
1997
SIAM J. Comput., 1997
1996
A Secure Protocol for the Oblivious Transfer (Extended Abstract).
J. Cryptol., 1996
Proceedings of the Advances in Cryptology, 1996
1995
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
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994
1993
Proceedings of the Advances in Cryptology, 1993
1992
1991
Proofs that Yield Nothing But Their Validity for All Languages in NP Have Zero-Knowledge Proof Systems.
J. ACM, 1991
1990
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990
Proceedings of the Advances in Cryptology, 1990
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
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989
Proceedings of the Advances in Cryptology, 1989
Proceedings of the Advances in Cryptology, 1989
1988
SIAM J. Comput., 1988
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988
Proceedings of the Advances in Cryptology, 1988
Proceedings of the Advances in Cryptology, 1988
Proceedings of the Advances in Cryptology, 1988
Proceedings of the Advances in Cryptology, 1988
Proceedings of the Advances in Cryptology, 1988
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
Proceedings of the Advances in Cryptology, 1987
1986
SIAM J. Comput., 1986
Knowledge and Efficient Computation.
Proceedings of the 1st Conference on Theoretical Aspects of Reasoning about Knowledge, 1986
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
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
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985
Proceedings of the Automata, 1985
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
SIAM J. Comput., 1984
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984
Proceedings of the Advances in Cryptology, 1984
Proceedings of the Advances in Cryptology, 1984
1983
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983
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
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
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
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980