| 2012 | ||
|---|---|---|
| 123 | Pablo Azar, Jing Chen, Silvio Micali: Crowdsourced Bayesian auctions. ITCS 2012: 236-248 | |
| 122 | Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu: Mechanism design with approximate valuations. ITCS 2012: 34-38 | |
| 121 | Pablo Daniel Azar, Silvio Micali: Rational proofs. STOC 2012: 1017-1028 | |
| 120 | Jing Chen, Silvio Micali: Collusive dominant-strategy truthfulness. J. Economic Theory 147(3): 1300-1312 (2012) | |
| 2011 | ||
| 119 | Jing Chen, Silvio Micali: Mechanism Design with Set-Theoretic Beliefs. FOCS 2011: 87-96 | |
| 118 | Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu: Knightian Auctions CoRR abs/1112.1147: (2011) | |
| 117 | Sergei Izmalkov, Matt Lepinski, Silvio Micali: Perfect implementation. Games and Economic Behavior 71(1): 121-140 (2011) | |
| 2010 | ||
| 116 | Jing Chen, Silvio Micali, Paul Valiant: Robustly Leveraging Collusion in Combinatorial Auctions. ICS 2010: 81-93 | |
| 115 | Jing Chen, Avinatan Hassidim, Silvio Micali: Robust Perfect Revenue From Perfectly Informed Players. ICS 2010: 94-105 | |
| 114 | Silvio Micali, Chris Peikert, Madhu Sudan, David A. Wilson: Optimal Error Correction for Computationally Bounded Noise. IEEE Transactions on Information Theory 56(11): 5673-5680 (2010) | |
| 2009 | ||
| 113 | Jing Chen, Silvio Micali: A new approach to auctions and resilient mechanism design. STOC 2009: 503-512 | |
| 112 | Silvio Micali, Abhi Shelat: Purely Rational Secret Sharing (Extended Abstract). TCC 2009: 54-71 | |
| 2008 | ||
| 111 | Moses Liskov, Silvio Micali: Online-Untransferable Signatures. Public Key Cryptography 2008: 248-267 | |
| 110 | Sergei Izmalkov, Matt Lepinski, Silvio Micali: Verifiably Secure Devices. TCC 2008: 273-301 | |
| 2006 | ||
| 109 | Silvio Micali, Rafael Pass, Alon Rosen: Input-Indistinguishable Computation. FOCS 2006: 367-378 | |
| 108 | Rosario Gennaro, Silvio Micali: Independent Zero-Knowledge Sets. ICALP (2) 2006: 34-45 | |
| 107 | Silvio Micali, Rafael Pass: Local zero knowledge. STOC 2006: 306-315 | |
| 106 | Rosario Gennaro, Silvio Micali: Independent Zero-Knowledge Sets. IACR Cryptology ePrint Archive 2006: 155 (2006) | |
| 2005 | ||
| 105 | Sergei Izmalkov, Silvio Micali, Matt Lepinski: Rational Secure Computation and Ideal Mechanism Design. FOCS 2005: 585-595 | |
| 104 | Matt Lepinski, Silvio Micali, Abhi Shelat: Collusion-free protocols. STOC 2005: 543-552 | |
| 103 | Silvio Micali, Chris Peikert, Madhu Sudan, David A. Wilson: Optimal Error Correction Against Computationally Bounded Noise. TCC 2005: 1-16 | |
| 102 | Matt Lepinski, Silvio Micali, Abhi Shelat: Fair-Zero Knowledge. TCC 2005: 245-263 | |
| 2004 | ||
| 101 | Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Hovav Shacham: Sequential Aggregate Signatures from Trapdoor Permutations. EUROCRYPT 2004: 74-90 | |
| 100 | Matt Lepinski, Silvio Micali, Chris Peikert, Abhi Shelat: Completely fair SFE and coalition-safe cheap talk. PODC 2004: 1-10 | |
| 99 | 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 | |
| 98 | Silvio Micali, Leonid Reyzin: Physically Observable Cryptography (Extended Abstract). TCC 2004: 278-296 | |
| 2003 | ||
| 97 | Jonathan Herzog, Moses Liskov, Silvio Micali: Plaintext Awareness via Key Registration. CRYPTO 2003: 548-564 | |
| 96 | Markus Jakobsson, Frank Thomson Leighton, Silvio Micali, Michael Szydlo: Fractal Merkle Tree Representation and Traversal. CT-RSA 2003: 314-326 | |
| 95 | Silvio Micali, Michael O. Rabin, Joe Kilian: Zero-Knowledge Sets. FOCS 2003: 80-91 | |
| 94 | Silvio Micali: Simple and fast optimistic protocols for fair electronic exchange. PODC 2003: 12-19 | |
| 93 | Silvio Micali, Leonid Reyzin: Physically Observable Cryptography. IACR Cryptology ePrint Archive 2003: 120 (2003) | |
| 92 | Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Hovav Shacham: Sequential Aggregate Signatures from Trapdoor Permutations. IACR Cryptology ePrint Archive 2003: 91 (2003) | |
| 2002 | ||
| 91 | Silvio Micali, Ronald L. Rivest: Micropayments Revisited. CT-RSA 2002: 149-163 | |
| 90 | Silvio Micali, Ronald L. Rivest: Transitive Signature Schemes. CT-RSA 2002: 236-243 | |
| 89 | Silvio Micali, Leonid Reyzin: Improving the Exact Security of Digital Signature Schemes. J. Cryptology 15(1): 1-18 (2002) | |
| 2001 | ||
| 88 | Silvio Micali, Kazuo Ohta, Leonid Reyzin: Accountable-subgroup multisignatures: extended abstract. ACM Conference on Computer and Communications Security 2001: 245-254 | |
| 87 | Moses Liskov, Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Adam Smith: Mutually Independent Commitments. ASIACRYPT 2001: 385-401 | |
| 86 | Silvio Micali, Leonid Reyzin: Soundness in the Public-Key Model. CRYPTO 2001: 542-565 | |
| 85 | Silvio Micali, Leonid Reyzin: Min-round Resettable Zero-Knowledge in the Public-Key Model. EUROCRYPT 2001: 373-393 | |
| 84 | Mihir Bellare, Marc Fischlin, Shafi Goldwasser, Silvio Micali: Identification Protocols Secure against Reset Attacks. EUROCRYPT 2001: 495-511 | |
| 83 | Moses Liskov, Silvio Micali: Amortized E-Cash. Financial Cryptography 2001: 1-20 | |
| 2000 | ||
| 82 | Yevgeniy Dodis, Silvio Micali: Parallel Reducibility for Information-Theoretically Secure Computation. CRYPTO 2000: 74-92 | |
| 81 | Mihir Bellare, Alexandra Boldyreva, Silvio Micali: Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements. EUROCRYPT 2000: 259-274 | |
| 80 | Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali: Resettable zero-knowledge (extended abstract). STOC 2000: 235-244 | |
| 79 | Mihir Bellare, Marc Fischlin, Shafi Goldwasser, Silvio Micali: Identification Protocols Secure Against Reset Attacks. IACR Cryptology ePrint Archive 2000: 15 (2000) | |
| 78 | Joe Kilian, Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky: Reducibility and Completeness in Private Computations. SIAM J. Comput. 29(4): 1189-1208 (2000) | |
| 77 | Silvio Micali: Computationally Sound Proofs. SIAM J. Comput. 30(4): 1253-1298 (2000) | |
| 1999 | ||
| 76 | Silvio Micali, Leonid Reyzin: Improving the Exact Security of Fiat-Shamir Signature Schemes. CQRE 1999: 167-182 | |
| 75 | Amos Beimel, Tal Malkin, Silvio Micali: The All-or-Nothing Nature of Two-Party Secure Computation. CRYPTO 1999: 80-97 | |
| 74 | Christian Cachin, Silvio Micali, Markus Stadler: Computationally Private Information Retrieval with Polylogarithmic Communication. EUROCRYPT 1999: 402-414 | |
| 73 | Yevgeniy Dodis, Silvio Micali: Lower Bounds for Oblivious Transfer Reductions. EUROCRYPT 1999: 42-55 | |
| 72 | Silvio Micali, Michael O. Rabin, Salil P. Vadhan: Verifiable Random Functions. FOCS 1999: 120-130 | |
| 71 | Oded Goldreich, Shafi Goldwasser, Silvio Micali: Interleaved Zero-Knowledge in the Public-Key Model. Electronic Colloquium on Computational Complexity (ECCC) 6(24): (1999) | |
| 70 | Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali: Resettable Zero-Knowledge. Electronic Colloquium on Computational Complexity (ECCC)(42): (1999) | |
| 1998 | ||
| 69 | Silvio Micali: Computationally-Sound Checkers. MFCS 1998: 94-116 | |
| 1997 | ||
| 68 | Pesech Feldman, Silvio Micali: An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement. SIAM J. Comput. 26(4): 873-933 (1997) | |
| 1996 | ||
| 67 | Shai Halevi, Silvio Micali: Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing. CRYPTO 1996: 201-215 | |
| 66 | Shimon Even, Oded Goldreich, Silvio Micali: On-Line/Off-Line Digital Signatures. J. Cryptology 9(1): 35-67 (1996) | |
| 65 | Michael J. Fischer, Silvio Micali, Charles Rackoff: A Secure Protocol for the Oblivious Transfer (Extended Abstract). J. Cryptology 9(3): 191-195 (1996) | |
| 1995 | ||
| 64 | 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 | |
| 63 | Rosario Gennaro, Silvio Micali: Verifiable Secret Sharing as Secure Computation. EUROCRYPT 1995: 168-182 | |
| 1994 | ||
| 62 | Silvio Micali: CS Proofs (Extended Abstracts) FOCS 1994: 436-453 | |
| 61 | Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky: Reducibility and Completeness in Multi-Party Private Computations FOCS 1994: 478-489 | |
| 1993 | ||
| 60 | Frank Thomson Leighton, Silvio Micali: Secret-Key Agreement without Public-Key Cryptography. CRYPTO 1993: 456-479 | |
| 1992 | ||
| 59 | Silvio Micali: Fair Public-Key Cryptosystems. CRYPTO 1992: 113-138 | |
| 58 | Mihir Bellare, Silvio Micali: How to Sign Given Any Trapdoor Permutation. J. ACM 39(1): 214-233 (1992) | |
| 1991 | ||
| 57 | Silvio Micali, Phillip Rogaway: Secure Computation (Abstract). CRYPTO 1991: 392-404 | |
| 56 | 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) | |
| 55 | Silvio Micali, Claus-Peter Schnorr: Efficient, Perfect Polynomial Random Number Generators. J. Cryptology 3(3): 157-172 (1991) | |
| 54 | Manuel Blum, Alfredo De Santis, Silvio Micali, Giuseppe Persiano: Noninteractive Zero-Knowledge. SIAM J. Comput. 20(6): 1084-1118 (1991) | |
| 1990 | ||
| 53 | Silvio Micali, Tal Rabin: Collective Coin Tossing Without Assumptions nor Broadcasting. CRYPTO 1990: 253-266 | |
| 52 | Mihir Bellare, Silvio Micali, Rafail Ostrovsky: Perfect Zero-Knowledge in Constant Rounds STOC 1990: 482-493 | |
| 51 | Mihir Bellare, Silvio Micali, Rafail Ostrovsky: The (True) Complexity of Statistical Zero Knowledge STOC 1990: 494-502 | |
| 50 | Donald Beaver, Silvio Micali, Phillip Rogaway: The Round Complexity of Secure Protocols (Extended Abstract) STOC 1990: 503-513 | |
| 49 | Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest: A fair protocol for signing contracts. IEEE Transactions on Information Theory 36(1): 40-46 (1990) | |
| 1989 | ||
| 48 | Shimon Even, Oded Goldreich, Silvio Micali: On-Line/Off-Line Digital Schemes. CRYPTO 1989: 263-275 | |
| 47 | Joe Kilian, Silvio Micali, Rafail Ostrovsky: Minimum Resource Zero-Knowledge Proofs (Extended Abstract). CRYPTO 1989: 545-546 | |
| 46 | Mihir Bellare, Silvio Micali: Non-Interactive Oblivious Transfer and Spplications. CRYPTO 1989: 547-557 | |
| 45 | Joe Kilian, Silvio Micali, Rafail Ostrovsky: Minimum Resource Zero-Knowledge Proofs (Extended Abstract) FOCS 1989: 474-479 | |
| 44 | Paul Feldman, Silvio Micali: An Optimal Probabilistic Algorithm For Synchronous Byzantine Agreement. ICALP 1989: 341-378 | |
| 43 | Silvio Micali: "Perfect" Pseudo-Random Number Generation. IFIP Congress 1989: 121-126 | |
| 42 | Shafi Goldwasser, Silvio Micali, Charles Rackoff: The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comput. 18(1): 186-208 (1989) | |
| 1988 | ||
| 41 | Silvio Micali, Claus-Peter Schnorr: Efficient, Perfect Random Number Generators. CRYPTO 1988: 173-198 | |
| 40 | Mihir Bellare, Silvio Micali: How To Sign Given Any Trapdoor Function. CRYPTO 1988: 200-215 | |
| 39 | Silvio Micali, Adi Shamir: An Improvement of the Fiat-Shamir Identification and Signature Scheme. CRYPTO 1988: 244-247 | |
| 38 | Manuel Blum, Paul Feldman, Silvio Micali: Proving Security Against Chosen Cyphertext Attacks. CRYPTO 1988: 256-268 | |
| 37 | Alfredo De Santis, Silvio Micali, Giuseppe Persiano: Non-Interactive Zero-Knowledge with Preprocessing. CRYPTO 1988: 269-282 | |
| 36 | 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 | |
| 35 | Manuel Blum, Paul Feldman, Silvio Micali: Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract) STOC 1988: 103-112 | |
| 34 | Paul Feldman, Silvio Micali: Optimal Algorithms for Byzantine Agreement STOC 1988: 148-161 | |
| 33 | Mihir Bellare, Silvio Micali: How to Sign Given Any Trapdoor Function (Extended Abstract) STOC 1988: 32-42 | |
| 32 | 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) | |
| 31 | Silvio Micali, Charles Rackoff, Bob Sloan: The Notion of Security for Probabilistic Cryptosystems. SIAM J. Comput. 17(2): 412-426 (1988) | |
| 1987 | ||
| 30 | Alfredo De Santis, Silvio Micali, Giuseppe Persiano: Non-Interactive Zero-Knowledge Proof Systems. CRYPTO 1987: 52-72 | |
| 29 | 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 | ||
| 28 | 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 | |
| 27 | Silvio Micali, Charles Rackoff, Bob Sloan: The Notion of Security for Probabilistic Cryptosystems. CRYPTO 1986: 381-392 | |
| 26 | 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 | |
| 25 | Baruch Awerbuch, Silvio Micali: Dynamic deadlock resolution protocols (Extended Abstract) FOCS 1986: 196-207 | |
| 24 | Oded Goldreich, Silvio Micali, Avi Wigderson: Proofs that Release Minimum Knowledge. MFCS 1986: 639-650 | |
| 23 | Silvio Micali: Knowledge and Efficient Computation. TARK 1986: 353-362 | |
| 22 | Oded Goldreich, Shafi Goldwasser, Silvio Micali: How to construct random functions. J. ACM 33(4): 792-807 (1986) | |
| 21 | 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) | |
| 1985 | ||
| 20 | Paul Feldman, Silvio Micali: Byzantine Agreement in Constant Expected Time (and Trusting No One) FOCS 1985: 267-276 | |
| 19 | 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 | |
| 18 | Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest: A Fair Protocol for Signing Contracts (Extended Abstract). ICALP 1985: 43-52 | |
| 17 | Shafi Goldwasser, Silvio Micali, Charles Rackoff: The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract) STOC 1985: 291-304 | |
| 1984 | ||
| 16 | Oded Goldreich, Shafi Goldwasser, Silvio Micali: On the Cryptographic Applications of Random Functions. CRYPTO 1984: 276-288 | |
| 15 | Shafi Goldwasser, Silvio Micali, Ronald L. Rivest: A "Paradoxical'"Solution to the Signature Problem (Abstract). CRYPTO 1984: 467 | |
| 14 | Shafi Goldwasser, Silvio Micali, Ronald L. Rivest: A ``Paradoxical'' Solution to the Signature Problem (Extended Abstract) FOCS 1984: 441-448 | |
| 13 | Oded Goldreich, Shafi Goldwasser, Silvio Micali: How to Construct Random Functions (Extended Abstract) FOCS 1984: 464-479 | |
| 12 | Shafi Goldwasser, Silvio Micali: Probabilistic Encryption. J. Comput. Syst. Sci. 28(2): 270-299 (1984) | |
| 11 | Manuel Blum, Silvio Micali: How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM J. Comput. 13(4): 850-864 (1984) | |
| 1983 | ||
| 10 | Michael Luby, Silvio Micali, Charles Rackoff: How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin FOCS 1983: 11-21 | |
| 9 | Shafi Goldwasser, Silvio Micali, Andrew Chi-Chih Yao: Strong Signature Schemes STOC 1983: 431-439 | |
| 1982 | ||
| 8 | Shafi Goldwasser, Silvio Micali, Andrew Chi-Chih Yao: On Signatures and Authentication. CRYPTO 1982: 211-215 | |
| 7 | Manuel Blum, Silvio Micali: How to Generate Cryptographically Strong Sequences of Pseudo Random Bits FOCS 1982: 112-117 | |
| 6 | Shafi Goldwasser, Silvio Micali, Po Tong: Why and How to Establish a Private Code on a Public Network (Extended Abstract) FOCS 1982: 134-144 | |
| 5 | 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 | |
| 4 | Shafi Goldwasser, Silvio Micali: Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information STOC 1982: 365-377 | |
| 1981 | ||
| 3 | Silvio Micali: Two-Way Deterministic Finite Automata are Exponentially More Succinct Than Sweeping Automata. Inf. Process. Lett. 12(2): 103-105 (1981) | |
| 1980 | ||
| 2 | Silvio Micali, Vijay V. Vazirani: An O(sqrt(|v|) |E|) Algorithm for Finding Maximum Matching in General Graphs FOCS 1980: 17-27 | |
| 1 | Corrado Böhm, Silvio Micali: Minimal Forms in lambda-Calculus Computations. J. Symb. Log. 45(1): 165-171 (1980) | |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page