Input-Indistinguishable Computation
暂无分享,去创建一个
Silvio Micali | Rafael Pass | Alon Rosen | R. Pass | S. Micali | Alon Rosen
[1] Yehuda Lindell,et al. Concurrent general composition of secure protocols in the timing model , 2005, STOC '05.
[2] Moni Naor,et al. Nonmalleable Cryptography , 2000, SIAM Rev..
[3] Oded Goldreich,et al. Definitions and properties of zero-knowledge proof systems , 1994, Journal of Cryptology.
[4] Yehuda Lindell,et al. On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions , 2003, EUROCRYPT.
[5] Silvio Micali,et al. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..
[6] Donald Beaver,et al. Foundations of Secure Interactive Computing , 1991, CRYPTO.
[7] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[8] Amit Sahai,et al. How to play almost any mental game over the net - concurrent composition via super-polynomial simulation , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[9] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[10] Yehuda Lindell,et al. General Composition and Universal Composability in Secure Multiparty Computation , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[11] Abhi Shelat,et al. Completely fair SFE and coalition-safe cheap talk , 2004, PODC '04.
[12] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[13] Silvio Micali,et al. Parallel Reducibility for Information-Theoretically Secure Computation , 2000, CRYPTO.
[14] Moni Naor,et al. Non-malleable cryptography , 1991, STOC '91.
[15] Rafael Pass,et al. Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition , 2003, EUROCRYPT.
[16] Birgit Pfitzmann,et al. A model for asynchronous reactive systems and its application to secure message transmission , 2001, Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001.
[17] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[18] Boaz Barak,et al. How to go beyond the black-box simulation barrier , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[19] Amit Sahai,et al. Concurrent zero knowledge with logarithmic round-complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[21] Joe Kilian,et al. On the Concurrent Composition of Zero-Knowledge Proofs , 1999, EUROCRYPT.
[22] Joe Kilian,et al. Lower bounds for zero knowledge on the Internet , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[23] John B. Shoven,et al. I , Edinburgh Medical and Surgical Journal.
[24] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[25] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[26] Manuel Blum,et al. Noninteractive Zero-Knowledge , 1991, SIAM J. Comput..
[27] Yehuda Lindell,et al. Concurrent Composition of Secure Protocols in the Timing Model , 2007, Journal of Cryptology.
[28] Adi Shamir,et al. Witness indistinguishable and witness hiding protocols , 1990, STOC '90.
[29] Rafael Pass,et al. Bounded-concurrent secure two-party computation in a constant number of rounds , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[30] Amit Sahai,et al. New notions of security: achieving universal composability without trusted setup , 2004, STOC '04.
[31] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[32] Rafael Pass,et al. Bounded-concurrent secure multi-party computation with a dishonest majority , 2004, STOC '04.
[33] Leonid A. Levin,et al. Fair Computation of General Functions in Presence of Immoral Majority , 1990, CRYPTO.
[34] Yehuda Lindell,et al. Lower Bounds for Concurrent Self Composition , 2004, TCC.
[35] Hugo Krawczyk,et al. On the Composition of Zero-Knowledge Proof Systems , 1990, ICALP.
[36] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[37] A. Yao,et al. Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.
[38] Yehuda Lindell,et al. Bounded-concurrent secure two-party computation without setup assumptions , 2003, STOC '03.
[39] Rafael Pass,et al. New and improved constructions of non-malleable cryptographic protocols , 2005, STOC '05.
[40] Rafael Pass,et al. Concurrent non-malleable commitments , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[41] Moni Naor,et al. Concurrent zero-knowledge , 2004, JACM.
[42] Ran Canetti,et al. Universally composable protocols with relaxed set-up assumptions , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[43] Silvio Micali,et al. Secure Computation (Abstract) , 1991, CRYPTO.
[44] J. Kilian,et al. Concurrent and Resettable Zero-Knowledge in Poly-logarithmic Rounds [ Extended Abstract ] , 2001 .