Round-Optimal Secure Two-Party Computation from Trapdoor Permutations
暂无分享,去创建一个
Rafail Ostrovsky | Ivan Visconti | Luisa Siniscalchi | Michele Ciampi | R. Ostrovsky | Ivan Visconti | Michele Ciampi | Luisa Siniscalchi
[1] Arka Rai Choudhuri,et al. A New Approach to Round-Optimal Secure Multiparty Computation , 2017, CRYPTO.
[2] Ivan Visconti,et al. Improved OR Composition of Sigma-Protocols , 2016, IACR Cryptol. ePrint Arch..
[3] Ivan Damgård,et al. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols , 1994, CRYPTO.
[4] Silvio Micali,et al. How to play any mental game, or a completeness theorem for protocols with honest majority , 2019, Providing Sound Foundations for Cryptography.
[5] Manuel Blum,et al. How to Prove a Theorem So No One Else Can Claim It , 2010 .
[6] Oded Goldreich,et al. The Foundations of Cryptography - Volume 2: Basic Applications , 2001 .
[7] Rafael Pass,et al. Constant-round non-malleable commitments from any one-way function , 2011, STOC '11.
[8] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[9] Rafail Ostrovsky,et al. Round-Optimal Black-Box Two-Party Computation , 2015, CRYPTO.
[10] Adi Shamir,et al. Publicly Verifiable Non-Interactive Zero-Knowledge Proofs , 1990, CRYPTO.
[11] R. Ostrovsky,et al. Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds , 2017, IACR Cryptol. ePrint Arch..
[12] Sampath Kannan,et al. The relationship between public key encryption and oblivious transfer , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[13] H. Shacham,et al. Four-Round Concurrent Non-Malleable Commitments from One-Way Functions , 2016 .
[14] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[15] Andrew Chi-Chih Yao,et al. Protocols for Secure Computations (Extended Abstract) , 1982, FOCS.
[16] Ivan Visconti,et al. Online/Offline OR Composition of Sigma Protocols , 2016, IACR Cryptol. ePrint Arch..
[17] Sanjam Garg,et al. The Exact Round Complexity of Secure Computation , 2016, EUROCRYPT.
[18] Rafail Ostrovsky,et al. Round-Optimal Secure Two-Party Computation , 2004, CRYPTO.
[19] Vinod Vaikuntanathan,et al. Adaptive One-Way Functions and Applications , 2008, CRYPTO.
[20] Rafail Ostrovsky,et al. Concurrent Non-Malleable Commitments (and More) in 3 Rounds , 2016, CRYPTO.
[21] Rafail Ostrovsky,et al. Robust Non-interactive Zero Knowledge , 2001, CRYPTO.
[22] Juan A. Garay,et al. Strengthening Zero-Knowledge Protocols Using Signatures , 2003, Journal of Cryptology.