Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol
作者： Susumu Kiyoshima , Yoshifumi Manabe , Tatsuaki Okamoto
DOI: 10.1007/978-3-642-54242-8_15
关键词:
摘要: We present the first general MPC protocol that satisfies following: (1) construction is black-box, (2) universally composable in plain model, and (3) number of rounds constant. The security our proven angel-based UC under assumption existence one-way functions are secure against sub-exponential-time adversaries constant-round semi-honest oblivious transfer protocols quasi-polynomial-time adversaries. obtain by constructing a CCA-secure commitment scheme black-box way To justify use such sub-exponential hardness obtaining scheme, we show if reductions used, there does not exist any falsifiable polynomial-time assumptions.
springer.com
sci-hub.st 参考文章(39)
Vipul Goyal, Huijia Lin, Omkant Pandey, Rafael Pass, Amit Sahai, Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma Theory of Cryptography. pp. 260- 289 ,(2015) , 10.1007/978-3-662-46494-6_12
Rafael Pass, Huijia Lin, Muthuramakrishnan Venkitasubramaniam, A Unified Framework for UC from Only OT Advances in Cryptology – ASIACRYPT 2012. pp. 699- 717 ,(2012) , 10.1007/978-3-642-34961-4_42
Rafael Pass, Hoeteck Wee, Black-Box Constructions of Two-Party Protocols from One-Way Functions theory of cryptography conference. pp. 403- 418 ,(2009) , 10.1007/978-3-642-00457-5_24
R. Canetti, Universally composable security: a new paradigm for cryptographic protocols international conference on cluster computing. pp. 136- 145 ,(2001) , 10.1109/SFCS.2001.959888
Rafael Pass, Muthuramakrishnan Venkitasubramaniam, On constant-round concurrent zero-knowledge theory of cryptography conference. pp. 553- 570 ,(2008) , 10.1007/978-3-540-78524-8_30
Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee, Simple, Black-Box Constructions of Adaptively Secure Protocols theory of cryptography conference. pp. 387- 402 ,(2009) , 10.1007/978-3-642-00457-5_23
Tal Malkin, Ryan Moriarty, Nikolai Yakovenko, Generalized Environmental Security from Number Theoretic Assumptions Theory of Cryptography. pp. 343- 359 ,(2006) , 10.1007/11681878_18
Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee, Black-box construction of a non-malleable encryption scheme from any semantically secure one theory of cryptography conference. pp. 427- 444 ,(2008) , 10.1007/978-3-540-78524-8_24
Iftach Haitner, Semi-honest to malicious oblivious transfer: the black-box way theory of cryptography conference. pp. 412- 426 ,(2008) , 10.1007/978-3-540-78524-8_23
Rafael Pass, Simulation in quasi-polynomial time, and its application to protocol composition theory and application of cryptographic techniques. pp. 160- 176 ,(2003) , 10.1007/3-540-39200-9_10