Privacy homomorphisms for E-gambling and mental poker

2006 IEEE International Conference on Granular Computing

Volumn , Issue , 2006, Pages 788-791

  Castellà Roca, Jordi ^b   Daza, Vanesa ^b   Domingo Ferrer, Josep ^a,b   Sebé, Francesc ^b  

^a IEEE

^b UNIVERSITAT ROVIRA I VIRGILI   (Spain)

Author keywords

Cryptography; Mental poker; Privacy homomorphism

Indexed keywords

HOMOMORPHIC ENCRYPTION; HOMOMORPHIC PROPERTIES; MENTAL POKERS; PRIVACY HOMOMORPHISM;

COMPUTER NETWORKS; DATA PRIVACY; GAME THEORY; NETWORK PROTOCOLS; SECURITY OF DATA;

ELECTRONIC COMMERCE;

EID: 33751085880     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. C. Hall and B. Schneier, "Remote electronic gambling," in 13th Annual Computer Security Applications Conference, ACM, December 1997, pp. 227-230.
2. K. Kurosawa, Y. Katayama, W. Ogata, and S. Tsujii, "General public key cryptosystems and mental poker protocols," in Advances in Cryptology - Eurocrypt '90, ser. Lecture Notes in Computer Science, I. B. Damgård, Ed., vol. 473. Springer-Verlag, 1990, pp. 374-388.
3. W. Soo, A. Samsudin, and A. Goh, "Efficient mental card shuffling via optimised arbitrary-sized benes permutation network," in Information Security Conference, ser. Lecture Notes in Computer Science, vol. 2433. Springer-Verlag, 2002, pp. 446-458.
4. J. Castellà-Roca, J. Domingo-Ferrer, A. Riera, and J. Borrell, "Practical mental poker without a ttp based on homomorphic encryption," in Progress in Cryptology-Indocrypt'2003, ser. Lecture Notes in Computer Science, T. Johansson and S. Maitra, Eds., no. 2904. Berlin: Springer-Verlag, 2003, pp. 280-294.
5. A. Bamett and N. Smart, "Mental poker revisited," in Proc. Cryptography and Coding, ser. Lecture Notes in Computer Science, vol. 2898. Springer-Verlag, December 2003, pp. 370-383.
6. R. Rivest, L. Adleman, and M. Dertouzos, "On data banks and privacy homomorphisms," in Foundations of Secure Computation, R. DeMillo, Ed. New York: Academic Press, 1978, pp. 169-179.
7. T. ElGamal, "A public-key cryptosystem and a signature scheme based on discrete logarithms," IEEE Transactions on Information Theory, vol. 31, pp. 469-472, July 1985.
8. J. Domingo-Ferrer, "A new privacy homomorphism and applications," Information Processing Letters, vol. 60, no. 5, pp. 277-282, December 1996. [Online]. Available: citeseer.nj.nec.com/290190.html
9. J. Domingo-Ferrer, "A provably secure additive and multiplicative privacy homomorphishm," in Information Security, ser. Lecture Notes in Computer Science, A. Chan and V. Gligor, Eds., vol. 2433. Springer Verlag, 2002, pp. pp. 471-483.
10. D.-R. Denning, Cryptography and Data Security, 2nd ed. Addison-Wesley, January 1983.
11. C. Crépeau, "A secure poker protocol that minimizes the effect of player coalitions," in Advances in Cryptology - Crypto '85, ser. Lecture Notes in Computer Science, H. C. Williams, Ed., vol. 218. Berlin: Springer-Verlag, 1985, pp. 73-86.
12. M. Goldwasser, S. Micali, and C. Rackoff, "The knowledge complexity of interactive proof systems," SIAM Journal of Computing, vol. 18, no. 1, pp. 186-208, 1989.
13. E. Kamin, J. Green, and M. Hellman, "On secret sharing systems," IEEE Trans. Information Theory, vol. IT-29, no. 1, pp. 35-41, 1983.
14. A. Shamir, "How to share a secret," in Communications of the ACM, vol. 22, 1979, pp. 612-613.
15. M. Jakobsson and A. Juels, "Millimix: Mixing in small batches," DIMACS Technical Report, Tech. Rep. 99-33, 1999.
16. P. Paillier, "Public key cryptosystems based on composite residue classes," in Advances in Cryptology - EuroCrypt'99, ser. Lecture Notes in Computer Science, vol. 1592. Springer-Verlag, 1999, pp. 223-238.
17. G. Brassard, C. Crépeau, and J. Robert, "All-or-nothing disclosure of secrets," in Advances in Cryptology Crypto'86, ser. Lecture Notes in Computer Science, vol. 263. Springer-Verlag, 1986, pp. 234-238.