default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSilvio Micali
Person information
- affiliation: Massachusetts Institute of Technology (MIT), Computer Science and Artificial Intelligence Laboratory (CSAIL), Cambridge, MA, USA
- affiliation (PhD 1983): University of California at Berkeley, CA, USA
- award (2017): BBVA Foundation Frontiers of Knowledge Award
- award (2012): Turing Award
- award (1993): Gödel Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[c107]Silvio Micali, Leonid Reyzin, Georgios Vlachos, Riad S. Wahby, Nickolai Zeldovich:
Compact Certificates of Collective Knowledge. SP 2021: 626-641- 2020
- [i22]Silvio Micali, Leonid Reyzin, Georgios Vlachos, Riad S. Wahby, Nickolai Zeldovich:
Compact Certificates of Collective Knowledge. IACR Cryptol. ePrint Arch. 2020: 1568 (2020)
2010 – 2019
- 2019
- [j31]Jing Chen, Silvio Micali:
Algorand: A secure and efficient distributed ledger. Theor. Comput. Sci. 777: 155-183 (2019) - [p8]Shafi Goldwasser, Silvio Micali:
Probabilistic encryption & how to play mental poker keeping secret all partial information. Providing Sound Foundations for Cryptography 2019: 173-201 - [p7]Shafi Goldwasser, Silvio Micali, Charles Rackoff:
The knowledge complexity of interactive proof-systems. Providing Sound Foundations for Cryptography 2019: 203-225 - [p6]Manuel Blum, Silvio Micali:
How to generate cryptographically strong sequences of pseudo random bits. Providing Sound Foundations for Cryptography 2019: 227-240 - [p5]Oded Goldreich, Shafi Goldwasser, Silvio Micali:
How to construct random functions. Providing Sound Foundations for Cryptography 2019: 241-264 - [p4]Shafi Goldwasser, Silvio Micali, Ronald L. Rivest:
A "paradoxical" solution to the signature problem. Providing Sound Foundations for Cryptography 2019: 265-284 - [p3]Oded Goldreich, Silvio Micali, Avi Wigderson:
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. Providing Sound Foundations for Cryptography 2019: 285-306 - [p2]Oded Goldreich, Silvio Micali, Avi Wigderson:
How to play any mental game, or a completeness theorem for protocols with honest majority. Providing Sound Foundations for Cryptography 2019: 307-328 - [p1]Manuel Blum, Paul Feldman, Silvio Micali:
Non-interactive zero-knowledge and its applications. Providing Sound Foundations for Cryptography 2019: 329-349 - 2018
- [i21]Jing Chen, Sergey Gorbunov, Silvio Micali, Georgios Vlachos:
ALGORAND AGREEMENT: Super Fast and Partition Resilient Byzantine Agreement. IACR Cryptol. ePrint Arch. 2018: 377 (2018) - 2017
- [j30]Alan Deckelbaum, Silvio Micali:
Collusion, efficiency, and dominant strategies. Games Econ. Behav. 103: 83-93 (2017) - [c106]Silvio Micali:
Very Simple and Efficient Byzantine Agreement. ITCS 2017: 6:1-6:1 - [c105]Yossi Gilad, Rotem Hemo, Silvio Micali, Georgios Vlachos, Nickolai Zeldovich:
Algorand: Scaling Byzantine Agreements for Cryptocurrencies. SOSP 2017: 51-68 - [i20]Yossi Gilad, Rotem Hemo, Silvio Micali, Georgios Vlachos, Nickolai Zeldovich:
Algorand: Scaling Byzantine Agreements for Cryptocurrencies. IACR Cryptol. ePrint Arch. 2017: 454 (2017) - 2016
- [j29]Silvio Micali, Zeyuan Allen Zhu:
Reconstructing Markov processes from independent and anonymous experiments. Discret. Appl. Math. 200: 108-122 (2016) - [j28]Jing Chen, Silvio Micali:
Leveraging Possibilistic Beliefs in Unrestricted Combinatorial Auctions. Games 7(4): 32 (2016) - [c104]Atalay Mert Ileri
, Silvio Micali:
Mechanisms With Costly Knowledge. ITCS 2016: 11-19 - [c103]Jing Chen, Silvio Micali:
Auction Revenue in the General Spiteful-Utility Model. ITCS 2016: 201-211 - [i19]Silvio Micali:
ALGORAND: The Efficient and Democratic Ledger. CoRR abs/1607.01341 (2016) - 2015
- [j27]Silvio Micali:
What it means to receive the Turing award. Commun. ACM 58(1): 52-53 (2015) - [j26]Jing Chen, Silvio Micali:
Mechanism design with possibilistic beliefs. J. Econ. Theory 156: 77-102 (2015) - [c102]Jing Chen, Silvio Micali, Rafael Pass:
Better Outcomes from More Rationality. ITCS 2015: 325 - [i18]Sergey Gorbunov, Silvio Micali:
Democoin: A Publicly Verifiable and Jointly Serviced Cryptocurrency. IACR Cryptol. ePrint Arch. 2015: 521 (2015) - 2014
- [j25]Silvio Micali, Michael O. Rabin:
Cryptography miracles, secure auctions, matching problem verification. Commun. ACM 57(2): 85-93 (2014) - [j24]Pablo Daniel Azar, Silvio Micali:
The Query Complexity of Scoring Rules. ACM Trans. Economics and Comput. 2(3): 10:1-10:10 (2014) - [c101]Silvio Micali:
Rational and resilient protocols. PODC 2014: 1 - [c100]Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu:
Knightian self uncertainty in the vcg mechanism for unrestricted combinatorial auctions. EC 2014: 619-620 - [i17]Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu:
Bridging Utility Maximization and Regret Minimization. CoRR abs/1403.6394 (2014) - [i16]Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu:
Knightian Robustness from Regret Minimization. CoRR abs/1403.6409 (2014) - [i15]Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu:
Knightian Analysis of the VCG Mechanism in Unrestricted Combinatorial Auctions. CoRR abs/1403.6410 (2014) - [i14]Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu:
Knightian Robustness of Single-Parameter Domains. CoRR abs/1403.6411 (2014) - [i13]Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu:
Knightian Robustness of the Vickrey Mechanism. CoRR abs/1403.6413 (2014) - [i12]Zeyuan Allen Zhu, Rati Gelashvili, Silvio Micali, Nir Shavit:
Johnson-Lindenstrauss Compression with Neuroscience-Based Constraints. CoRR abs/1411.5383 (2014) - 2013
- [c99]Pablo Daniel Azar, Silvio Micali:
Parametric digital auctions. ITCS 2013: 231-232 - [c98]Pablo Daniel Azar, Silvio Micali:
Super-efficient rational proofs. EC 2013: 29-30 - [c97]Pablo Daniel Azar, Constantinos Daskalakis, Silvio Micali, S. Matthew Weinberg:
Optimal and Efficient Parametric Auctions. SODA 2013: 596-604 - 2012
- [j23]Jing Chen, Silvio Micali:
Collusive dominant-strategy truthfulness. J. Econ. Theory 147(3): 1300-1312 (2012) - [c96]Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu:
Mechanism design with approximate valuations. ITCS 2012: 34-38 - [c95]Pablo Azar, Jing Chen, Silvio Micali:
Crowdsourced Bayesian auctions. ITCS 2012: 236-248 - [c94]Pablo Daniel Azar, Silvio Micali:
Rational proofs. STOC 2012: 1017-1028 - 2011
- [j22]Sergei Izmalkov, Matt Lepinski, Silvio Micali:
Perfect implementation. Games Econ. Behav. 71(1): 121-140 (2011) - [c93]Pablo Daniel Azar, Jing Chen, Silvio Micali:
Crowdsourced Bayesian Auctions - (Abstract). AMMA 2011: 53 - [c92]Jing Chen, Silvio Micali:
Mechanism Design with Set-Theoretic Beliefs. FOCS 2011: 87-96 - [i11]Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu:
Knightian Auctions. CoRR abs/1112.1147 (2011) - 2010
- [j21]Silvio Micali, Chris Peikert, Madhu Sudan, David A. Wilson:
Optimal Error Correction for Computationally Bounded Noise. IEEE Trans. Inf. Theory 56(11): 5673-5680 (2010) - [c91]Silvio Micali:
Perfect concrete implementation of arbitrary mechanisms: a quick summary of joint work with Sergei Izmalkov and Matt Lepinski. BQGT 2010: 88:1-88:5 - [c90]Jing Chen, Silvio Micali, Paul Valiant:
Robustly Leveraging Collusion in Combinatorial Auctions. ICS 2010: 81-93 - [c89]Jing Chen, Avinatan Hassidim, Silvio Micali:
Robust Perfect Revenue From Perfectly Informed Players. ICS 2010: 94-105
2000 – 2009
- 2009
- [c88]Jing Chen, Silvio Micali:
A new approach to auctions and resilient mechanism design. STOC 2009: 503-512 - [c87]Silvio Micali, Abhi Shelat:
Purely Rational Secret Sharing (Extended Abstract). TCC 2009: 54-71 - 2008
- [c86]Moses D. Liskov, Silvio Micali:
Online-Untransferable Signatures. Public Key Cryptography 2008: 248-267 - [c85]Sergei Izmalkov, Matt Lepinski, Silvio Micali:
Verifiably Secure Devices. TCC 2008: 273-301 - 2006
- [c84]Silvio Micali, Rafael Pass, Alon Rosen:
Input-Indistinguishable Computation. FOCS 2006: 367-378 - [c83]Rosario Gennaro, Silvio Micali:
Independent Zero-Knowledge Sets. ICALP (2) 2006: 34-45 - [c82]Silvio Micali, Rafael Pass:
Local zero knowledge. STOC 2006: 306-315 - [i10]Rosario Gennaro, Silvio Micali:
Independent Zero-Knowledge Sets. IACR Cryptol. ePrint Arch. 2006: 155 (2006) - 2005
- [c81]Sergei Izmalkov, Silvio Micali, Matt Lepinski:
Rational Secure Computation and Ideal Mechanism Design. FOCS 2005: 585-595 - [c80]Matt Lepinski, Silvio Micali, Abhi Shelat:
Collusion-free protocols. STOC 2005: 543-552 - [c79]Silvio Micali, Chris Peikert, Madhu Sudan, David A. Wilson:
Optimal Error Correction Against Computationally Bounded Noise. TCC 2005: 1-16 - [c78]Matt Lepinski, Silvio Micali, Abhi Shelat:
Fair-Zero Knowledge. TCC 2005: 245-263 - 2004
- [c77]Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Hovav Shacham:
Sequential Aggregate Signatures from Trapdoor Permutations. EUROCRYPT 2004: 74-90 - [c76]Matt Lepinski, Silvio Micali, Chris Peikert, Abhi Shelat:
Completely fair SFE and coalition-safe cheap talk. PODC 2004: 1-10 - [c75]Rosario Gennaro, Anna Lysyanskaya, Tal Malkin, Silvio Micali, Tal Rabin:
Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering. TCC 2004: 258-277 - [c74]Silvio Micali, Leonid Reyzin:
Physically Observable Cryptography (Extended Abstract). TCC 2004: 278-296 - 2003
- [c73]Jonathan Herzog, Moses D. Liskov, Silvio Micali:
Plaintext Awareness via Key Registration. CRYPTO 2003: 548-564 - [c72]Markus Jakobsson, Frank Thomson Leighton, Silvio Micali, Michael Szydlo:
Fractal Merkle Tree Representation and Traversal. CT-RSA 2003: 314-326 - [c71]Silvio Micali, Michael O. Rabin, Joe Kilian:
Zero-Knowledge Sets. FOCS 2003: 80-91 - [c70]Silvio Micali:
Simple and fast optimistic protocols for fair electronic exchange. PODC 2003: 12-19 - [i9]Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Hovav Shacham:
Sequential Aggregate Signatures from Trapdoor Permutations. IACR Cryptol. ePrint Arch. 2003: 91 (2003) - [i8]Silvio Micali, Leonid Reyzin:
Physically Observable Cryptography. IACR Cryptol. ePrint Arch. 2003: 120 (2003) - 2002
- [j20]Silvio Micali, Leonid Reyzin:
Improving the Exact Security of Digital Signature Schemes. J. Cryptol. 15(1): 1-18 (2002) - [c69]Silvio Micali, Ronald L. Rivest:
Micropayments Revisited. CT-RSA 2002: 149-163 - [c68]Silvio Micali, Ronald L. Rivest:
Transitive Signature Schemes. CT-RSA 2002: 236-243 - 2001
- [c67]Moses D. Liskov, Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Adam D. Smith:
Mutually Independent Commitments. ASIACRYPT 2001: 385-401 - [c66]Silvio Micali, Kazuo Ohta, Leonid Reyzin:
Accountable-subgroup multisignatures: extended abstract. CCS 2001: 245-254 - [c65]Silvio Micali, Leonid Reyzin:
Soundness in the Public-Key Model. CRYPTO 2001: 542-565 - [c64]Silvio Micali, Leonid Reyzin:
Min-round Resettable Zero-Knowledge in the Public-Key Model. EUROCRYPT 2001: 373-393 - [c63]Mihir Bellare, Marc Fischlin, Shafi Goldwasser, Silvio Micali:
Identification Protocols Secure against Reset Attacks. EUROCRYPT 2001: 495-511 - [c62]Moses D. Liskov, Silvio Micali:
Amortized E-Cash. Financial Cryptography 2001: 1-20 - 2000
- [j19]Joe Kilian, Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky:
Reducibility and Completeness in Private Computations. SIAM J. Comput. 29(4): 1189-1208 (2000) - [j18]Silvio Micali:
Computationally Sound Proofs. SIAM J. Comput. 30(4): 1253-1298 (2000) - [c61]Yevgeniy Dodis, Silvio Micali:
Parallel Reducibility for Information-Theoretically Secure Computation. CRYPTO 2000: 74-92 - [c60]Mihir Bellare, Alexandra Boldyreva, Silvio Micali:
Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements. EUROCRYPT 2000: 259-274 - [c59]Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali:
Resettable zero-knowledge (extended abstract). STOC 2000: 235-244 - [i7]Mihir Bellare, Marc Fischlin, Shafi Goldwasser, Silvio Micali:
Identification Protocols Secure Against Reset Attacks. IACR Cryptol. ePrint Arch. 2000: 15 (2000)
1990 – 1999
- 1999
- [c58]Silvio Micali, Leonid Reyzin:
Improving the Exact Security of Fiat-Shamir Signature Schemes. CQRE 1999: 167-182 - [c57]Amos Beimel, Tal Malkin, Silvio Micali:
The All-or-Nothing Nature of Two-Party Secure Computation. CRYPTO 1999: 80-97 - [c56]Yevgeniy Dodis, Silvio Micali:
Lower Bounds for Oblivious Transfer Reductions. EUROCRYPT 1999: 42-55 - [c55]Christian Cachin, Silvio Micali, Markus Stadler:
Computationally Private Information Retrieval with Polylogarithmic Communication. EUROCRYPT 1999: 402-414 - [c54]Silvio Micali, Michael O. Rabin, Salil P. Vadhan:
Verifiable Random Functions. FOCS 1999: 120-130 - [i6]Oded Goldreich, Shafi Goldwasser, Silvio Micali:
Interleaved Zero-Knowledge in the Public-Key Model. Electron. Colloquium Comput. Complex. TR99 (1999) - [i5]Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali:
Resettable Zero-Knowledge. Electron. Colloquium Comput. Complex. TR99 (1999) - [i4]Oded Goldreich, Shafi Goldwasser, Silvio Micali:
Interleaved Zero-Knowledge in the Public-Key Model. IACR Cryptol. ePrint Arch. 1999: 15 (1999) - [i3]Silvio Micali, Leonid Reyzin:
Improving the Exact Security of Digital Signature Schemes. IACR Cryptol. ePrint Arch. 1999: 20 (1999) - [i2]Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali:
Resettable Zero-Knowledge. IACR Cryptol. ePrint Arch. 1999: 22 (1999) - 1998
- [c53]Silvio Micali:
Computationally-Sound Checkers. MFCS 1998: 94-116 - [i1]Shai Halevi, Silvio Micali:
More on Proofs of Knowledge. IACR Cryptol. ePrint Arch. 1998: 15 (1998) - 1997
- [j17]Pesech Feldman, Silvio Micali:
An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement. SIAM J. Comput. 26(4): 873-933 (1997) - 1996
- [j16]Shimon Even, Oded Goldreich, Silvio Micali:
On-Line/Off-Line Digital Signatures. J. Cryptol. 9(1): 35-67 (1996) - [j15]Michael J. Fischer, Silvio Micali, Charles Rackoff:
A Secure Protocol for the Oblivious Transfer (Extended Abstract). J. Cryptol. 9(3): 191-195 (1996) - [c52]Shai Halevi, Silvio Micali:
Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing. CRYPTO 1996: 201-215 - 1995
- [c51]Silvio Micali, Ray Sidney:
A Simple Method for Generating and Sharing Pseudo-Random Functions, with Applications to Clipper-like Escrow Systems. CRYPTO 1995: 185-196 - [c50]Rosario Gennaro, Silvio Micali:
Verifiable Secret Sharing as Secure Computation. EUROCRYPT 1995: 168-182 - [c49]Silvio Micali:
Computationally-Sound Proofs. Logic Colloquium 1995: 214-268 - 1994
- [c48]Silvio Micali:
CS Proofs (Extended Abstracts). FOCS 1994: 436-453 - [c47]Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky:
Reducibility and Completeness in Multi-Party Private Computations. FOCS 1994: 478-489 - 1993
- [c46]Frank Thomson Leighton, Silvio Micali:
Secret-Key Agreement without Public-Key Cryptography. CRYPTO 1993: 456-479 - 1992
- [j14]Mihir Bellare, Silvio Micali:
How to Sign Given Any Trapdoor Permutation. J. ACM 39(1): 214-233 (1992) - [c45]Silvio Micali:
Fair Public-Key Cryptosystems. CRYPTO 1992: 113-138 - 1991
- [j13]Oded Goldreich, Silvio Micali, Avi Wigderson:
Proofs that Yield Nothing But Their Validity for All Languages in NP Have Zero-Knowledge Proof Systems. J. ACM 38(3): 691-729 (1991) - [j12]Silvio Micali, Claus-Peter Schnorr:
Efficient, Perfect Polynomial Random Number Generators. J. Cryptol. 3(3): 157-172 (1991) - [j11]Manuel Blum, Alfredo De Santis, Silvio Micali, Giuseppe Persiano:
Noninteractive Zero-Knowledge. SIAM J. Comput. 20(6): 1084-1118 (1991) - [c44]Silvio Micali, Phillip Rogaway:
Secure Computation (Abstract). CRYPTO 1991: 392-404 - 1990
- [j10]Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest:
A fair protocol for signing contracts. IEEE Trans. Inf. Theory 36(1): 40-46 (1990) - [c43]Silvio Micali, Tal Rabin:
Collective Coin Tossing Without Assumptions nor Broadcasting. CRYPTO 1990: 253-266 - [c42]Mihir Bellare, Silvio Micali, Rafail Ostrovsky:
Perfect Zero-Knowledge in Constant Rounds. STOC 1990: 482-493 - [c41]Mihir Bellare, Silvio Micali, Rafail Ostrovsky:
The (True) Complexity of Statistical Zero Knowledge. STOC 1990: 494-502 - [c40]Donald Beaver, Silvio Micali, Phillip Rogaway:
The Round Complexity of Secure Protocols (Extended Abstract). STOC 1990: 503-513
1980 – 1989
- 1989
- [j9]Shafi Goldwasser, Silvio Micali, Charles Rackoff:
The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comput. 18(1): 186-208 (1989) - [c39]Shimon Even, Oded Goldreich, Silvio Micali:
On-Line/Off-Line Digital Schemes. CRYPTO 1989: 263-275 - [c38]Joe Kilian, Silvio Micali, Rafail Ostrovsky:
Minimum Resource Zero-Knowledge Proofs (Extended Abstract). CRYPTO 1989: 545-546 - [c37]Mihir Bellare, Silvio Micali:
Non-Interactive Oblivious Transfer and Applications. CRYPTO 1989: 547-557 - [c36]Joe Kilian, Silvio Micali, Rafail Ostrovsky:
Minimum Resource Zero-Knowledge Proofs (Extended Abstract). FOCS 1989: 474-479 - [c35]Paul Feldman, Silvio Micali:
An Optimal Probabilistic Algorithm For Synchronous Byzantine Agreement. ICALP 1989: 341-378 - [c34]Silvio Micali:
"Perfect" Pseudo-Random Number Generation. IFIP Congress 1989: 121-126 - 1988
- [j8]Shafi Goldwasser, Silvio Micali, Ronald L. Rivest:
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM J. Comput. 17(2): 281-308 (1988) - [j7]Silvio Micali, Charles Rackoff, Bob Sloan:
The Notion of Security for Probabilistic Cryptosystems. SIAM J. Comput. 17(2): 412-426 (1988) - [c33]Michael Ben-Or, Oded Goldreich, Shafi Goldwasser, Johan Håstad, Joe Kilian, Silvio Micali, Phillip Rogaway:
Everything Provable is Provable in Zero-Knowledge. CRYPTO 1988: 37-56 - [c32]Silvio Micali, Claus-Peter Schnorr:
Efficient, Perfect Random Number Generators. CRYPTO 1988: 173-198 - [c31]Mihir Bellare, Silvio Micali:
How To Sign Given Any Trapdoor Function. CRYPTO 1988: 200-215 - [c30]Silvio Micali, Adi Shamir:
An Improvement of the Fiat-Shamir Identification and Signature Scheme. CRYPTO 1988: 244-247 - [c29]Manuel Blum, Paul Feldman, Silvio Micali:
Proving Security Against Chosen Cyphertext Attacks. CRYPTO 1988: 256-268 - [c28]Alfredo De Santis, Silvio Micali, Giuseppe Persiano:
Non-Interactive Zero-Knowledge with Preprocessing. CRYPTO 1988: 269-282 - [c27]Mihir Bellare, Silvio Micali:
How to Sign Given Any Trapdoor Function (Extended Abstract). STOC 1988: 32-42 - [c26]Manuel Blum, Paul Feldman, Silvio Micali:
Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract). STOC 1988: 103-112 - [c25]Paul Feldman, Silvio Micali:
Optimal Algorithms for Byzantine Agreement. STOC 1988: 148-161 - 1987
- [c24]Alfredo De Santis, Silvio Micali, Giuseppe Persiano:
Non-Interactive Zero-Knowledge Proof Systems. CRYPTO 1987: 52-72 - [c23]Oded Goldreich, Silvio Micali, Avi Wigderson:
How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. STOC 1987: 218-229 - 1986
- [j6]Oded Goldreich, Shafi Goldwasser, Silvio Micali:
How to construct random functions. J. ACM 33(4): 792-807 (1986) - [j5]Zvi Galil, Silvio Micali, Harold N. Gabow:
An O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs. SIAM J. Comput. 15(1): 120-130 (1986) - [c22]Oded Goldreich, Silvio Micali, Avi Wigderson:
How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design. CRYPTO 1986: 171-185 - [c21]Silvio Micali, Charles Rackoff, Bob Sloan:
The Notion of Security for Probabilistic Cryptosystems. CRYPTO 1986: 381-392 - [c20]Oded Goldreich, Silvio Micali, Avi Wigderson:
Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design (Extended Abstract). FOCS 1986: 174-187 - [c19]Baruch Awerbuch, Silvio Micali:
Dynamic deadlock resolution protocols (Extended Abstract). FOCS 1986: 196-207 - [c18]Oded Goldreich, Silvio Micali, Avi Wigderson:
Proofs that Release Minimum Knowledge. MFCS 1986: 639-650 - [c17]Silvio Micali:
Knowledge and Efficient Computation. TARK 1986: 353-362 - 1985
- [c16]Paul Feldman, Silvio Micali:
Byzantine Agreement in Constant Expected Time (and Trusting No One). FOCS 1985: 267-276 - [c15]Benny Chor, Shafi Goldwasser, Silvio Micali, Baruch Awerbuch:
Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract). FOCS 1985: 383-395 - [c14]Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest:
A Fair Protocol for Signing Contracts (Extended Abstract). ICALP 1985: 43-52 - [c13]Shafi Goldwasser, Silvio Micali, Charles Rackoff:
The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract). STOC 1985: 291-304 - 1984
- [j4]Shafi Goldwasser, Silvio Micali:
Probabilistic Encryption. J. Comput. Syst. Sci. 28(2): 270-299 (1984) - [j3]Manuel Blum, Silvio Micali:
How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM J. Comput. 13(4): 850-864 (1984) - [c12]Oded Goldreich, Shafi Goldwasser, Silvio Micali:
On the Cryptographic Applications of Random Functions. CRYPTO 1984: 276-288 - [c11]Shafi Goldwasser, Silvio Micali, Ronald L. Rivest:
A "Paradoxical'"Solution to the Signature Problem (Abstract). CRYPTO 1984: 467 - [c10]Shafi Goldwasser, Silvio Micali, Ronald L. Rivest:
A "Paradoxical" Solution to the Signature Problem (Extended Abstract). FOCS 1984: 441-448 - [c9]Oded Goldreich, Shafi Goldwasser, Silvio Micali:
How to Construct Random Functions (Extended Abstract). FOCS 1984: 464-479 - 1983
- [c8]Michael Luby, Silvio Micali, Charles Rackoff:
How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin. FOCS 1983: 11-21 - [c7]Shafi Goldwasser, Silvio Micali, Andrew Chi-Chih Yao:
Strong Signature Schemes. STOC 1983: 431-439 - 1982
- [c6]Shafi Goldwasser, Silvio Micali, Andrew Chi-Chih Yao:
On Signatures and Authentication. CRYPTO 1982: 211-215 - [c5]Manuel Blum, Silvio Micali:
How to Generate Cryptographically Strong Sequences of Pseudo Random Bits. FOCS 1982: 112-117 - [c4]Shafi Goldwasser, Silvio Micali, Po Tong:
Why and How to Establish a Private Code on a Public Network (Extended Abstract). FOCS 1982: 134-144 - [c3]Zvi Galil, Silvio Micali, Harold N. Gabow:
Priority Queues with Variable Priority and an O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs. FOCS 1982: 255-261 - [c2]Shafi Goldwasser, Silvio Micali:
Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information. STOC 1982: 365-377 - 1981
- [j2]Silvio Micali:
Two-Way Deterministic Finite Automata are Exponentially More Succinct Than Sweeping Automata. Inf. Process. Lett. 12(2): 103-105 (1981) - 1980
- [j1]Corrado Böhm, Silvio Micali:
Minimal Forms in lambda-Calculus Computations. J. Symb. Log. 45(1): 165-171 (1980) - [c1]Silvio Micali, Vijay V. Vazirani:
An O(sqrt(|v|) |E|) Algorithm for Finding Maximum Matching in General Graphs. FOCS 1980: 17-27
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
