- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c96 |      | |
| c95 | | 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. Economic Theory 147(3): 1300-1312 (2012) |
| c94 | | Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu: Mechanism design with approximate valuations. ITCS 2012: 34-38 |
| c93 | | |
| c92 | | |
| 2011 | ||
| j22 | | Sergei Izmalkov, Matt Lepinski, Silvio Micali: Perfect implementation. Games and Economic Behavior 71(1): 121-140 (2011) |
| c91 | | Pablo Daniel Azar, Jing Chen, Silvio Micali: Crowdsourced Bayesian Auctions - (Abstract). AMMA 2011: 53 |
| c90 | | |
| i7 | | |
| 2010 | ||
| j21 | | 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) |
| c89 | | Jing Chen, Silvio Micali, Paul Valiant: Robustly Leveraging Collusion in Combinatorial Auctions. ICS 2010: 81-93 |
| c88 | | Jing Chen, Avinatan Hassidim, Silvio Micali: Robust Perfect Revenue From Perfectly Informed Players. ICS 2010: 94-105 |
| 2009 | ||
| c87 | | |
| c86 | | |
| 2008 | ||
| c85 | | Moses Liskov, Silvio Micali: Online-Untransferable Signatures. Public Key Cryptography 2008: 248-267 |
| c84 | | |
| 2006 | ||
| c83 | | |
| c82 | | |
| c81 | | |
| i6 | | Rosario Gennaro, Silvio Micali: Independent Zero-Knowledge Sets. IACR Cryptology ePrint Archive 2006: 155 (2006) |
| 2005 | ||
| c80 | | Sergei Izmalkov, Silvio Micali, Matt Lepinski: Rational Secure Computation and Ideal Mechanism Design. FOCS 2005: 585-595 |
| c79 | | |
| c78 | | Silvio Micali, Chris Peikert, Madhu Sudan, David A. Wilson: Optimal Error Correction Against Computationally Bounded Noise. TCC 2005: 1-16 |
| c77 | | |
| 2004 | ||
| c76 | | Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Hovav Shacham: Sequential Aggregate Signatures from Trapdoor Permutations. EUROCRYPT 2004: 74-90 |
| c75 | | Matt Lepinski, Silvio Micali, Chris Peikert, Abhi Shelat: Completely fair SFE and coalition-safe cheap talk. PODC 2004: 1-10 |
| c74 | | 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 |
| c73 | | Silvio Micali, Leonid Reyzin: Physically Observable Cryptography (Extended Abstract). TCC 2004: 278-296 |
| 2003 | ||
| c72 | | Jonathan Herzog, Moses Liskov, Silvio Micali: Plaintext Awareness via Key Registration. CRYPTO 2003: 548-564 |
| c71 | | Markus Jakobsson, Frank Thomson Leighton, Silvio Micali, Michael Szydlo: Fractal Merkle Tree Representation and Traversal. CT-RSA 2003: 314-326 |
| c70 | | |
| c69 | | |
| i5 | | Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Hovav Shacham: Sequential Aggregate Signatures from Trapdoor Permutations. IACR Cryptology ePrint Archive 2003: 91 (2003) |
| i4 | | Silvio Micali, Leonid Reyzin: Physically Observable Cryptography. IACR Cryptology ePrint Archive 2003: 120 (2003) |
| 2002 | ||
| j20 | | Silvio Micali, Leonid Reyzin: Improving the Exact Security of Digital Signature Schemes. J. Cryptology 15(1): 1-18 (2002) |
| c68 | | |
| c67 | | |
| 2001 | ||
| c66 | | Moses Liskov, Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Adam Smith: Mutually Independent Commitments. ASIACRYPT 2001: 385-401 |
| c65 | | Silvio Micali, Kazuo Ohta, Leonid Reyzin: Accountable-subgroup multisignatures: extended abstract. ACM Conference on Computer and Communications Security 2001: 245-254 |
| c64 | | |
| c63 | | Silvio Micali, Leonid Reyzin: Min-round Resettable Zero-Knowledge in the Public-Key Model. EUROCRYPT 2001: 373-393 |
| c62 | | Mihir Bellare, Marc Fischlin, Shafi Goldwasser, Silvio Micali: Identification Protocols Secure against Reset Attacks. EUROCRYPT 2001: 495-511 |
| c61 | | |
| 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 | | |
| c60 | | Yevgeniy Dodis, Silvio Micali: Parallel Reducibility for Information-Theoretically Secure Computation. CRYPTO 2000: 74-92 |
| c59 | | Mihir Bellare, Alexandra Boldyreva, Silvio Micali: Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements. EUROCRYPT 2000: 259-274 |
| c58 | | Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali: Resettable zero-knowledge (extended abstract). STOC 2000: 235-244 |
| i3 | | Mihir Bellare, Marc Fischlin, Shafi Goldwasser, Silvio Micali: Identification Protocols Secure Against Reset Attacks. IACR Cryptology ePrint Archive 2000: 15 (2000) |
| 1999 | ||
| c57 | | Silvio Micali, Leonid Reyzin: Improving the Exact Security of Fiat-Shamir Signature Schemes. CQRE 1999: 167-182 |
| c56 | | Amos Beimel, Tal Malkin, Silvio Micali: The All-or-Nothing Nature of Two-Party Secure Computation. CRYPTO 1999: 80-97 |
| c55 | | Yevgeniy Dodis, Silvio Micali: Lower Bounds for Oblivious Transfer Reductions. EUROCRYPT 1999: 42-55 |
| c54 | | Christian Cachin, Silvio Micali, Markus Stadler: Computationally Private Information Retrieval with Polylogarithmic Communication. EUROCRYPT 1999: 402-414 |
| c53 | | |
| i2 | | Oded Goldreich, Shafi Goldwasser, Silvio Micali: Interleaved Zero-Knowledge in the Public-Key Model. . Electronic Colloquium on Computational Complexity (ECCC) 6(24) (1999) |
| i1 | | Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali: Resettable Zero-Knowledge. Electronic Colloquium on Computational Complexity (ECCC)(42) (1999) |
| 1998 | ||
| c52 | | |
| 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. Cryptology 9(1): 35-67 (1996) |
| j15 |  | Michael J. Fischer, Silvio Micali, Charles Rackoff: A Secure Protocol for the Oblivious Transfer (Extended Abstract). J. Cryptology 9(3): 191-195 (1996) |
| c51 | | Shai Halevi, Silvio Micali: Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing. CRYPTO 1996: 201-215 |
| 1995 | ||
| c50 | | 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 |
| c49 | | Rosario Gennaro, Silvio Micali: Verifiable Secret Sharing as Secure Computation. EUROCRYPT 1995: 168-182 |
| 1994 | ||
| c48 | | |
| 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 | | |
| 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. Cryptology 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 | | |
| 1990 | ||
| j10 | | 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) |
| 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 |
| 1989 | ||
| j9 | | Shafi Goldwasser, Silvio Micali, Charles Rackoff: The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comput. 18(1): 186-208 (1989) |
| c39 | | |
| 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 Spplications. 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 | | |
| 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 | | |
| 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 | | |
| 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 | | |
| 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 | | |
| 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 |
Data released under the ODC-BY 1.0 license — See also our legal information page