Round Optimal Concurrent MPC via Strong Simulation
暂无分享,去创建一个
Amit Sahai | Vipul Goyal | Abhishek Jain | Dakshita Khurana | Saikrishna Badrinarayanan | A. Sahai | Abhishek Jain | Vipul Goyal | S. Badrinarayanan | Dakshita Khurana
[1] Yuval Ishai,et al. Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator , 2005, CRYPTO.
[2] Ran Canetti,et al. Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions , 2010, FOCS.
[3] Shai Halevi,et al. Four Round Secure Computation Without Setup , 2017, TCC.
[4] Brent Waters,et al. How to Generate and Use Universal Samplers , 2016, ASIACRYPT.
[5] Rafael Pass,et al. Two-Round Concurrent Non-Malleable Commitment from Time-Lock Puzzles , 2017, IACR Cryptol. ePrint Arch..
[6] Rafael Pass,et al. Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments , 2013, computational complexity.
[7] 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).
[8] Moni Naor,et al. Non-Malleable Cryptography (Extended Abstract) , 1991, STOC 1991.
[9] Rafail Ostrovsky,et al. Constructing Non-malleable Commitments: A Black-Box Approach , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[10] Arka Rai Choudhuri,et al. A New Approach to Round-Optimal Secure Multiparty Computation , 2017, CRYPTO.
[11] Sanjam Garg,et al. The Exact Round Complexity of Secure Computation , 2016, EUROCRYPT.
[12] Amit Sahai,et al. Concurrent Non-Malleable Zero Knowledge , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[13] Tatsuaki Okamoto,et al. Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol , 2014, TCC.
[14] Amit Sahai,et al. Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[15] Andrew Chi-Chih Yao,et al. Protocols for Secure Computations (Extended Abstract) , 1982, FOCS.
[16] Silvio Micali,et al. The Round Complexity of Secure Protocols (Extended Abstract) , 1990, STOC 1990.
[17] Rafael Pass,et al. Concurrent Non-malleable Commitments from Any One-Way Function , 2008, TCC.
[18] Amit Sahai,et al. Breaking the Three Round Barrier for Non-malleable Commitments , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[19] Rafael Pass,et al. Constant-round non-malleable commitments from any one-way function , 2011, STOC '11.
[20] Silvio Micali,et al. A Completeness Theorem for Protocols with Honest Majority , 1987, STOC 1987.
[21] Vipul Goyal,et al. Constant round non-malleable protocols using one way functions , 2011, STOC '11.
[22] Yael Tauman Kalai,et al. Distinguisher-Dependent Simulation in Two Rounds and its Applications , 2017, CRYPTO.
[23] Amit Sahai,et al. New notions of security: achieving universal composability without trusted setup , 2004, STOC '04.
[24] Amit Sahai,et al. Round Optimal Blind Signatures , 2011, CRYPTO.
[25] Tal Malkin,et al. Generalized Environmental Security from Number Theoretic Assumptions , 2006, TCC.
[26] Amit Sahai,et al. Concurrently Secure Computation in Constant Rounds , 2012, EUROCRYPT.
[27] Yuval Ishai,et al. Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions , 2017, ASIACRYPT.
[28] Moni Naor,et al. Non-malleable cryptography , 1991, STOC '91.
[29] Rafael Pass,et al. Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition , 2003, EUROCRYPT.
[30] Rafail Ostrovsky,et al. Round Efficiency of Multi-party Computation with a Dishonest Majority , 2003, EUROCRYPT.
[31] Vinod Vaikuntanathan,et al. Adaptive One-Way Functions and Applications , 2008, CRYPTO.
[32] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[33] Vinod Vaikuntanathan,et al. Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE , 2012, EUROCRYPT.
[34] Daniel Wichs,et al. Two Round Multiparty Computation via Multi-key FHE , 2016, EUROCRYPT.
[35] Ron Rothblum,et al. Spooky Encryption and Its Applications , 2016, CRYPTO.
[36] Rafael Pass,et al. Concurrent non-malleable commitments , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[37] Oded Goldreich,et al. The Foundations of Cryptography - Volume 2: Basic Applications , 2001 .
[38] Andrew Chi-Chih Yao,et al. How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[39] Sanjam Garg,et al. On the Exact Round Complexity of Self-composable Two-Party Computation , 2017, EUROCRYPT.
[40] Hoeteck Wee,et al. Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[41] Amit Sahai,et al. Two-Message Non-Malleable Commitments from Standard Sub-exponential Assumptions , 2017, IACR Cryptol. ePrint Arch..
[42] Sanjam Garg,et al. Efficient Round Optimal Blind Signatures , 2014, IACR Cryptol. ePrint Arch..
[43] Rafael Pass,et al. Bounded-concurrent secure multi-party computation with a dishonest majority , 2004, STOC '04.
[44] Yuval Ishai,et al. Scalable Secure Multiparty Computation , 2006, CRYPTO.