Efficient cryptographic protocol design based on distributed El gamal encryption

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

Volumn 3935 LNCS, Issue , 2006, Pages 32-47

  Brandt, Felix ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; ERRORS; NETWORK PROTOCOLS; SECURITY OF DATA;

BOOLEAN DISJUNCTIONS; COMMUNICATION COMPLEXITY; HAMMING DISTANCE; MULTIPARTY COMPUTATION PROTOCOLS;

CRYPTOGRAPHY;

EID: 33745824910     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11734727_5     Document Type: Conference Paper

References (42)

1. [ACS02] J. Algesheimer, J. Camenisch, and V. Shoup. Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In Proc. of 22th CRYPTO Conference, volume 2442 of LNCS, pages 417-432. Springer, 2002.
2. [AMP04] G. Aggarwal, N. Mishra, and B. Pinkas. Secure computation of the kth-ranked element. In Proc. of 21st Eurocrypt Conference, volume 3027 of LNCS, pages 40-55. Springer, 2004.
3. [BF97] D. Boneh and M. Franklin. Efficient generation of shared RSA keys. In Proc. of 17th CRYPTO Conference, volume 1294 of LNCS, pages 425-439. Springer, 1997.
4. [BFKR90] D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with low communication overhead. In Proc. of 10th CRYPTO Conference, number 537 in LNCS, pages 62-76. Springer, 1990.
5. [BGN05] D. Boneh, E. Goh, and K. Nissim. Evaluating 2-DNF formulas on cipher-texts. In Proc. of 2nd Theory of Cryptography Conference (TCC), volume 3378 of LNCS, pages 325-341. Springer, 2005.
6. [BMR90] D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols. In Proc. of 22nd STOC, pages 503-513. ACM Press, 1990.
7. [BST01] F. Boudot, B. Schoenmakers, and J. Traoré. A fair and efficient solution to the socialist millionaires' problem. Discrete Applied Mathematics, 111(1-2):23-36, 2001.
8. [CC00] C. Cachin and J. Camenisch. Optimistic fair secure computation. In Proc. of 20th CRYPTO Conference, volume 1880 of LNCS, pages 93-111. Springer, 2000.
9. [CDN01] R. Cramer, I. Damgård, and J. B. Nielsen. Multiparty computation from threshold homomorphic encryption. In Proc. of 18th Eurocrypt Conference, volume 2045 of LNCS, pages 280-300. Springer, 2001.
10. [CDS94] R. Cramer, I. Damgård, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Proc. of 14th CRYPTO Conference, volume 893 of LNCS, pages 174-187. Springer, 1994.
11. [CGS97] R. Cramer, R. Gennaro, and B. Schoenmakers. A secure and optimally efficient multi-authority election scheme. In Proc. of 14th Eurocrypt Conference, volume 1233 of LNCS, pages 103-118. Springer, 1997.
12. [CP92] D. Chaum and T. P. Pedersen. Wallet databases with observers. In Proc. of 12th CRYPTO Conference, volume 740 of LNCS, pages 3.1-3.6. Springer, 1992.
13. [Dam02] I. Damgård. On ∑-protocols. Lecture Notes, University of Aarhus, Department for Computer Science, 2002.
14. [DDO+01] A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano, and A. Sahai. Robust non-interactive zero knowledge. In Proc. of 21th CRYPTO Conference, volume 2139 of LNCS, pages 566-598. Springer, 2001.
15. [DK01] I. Damgård and M. Koprowski. Practical threshold RSA signatures without a trusted dealer. In Proc. of 18th Eurocrypt Conference, volume 2045 of LNCS, pages 152-165. Springer, 2001.
16. [El 85] T. El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31:469-472, 1985.
17. [Fis01] M. Fischlin. A cost-effective pay-per-multiplication comparison method for millionaires. In Proceedings of the Cryptographers' Track at the 10th RSA Conference, volume 2020 of LNCS, pages 457-472, 2001.
18. [FS87] A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Proc. of 12th CRYPTO Conference, LNCS, pages 186-194. Springer, 1987.
19. [Gil99] N. Gilboa. Two party RSA key generation. In Proc. of 19th CRYPTO Conference, volume 1666 of LNCS, pages 116-129. Springer, 1999.
20. [GJKR99] R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Secure distributed key generation for discrete-log based cryptosystems. In Proc. of 16th Eurocrypt Conference, volume 1592 of LNCS, pages 295-310. Springer, 1999.
21. [GJKR03] R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Applications of Pedersen's distributed key generation protocol. In Proc. of Cryptographers' Track at the 12th RSA Conference, volume 2612 of LNCS, pages 373-390. Springer, 2003.
22. [GMW87] O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In Proc. of 19th STOC, pages 218-229. ACM Press, 1987.
23. [GMY04] J. Garay, P. MacKenzie, and K. Yang. Efficient and secure multi-party computation with faulty majority and complete fairness. To appear, 2004.
24. [Gro03] J. Groth. A verifiable secret shuffle of homomorphic encryptions. In Proc. of 6th PKC Conference, volume 2567 of LNCS, pages 145-160, 2003.
25. [IG03] I. Ioannidis and A. Grama. An efficient protocol for Yao's millionaires' problem. In Proc. of 36th Hawaii International Conference on System Sciences (HICSS), pages 205-210. IEEE Press, 2003.
26. [IK00] Y. Ishai and E. Kushilevitz. Randomizing polynomials: A new representation with applications to round-efficient secure computation. In Proc. of 41st FOCS Symposium, pages 294-304. IEEE Press, 2000.
27. [JJ00] M. Jakobsson and A. Juels. Mix and match: Secure function evaluation via ciphertexts. In Proc. of 6th Asiacrypt Conference, volume 1976 of LNCS, pages 162-177. Springer, 2000.
28. [Kil88] J. Kilian. Founding cryptography on oblivious transfer. In Proc. of 20th ACM STOC, pages 20-31. ACM Press, 1988.
29. [KO02] K. Kurosawa and W. Ogata. Bit-slice auction circuit. In Proc. of 7th European Symposium on Research in Computer Security (ESORICS), volume 2502 of LNCS, pages 24-38. Springer, 2002.
30. [Lin01] Y. Lindell. Parallel coin-tossing and constant-round secure two-party computation. In Proc. of 21st CRYPTO Conference, volume 2139 of LNCS, pages 171-189. Springer, 2001.
31. [LT05] H.-Y. Lin and W.-G. Tzeng. An efficient solution to the Millionaires' Problem based on homomorphic encryption. In Proc. of 3rd International Conference on Applied Cryptography and Network Security (ACNS), volume 3531 of LNCS, pages 456-466, 2005.
32. [NN01] M. Naor and K. Nissim. Communication preserving protocols for secure function evaluation. In Proc. of 33rd STOC, pages 590-599. ACM Press, 2001.
33. [NPS99] M. Naor, B. Pinkas, and R. Sumner. Privacy preserving auctions and mechanism design. In Proc. of 1st ACM Conference on E-Commerce, pages 129-139. ACM Press, 1999.
34. [Pai99] P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Proc. of 16th Eurocrypt Conference, volume 1592 of LNCS, pages 223-238. Springer, 1999.
35. [PBDL04] K. Peng, C. Boyd, E. Dawson, and B. Lee. An efficient and verifiable solution to the millionaire problem. In Proc. of 7th International Conference on Information Security and Cryptology (ICISC), volume 3506 of LNCS, pages 51-66. Springer, 2004.
36. [Ped91] T. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In J. Feigenbaum, editor, Proc. of 11th CRYPTO Conference, volume 576 of LNCS, pages 129-140. Springer, 1991.
37. [Sch91] C. P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3):161-174, 1991.
38. [Sch96] B. Schneier. Applied Cryptography. John Wiley and Sons, Inc., 2nd edition, 1996.
39. [ST04] B. Schoenmakers and P. Tuyls. Practical two-party computation based on the conditional gate. In Proc. of 10th Asiacrypt Conference, number 3329 in LNCS, pages 119-136. Springer, 2004.
40. [TY98] Y. Tsiounis and M. Yung. On the security of ElGamal-based encryption. In Proc. of 1st International Workshop on Practice and Theory in Public Key Cryptography (PKC), volume 1431 of LNCS, pages 117-134. Springer, 1998.
41. [Yao82] A. C. Yao. Protocols for secure computation. In Proc. of 23th FOCS Symposium, pages 160-164. IEEE Computer Society Press, 1982.
42. [Yao86] A. C. Yao. How to generate and exchange secrets. In Proc. of 27th FOCS Symposium, pages 162-167. IEEE Computer Society Press, 1986.