Collusion-free protocols in the mediated model

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

Volumn 5157 LNCS, Issue , 2008, Pages 497-514

  Alwen, Joël ^a   Shelat, Abhi ^b   Visconti, Ivan ^c  

^a NEW YORK UNIVERSITY   (United States)

^b UNIVERSITY OF VIRGINIA   (United States)

^c UNIVERSITY OF SALERNO   (Italy)

Author keywords

Commitments; Mediated Communication; Secure Collusion Free; ZKPoK

Indexed keywords

CIVIL AVIATION; COMMUNICATION CHANNELS (INFORMATION THEORY); LAWS AND LEGISLATION; STANDARDS;

COMMITMENT SCHEMES; COMMITMENTS; COMMUNICATION CHANNELS; CRYPTOLOGY; FREE PROPERTY; MEDIATED COMMUNICATION; MESSAGE TRAFFIC; NEW APPROACHES; SECURE COLLUSION FREE; ZERO-KNOWLEDGE PROOF OF KNOWLEDGE; ZKPOK;

CRYPTOGRAPHY;

EID: 51849140874     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85174-5_28     Document Type: Conference Paper

References (20)

1. Alparone, M., Persiano, G.: Staganography-free implementation of yao's protocol. Technical report (unpublished, 2006)
2. Aumann, R.J.: Subjectivity and Correlation in Randomized Strategies. Journal of Mathematical Economics 1(1), 67-96 (1974)
3. Barak, B., Canetti, R., Lindell, Y., Pass, R., Rabin, T.: Secure computation without authentication. In: CRYPTO 2006. LNCS, vol. 4622, pp. 361-377. Springer, Heidelberg (2005)
4. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In: STOC 1988: Proceedings of the twentieth annual ACM symposium on Theory of computing, pp. 1-10. ACM, New York (1988)
5. Boneh, D., Golle, P.: Almost Entirely Correct Mixing with Applications to Voting. In: CCS 2002, pp. 68-77 (2002)
6. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: Proc. 42nd FOCS, pp. 136-145 (2001)
7. Chaum, D., Ryan, P., Schneider, S.: A Practical Voter-Verifiable Election Scheme. In: de Capitani di Vimercati, S., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 118-139. Springer, Heidelberg (2005)
8. Cramer, R., Gennaro, R., Schoenmakers, B.: A Secure and Optimally Efficient Multi-Authority Election Scheme. In: EUROCRYPT 2006. LNCS, pp. 103-118. Springer, Heidelberg (2006)
9. Cramton, P., Schwartz, J.: Collusive bidding in the fcc spectrum auctions. Technical Report 02collude, University of Maryland, Department of Economics (December 2002), http://ideas.repec.org/p/pcc/pccumd/02collude.html
10. Dwork, C., Naor, M., Sahai, A.: Concurrent Zero-Knowledge. In: 30th ACM Symposium on Theory of Computing (STOC 1998), pp. 409-418. ACM, New York (1998)
11. Goldreich, O., Micali, S., Wigderson, A.: How to Play Any Mental Game. In: STOC 1987: Proceedings of the nineteenth annual ACM conference on Theory of computing, pp. 218-229. ACM Press, New York (1987)
12. Goldreich, O., Micali, S., Wigderson, A.: Proofs that Yield Nothing but their Validity or all Languages in NP have Zero-Knowledge Proof Systems. J. ACM 38(3), 690-728 (1991)
13. Izmalkov, S., Lepinski, M., Micali, S.: Verifiably secure devices. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 273-301. Springer, Heidelberg (2008)
14. Izmalkov, S., Micali, S., Lepinski, M.: Rational Secure Computation and Ideal Mechanism Design. In: FOCS 2005: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, Washington, DC, USA, pp. 585-595. IEEE Computer Society, Los Alamitos (2005)
15. Lepinksi, M., Micali, S., Shelat, A.: Collusion-Free Protocols. In: STOC 2005: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pp. 543-552. ACM, New York (2005)
16. Lepinski, M., Micali, S., Peikert, C., Shelat, A.: Completely Fair SFE and Coalition-Safe Cheap Talk. In: PODC 2004: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pp. 1-10. ACM Press, New York (2004)
17. Micciancio, D., Petrank, E.: Simulatable Commitments and Efficient Concurrent Zero-Knowledge. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 140-159. Springer, Heidelberg (2003)
18. Neff, C.: A Verifiable Secret Shuffle and its Application to e-Voting. In: CCS 2001, pp. 116-125 (2001)
19. Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent Zero-Knowledge with Logarithmic Round Complexity. In: 43th IEEE Symposium on Foundations of Computer Science (FOCS 2002), pp. 366-375 (2002)
20. Simmons, G.J.: The prisoners' problem and the subliminal channel. In: CRYPTO 1983, pp. 51-67 (1983)