Utility dependence in correct and fair rational secret sharing

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

Volumn 5677 LNCS, Issue , 2009, Pages 559-576

  Asharov, Gilad ^a   Lindell, Yehuda ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHIC COMPUTATIONS; NON-SIMULTANEOUS; PUBLIC KNOWLEDGE; SECRET SHARING; STANDARD ASSUMPTIONS; UTILITY FUNCTIONS;

CRYPTOGRAPHY;

PROBLEM SOLVING;

EID: 70350343370     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03356-8_33     Document Type: Conference Paper

References (16)

1. Abraham, I., Dolev, D., Gonen, R., Halpern, J.Y.: Distributed Computing Meets Game Theory: Robust Mechanisms for Rational Secret Sharing and Multiparty Computation. In: The 25th PODC, pp. 53-62 (2006)
2. Cleve, R.: Limits on the Security of Coin Flips when Half the Processors are Faulty. In: 18th STOC, pp. 364-369 (1986)
3. Dodis, Y., Rabin, T.: Cryptography and Game Theory. In: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)
4. Goldreich, O.: Foundations of Cryptography. Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)
5. Gordon, S.D., Katz, J.: Rational Secret Sharing, Revisited. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol. 4116, pp. 229-241. Springer, Heidelberg (2006)
6. Halpern, J., Teague, V.: Rational Secret Sharing and Multiparty Computation. In: The 36th STOC, pp. 623-632 (2004)
7. Fuchsbauer, G., Katz, J., Levieil, E., Naccache, D.: Efficient Rational Secret Sharing in the Standard Communication Model. Cryptology ePrint Archive, Report #2008/488 (2008)
8. Katz, J.: Bridging Game Theory and Cryptography: Recent Results and Future Directions. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 251-272. Springer, Heidelberg (2008)
9. Kol, G., Naor, M.: Cryptography and Game Theory: Designing Protocols for Exchanging Information. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 320-339. Springer, Heidelberg (2008)
10. Kol, G., Naor, M.: Games for Exchanging Information. In: The 40th STOC, pp. 423-432 (2008)
11. Izmalkov, S., Micali, S., Lepinski, M.: Rational Secure Computation and Ideal Mechanism Design. In: The 46th FOCS, pp. 585-595 (2005)
12. Lepinski, M., Micali, S., Peikert, C., Shelat, A.: Completely Fair SFE and Coalition-Safe Cheap Talk. In: The 23rd PODC, pp. 1-10 (2004)
13. Lepinski, M., Micali, S., Shelat, A.: Collusion-Free Protocols. In: The 37th STOC, pp. 543-552 (2005)
14. Lysyanskaya, A., Triandopoulos, N.: Rationality and Adversarial Behavior in Multiparty Computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 180-197. Springer, Heidelberg (2006)
15. Shamir, A.: How to Share a Secret. Communications of the ACM 22(11), 612-613 (1979)
16. Ong, S.J., Parkes, D., Rosen, A., Vadhan, S.: Fairness with an Honest Minority and a Rational Majority. In: The 6th TCC. LNCS, vol. 5444, pp. 36-53. Springer, Heidelberg (2009)