Fair and Efficient Secure Multiparty Computation with Reputation Systems
作者： Gilad Asharov , Yehuda Lindell , Hila Zarosim
DOI: 10.1007/978-3-642-42045-0_11
关键词: Honesty 、 Computer security 、 Set (abstract data type) 、 Reliability (computer networking) 、 Reputation system 、 Reputation 、 Protocol (object-oriented programming) 、 Secure multi-party computation 、 Secure two-party computation 、 Computer science
摘要: A reputation system for a set of entities is essentially list scores that provides measure the reliability each entity in set. The score given to an can be interpreted (and literature it often [12]) as probability will behave honestly. In this paper, we ask whether or not possible utilize systems carrying out secure multiparty computation. We provide formal definitions computation setting, and carry theoretical study feasibility. present almost tight results showing when achieve fair our model. suggest applications model settings where some information about honesty other parties given. This preferable current situation either honest majority arbitrarily assumed, protocol dishonest used efficiency security guarantees (including fairness) are obtained.
springer.com
sci-hub.st 参考文章(25)
Moshe Babaioff, John Chuang, Michal Feldman, Algorithmic Game Theory: Incentives in Peer-to-Peer Systems Cambridge University Press. ,(2007) , 10.1017/CBO9780511800481.025
Dan Bogdanov, Sven Laur, Jan Willemson, Sharemind: A Framework for Fast Privacy-Preserving Computations european symposium on research in computer security. pp. 192- 206 ,(2008) , 10.1007/978-3-540-88313-5_13
Yonatan Aumann, Yehuda Lindell, Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries Theory of Cryptography. pp. 137- 156 ,(2007) , 10.1007/978-3-540-70936-7_8
Shai Halevi, Yehuda Lindell, Benny Pinkas, None, Secure computation on the web: computing without simultaneous interaction international cryptology conference. ,vol. 2011, pp. 132- 150 ,(2011) , 10.1007/978-3-642-22792-9_8
Ivan Damgård, Yuval Ishai, Constant-round multiparty computation using a black-box pseudorandom generator international cryptology conference. pp. 378- 394 ,(2005) , 10.1007/11535218_23
Ivan Damgård, Martin Geisler, Jesper Buus Nielsen, From passive to covert security at low cost theory of cryptography conference. pp. 128- 145 ,(2010) , 10.1007/978-3-642-11799-2_9
Oded Goldreich, Foundations of Cryptography Cambridge University Press. ,(2001) , 10.1017/CBO9780511546891
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
Eli Upfal, Michael Mitzenmacher, Probability and Computing: Randomized Algorithms and Probabilistic Analysis ,(2005)
T. Rabin, M. Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89. pp. 73- 85 ,(1989) , 10.1145/73007.73014