Universally-Composable Two-Party Computation in Two Rounds
暂无分享,去创建一个
[1] Oded Goldreich,et al. The Foundations of Cryptography - Volume 2: Basic Applications , 2001 .
[2] Cynthia Dwork,et al. Advances in Cryptology – CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part III , 2020, Annual International Cryptology Conference.
[3] Burton S. Kaliski. Advances in Cryptology - CRYPTO '97 , 1997 .
[4] Ronald Cramer,et al. Advances in Cryptology - EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005, Proceedings , 2005, EUROCRYPT.
[5] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[6] Rafail Ostrovsky,et al. Security of Blind Digital Signatures (Extended Abstract) , 1997, CRYPTO.
[7] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.
[8] Yuval Ishai,et al. The round complexity of verifiable secret sharing and secure multicast , 2001, STOC '01.
[9] Joe Kilian,et al. One-Round Secure Computation and Secure Autonomous Mobile Agents , 2000, ICALP.
[10] Jonathan Katz,et al. Universally Composable Multi-party Computation Using Tamper-Proof Hardware , 2007, EUROCRYPT.
[11] Hugo Krawczyk,et al. On the Composition of Zero-Knowledge Proof Systems , 1990, ICALP.
[12] Nancy A. Lynch,et al. A Lower Bound for the Time to Assure Interactive Consistency , 1982, Inf. Process. Lett..
[13] Rafail Ostrovsky,et al. Round-Optimal Secure Two-Party Computation , 2004, CRYPTO.
[14] Oded Goldreich,et al. How to construct constant-round zero-knowledge proof systems for NP , 1996, Journal of Cryptology.
[15] Yuval Ishai,et al. Randomizing polynomials: A new representation with applications to round-efficient secure computation , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[16] Moni Naor,et al. Efficient oblivious transfer protocols , 2001, SODA '01.
[17] Refik Molva,et al. Policy-based encryption schemes from bilinear pairings , 2006, ASIACCS '06.
[18] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[19] Yehuda Lindell,et al. A Proof of Security of Yao’s Protocol for Two-Party Computation , 2009, Journal of Cryptology.
[20] Ninghui Li,et al. Oblivious signature-based envelope , 2003, PODC '03.
[21] Oded Goldreich,et al. Foundations of Cryptography: List of Figures , 2001 .
[22] Mikhail J. Atallah,et al. Attribute-Based Access Control with Hidden Policies and Hidden Credentials , 2006, IEEE Transactions on Computers.
[23] David Chaum,et al. Blind Signatures for Untraceable Payments , 1982, CRYPTO.
[24] Oded Goldreich. Foundations of Cryptography: Index , 2001 .
[25] Oded Goldreich,et al. Foundations of Cryptography: Volume 1, Basic Tools , 2001 .
[26] Kevin S. McCurley,et al. Advances in Cryptology 1981 – 1997 , 2001, Lecture Notes in Computer Science.
[27] Yoram Moses,et al. Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds , 1998, SIAM J. Comput..
[28] Marc Fischlin,et al. Round-Optimal Composable Blind Signatures in the Common Reference String Model , 2006, CRYPTO.
[29] K. Srinathan,et al. Round-Optimal and Efficient Verifiable Secret Sharing , 2006, TCC.
[30] Silvio Micali,et al. The round complexity of secure protocols , 1990, STOC '90.
[31] Moti Yung,et al. Advances in Cryptology — CRYPTO 2002 , 2002, Lecture Notes in Computer Science.
[32] Rafail Ostrovsky,et al. Round Efficiency of Multi-party Computation with a Dishonest Majority , 2003, EUROCRYPT.
[33] Moti Yung,et al. Non-interactive cryptocomputing for NC/sup 1/ , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[34] Ninghui Li,et al. A Construction for General and Efficient Oblivious Commitment Based Envelope Protocols , 2006, ICICS.
[35] Gene Tsudik,et al. Revisiting Oblivious Signature-Based Envelopes , 2006, Financial Cryptography.
[36] Yuval Ishai,et al. Priced Oblivious Transfer: How to Sell Digital Goods , 2001, EUROCRYPT.
[37] Moni Naor. Advances in Cryptology - EUROCRYPT 2007, 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007, Proceedings , 2007, EUROCRYPT.
[38] Yehuda Lindell. Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation , 2001, CRYPTO.
[39] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[40] David Omer Horvitz,et al. Expressiveness of Definitions and Efficiency of Constructions in Computational Cryptography , 2007 .
[41] Ran Canetti,et al. Universally Composable Commitments , 2001, CRYPTO.
[42] Silvio Micali,et al. An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement , 1997, SIAM J. Comput..
[43] Birgit Pfitzmann,et al. Composition and integrity preservation of secure reactive systems , 2000, CCS.
[44] Rafail Ostrovsky,et al. Robust Non-interactive Zero Knowledge , 2001, CRYPTO.
[45] Oded Goldreich,et al. Foundations of Cryptography: Basic Tools , 2000 .
[46] Vitaly Shmatikov,et al. Efficient Two-Party Secure Computation on Committed Inputs , 2007, EUROCRYPT.
[47] Rafail Ostrovsky,et al. Security of blind digital signatures , 1997 .
[48] Matthew Franklin,et al. Advances in Cryptology – CRYPTO 2004 , 2004, Lecture Notes in Computer Science.
[49] Yehuda Lindell,et al. On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions , 2003, EUROCRYPT.
[50] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[51] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[52] Ran Canetti,et al. Universally composable protocols with relaxed set-up assumptions , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[53] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[54] Ran Canetti,et al. Universally Composable Security with Global Setup , 2007, TCC.
[55] Jörn Müller-Quade,et al. Universally composable zero-knowledge arguments and commitments from signature cards , 2007 .
[56] Aggelos Kiayias,et al. Self Protecting Pirates and Black-Box Traitor Tracing , 2001, CRYPTO.
[57] Kent E. Seamons,et al. Concealing complex policies with hidden credentials , 2004, CCS '04.
[58] Yehuda Lindell,et al. Universally composable two-party and multi-party secure computation , 2002, STOC '02.
[59] Yehuda Lindell,et al. A Proof of Yao's Protocol for Secure Two-Party Computation , 2004, Electron. Colloquium Comput. Complex..
[60] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.
[61] Yuval Ishai,et al. On 2-Round Secure Multiparty Computation , 2002, CRYPTO.