Fair and efficient secure multiparty computation with reputation systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8270 LNCS, Issue PART 2, 2013, Pages 201-220

  Asharov, Gilad ^a   Lindell, Yehuda ^a   Zarosim, Hila ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

new models; reputation systems; secure multiparty computation

Indexed keywords

CURRENT SITUATION; FORMAL DEFINITION; REPUTATION SYSTEMS; SECURE COMPUTATION; SECURE MULTI-PARTY COMPUTATION; THEORETICAL STUDY;

SECURITY OF DATA;

CRYPTOGRAPHY;

EID: 84892377298     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-42045-0_11     Document Type: Conference Paper

References (21)

1. Aumann, Y., Lindell, Y.: Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 137-156. Springer, Heidelberg (2007)
2. Babaioff, M., Chuang, J., Feldman, M.: Incentives in Peer-to-Peer Systems. In: Algorithmic Game Theory, ch. 23. Cambridge University Press (2007)
3. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In: 20th STOC, pp. 1-10 (1988)
4. Bogetoft, P., et al.: Secure Multiparty Computation Goes Live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 325-343. Springer, Heidelberg (2009)
5. Bogdanov, D., Laur, S., Willemson, J.: Sharemind: A Framework for Fast Privacy-Preserving Computations. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol. 5283, pp. 192-206. Springer, Heidelberg (2008)
6. Canetti, R.: Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology 13(1), 143-202 (2000)
7. Chaum, D., Crépeau, C., Damgård, I.: Multi-party Unconditionally Secure Protocols. In: 20th STOC, pp. 11-19 (1988)
8. Cleve, R.: Limits on the Security of Coin Flips when Half the Processors are Faulty. In: 18th STOC, pp. 364-369 (1986)
9. Damgård, I., Geisler, M., Nielsen, J.B.: From Passive to Covert Security at Low Cost. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 128-145. Springer, Heidelberg (2010)
10. Damgård, I., Ishai, Y.: Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 378-394. Springer, Heidelberg (2005)
11. Dubhashi, D., Panconesi, A.: Concentration of Measure for the Analysis of Randomized Algorithms, 1st edn. Cambridge University Press, New York (2009)
12. Friedman, E., Resnick, P., Sami, R.: Manipulation-Resistant Reputation Systems. In: Algorithmic Game Theory, ch. 27. Cambridge University Press (2007)
13. Goldreich, O.: Foundations of Cryptography: Volume 1 - Basic Tools. Cambridge University Press (2001)
14. Goldreich, O.: Foundations of Cryptography: Volume 2 - Basic Applications. Cambridge University Press (2004)
15. Goldreich, O., Micali, S., Wigderson, A.: How to Play any Mental Game - A Completeness Theorem for Protocols with Honest Majority. In: 19th STOC, pp. 218-229 (1987), For details see [14]
16. Goyal, V., Mohassel, P., Smith, A.: Efficient Two Party and Multi Party Computation Against Covert Adversaries. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 289-306. Springer, Heidelberg (2008)
17. Halevi, S., Lindell, Y., Pinkas, B.: Secure Computation on the Web: Computing without Simultaneous Interaction. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 132-150. Springer, Heidelberg (2011)
18. Ishai, Y., Katz, J., Kushilevitz, E., Lindell, Y., Petrank, E.: On Achieving the "Best of BothWorlds" in Secure Multiparty Computation. SIAM J. Comput. 40(1), 122-141 (2011)
19. Hoeffding, W.: Probability Inequalities for Sums of Bounded Random Variables. Journal of the American Statistical Association 58(301), 13-30 (1963)
20. Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, New York (2005)
21. Rabin, T., Ben-Or, M.: Verifiable Secret Sharing and Multi-party Protocols with Honest Majority. In: 21st STOC, pp. 73-85 (1989)