From passive to covert security at low cost
作者： Ivan Damgård , Martin Geisler , Jesper Buus Nielsen
DOI: 10.1007/978-3-642-11799-2_9
关键词:
摘要: Aumann and Lindell defined security against covert attacks, where the adversary is malicious, but only caught cheating with a certain probability. The idea that in many real-world cases, large probability of being sufficient to prevent from trying cheat. In this paper, we show how compile passively secure protocol for honest majority into one again catches 1/4. cost modified essentially twice original plus an overhead depends on number inputs.
springer.com
sci-hub.st 参考文章(18)
Oded Goldreich, , Silvio Micali, Avi Wigderson, , , How to play any mental game, or a completeness theorem for protocols with honest majority Providing Sound Foundations for Cryptography. pp. 307- 328 ,(2019) , 10.1145/3335741.3335755
Zuzana Beerliová-Trubíniová, Martin Hirt, Perfectly-secure MPC with linear communication complexity theory of cryptography conference. pp. 213- 230 ,(2008) , 10.1007/978-3-540-78524-8_13
Avi Wigderson, Shafi Goldwasser, Michael Ben-Or, Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) symposium on the theory of computing. pp. 1- 10 ,(1988)
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
Ivan Damgård, Jesper Buus Nielsen, Scalable and Unconditionally Secure Multiparty Computation Advances in Cryptology - CRYPTO 2007. pp. 572- 590 ,(2007) , 10.1007/978-3-540-74143-5_32
Piotr Berman, Juan A. Garay, Kenneth J. Perry, Optimal Early Stopping in Distributed Consensus (Extended Abstract) international workshop on distributed algorithms. pp. 221- 237 ,(1992) , 10.1007/3-540-56188-9_15
Peter Bogetoft, Dan Lund Christensen, Ivan Damgård, Martin Geisler, Thomas Jakobsen, Mikkel Krøigaard, Janus Dam Nielsen, Jesper Buus Nielsen, Kurt Nielsen, Jakob Pagter, Michael Schwartzbach, Tomas Toft, Secure Multiparty Computation Goes Live Financial Cryptography and Data Security. ,vol. 5628, pp. 325- 343 ,(2009) , 10.1007/978-3-642-03549-4_20
Joy Algesheimer, Jan Camenisch, Victor Shoup, Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products Advances in Cryptology — CRYPTO 2002. pp. 417- 432 ,(2002) , 10.1007/3-540-45708-9_27
Ivan Damgård, Yuval Ishai, Mikkel Krøigaard, Jesper Buus Nielsen, Adam Smith, Scalable Multiparty Computation with Nearly Optimal Work and Resilience international cryptology conference. pp. 241- 261 ,(2008) , 10.1007/978-3-540-85174-5_14
A. Barnoy, X. Deng, J.A. Garay, T. Kameda, Optimal amortized distributed consensus Information & Computation. ,vol. 120, pp. 93- 100 ,(1995) , 10.1006/INCO.1995.1101