How to shuffle in public

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

Volumn 4392 LNCS, Issue , 2007, Pages 555-574

  Adida, Ben ^a   Wikström, Douglas ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; PUBLIC KEY CRYPTOGRAPHY;

BONEH-GOH-NISSIM (BGN); OBFUSCATE; VERIFIABLE JOINT DECRYPTION;

TEXT PROCESSING;

EID: 38049032820     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70936-7_30     Document Type: Conference Paper

References (30)

1. M. Abe and H. Imai. Flaws in some robust optimistic mix-nets. In Australasian Conference on Information Security and Privacy - ACISP 2003, volume 2727 of Lecture Notes in Computer Science, pages 39-50. Springer Verlag, 2003.
2. B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. P. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. In Advances in Cryptology - Crypto 2001, volume 2139 of Lecture Notes in Computer Science, pages 1-18. Springer Verlag, 2001.
3. O. Baudron, P.-A. Fouque, D. Pointcheval, J. Stern, and G. Poupard. Practical multi-candidate election system. In 20th ACM Symposium on Principles of Distributed Computing - PODC, pages 274-283. ACM Press, 2001.
4. M. Bellare, J. A. Garay, and T. Rabin. Fast batch verification for modular exponentiation and digital signatures. In Advances in Cryptology - Eurocrypt '98, pages 236-250. Springer Verlag, 1998.
5. J. Benaloh and M. Yung. Distributing the power of a government to enhance the privacy of voters. In 5th ACM Symposium on Principles of Distributed Computing - PODC, pages 52-62. ACM Press, 1986.
6. J. Cohen (Benaloh) and M. Fischer. A robust and verifiable cryptographically secure election scheme. In 28th IEEE Symposium on Foundations of Computer Science (FOCS), pages 372-382. IEEE Computer Society Press, 1985.
7. D. Boneh, E.-J. Goh, and K. Nissim. Evaluating 2-DNF formulas on ciphertexts. In 2nd Theory of Cryptography Conference (TCC), volume 3378 of Lecture Notes in Computer Science, pages 325-342. Springer Verlag, 2005.
8. R. Canetti. Towards realizing random oracles: Hash functions that hide all partial information. In Advances in Cryptology - Crypto 1997, volume 1294 of Lecture Notes in Computer Science, pages 455-469. Springer Verlag, 1997.
9. D. Chaum. Untraceable electronic mail, return addresses and digital pseudo-nyms. Communications of the ACM, 24(2):84-88, 1981.
10. R. Cramer, M. Franklin, L. A.M. Schoenmakers, and M. Yung. Multi-authority secret-ballot elections with linear work. Technical report, CWI (Centre for Mathematics and Computer Science), Amsterdam, The Netherlands, 1995.
11. R. Cramer, R. Gennaro, and B. Schoenmakers. A secure and optimally efficient multi-authority election scheme. In Advances in Cryptology - Eurocrypt '97, volume 1233 of Lecture Notes in Computer Science, pages 103-118. Springer Verlag, 1997.
12. I. Damgård and M. Jurik. A generalisation, a simplification and some applications of paillier's probabilistic public-key system. In Public Key Cryptography - PKC 2001, volume 1992 of Lecture Notes in Computer Science, pages 119-136. Springer Verlag, 2001.
13. P.-A. Fouque, G. Poupard, and J. Stern. Sharing decryption in the context of voting or lotteries. In Financial Cryptography 2000, volume 2339 of Lecture Notes in Computer Science, pages 90-104, London, UK, 2001. Springer-Verlag.
14. J. Furukawa and K. Sako. An efficient scheme for proving a shuffle. In Advances in Cryptology - Crypto 2001, volume 2139 of Lecture Notes in Computer Science, pages 368-387. Springer Verlag, 2001.
15. S. Goldwasser and Y. Tauman Kalai. On the impossibility of obfuscation with auxiliary input. In 46th IEEE Symposium on Foundations of Computer Science (FOCS), pages 553-562. IEEE Computer Society Press, 2005.
16. T. Granlund. Gnu multiple precision arithmetic library (GMP). Software available at http://swox.com/gmp, March 2005.
17. J. Groth. A verifiable secret shuffle of homomorphic encryptions. In Public Key Cryptography - PKC 2003, volume 2567 of Lecture Notes in Computer Science, pages 145-160. Springer Verlag, 2003.
18. Helger Lipmaa. An oblivious transfer protocol with log-squared communication. In Information Security - ISC 2005, volume 3650 of Lecture Notes in Computer Science, pages 314-328. Springer Verlag, 2005.
19. A. Menezes, P. Oorschot, and S. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997.
20. A. Neff. A verifiable secret shuffle and its application to e-voting. In 8th ACM Conference on Computer and Communications Security (CCS), pages 116-125. ACM Press, 2001.
21. R. Ostrovsky and W. E. Skeith III. Private searching on streaming data. Cryptology ePrint Archive, Report 2005/242, 2005. http://eprint.iacr.org/.
22. P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology - Eurocrypt '99, volume 1592 of Lecture Notes in Computer Science, pages 223-238. Springer Verlag, 1999.
23. C. Park, K. Itoh, and K. Kurosawa. Efficient anonymous channel and all/nothing election scheme. In Advances in Cryptology - Eurocrypt '93, volume 765 of Lecture Notes in Computer Science, pages 248-259. Springer Verlag, 1994.
24. K. Sako and J. Kilian. Reciept-free mix-type voting scheme. In Advances in Cryptology - Eurocrypt '95, volume 921 of Lecture Notes in Computer Science, pages 393-403. Springer Verlag, 1995.
25. B. Schoenmakers. A simple publicly verifiable secret sharing scheme and its application to electronic. In Advances in Cryptology - Crypto '99, volume 3027 of Lecture Notes in Computer Science, pages 148-164. Springer Verlag, 1999.
26. H. Wee. On obfuscating point functions. In 37th ACM Symposium on the Theory of Computing (STOC), pages 523-532. ACM Press, 2005.
27. D. Wikström. A universally composable mix-net. In 1st Theory of Cryptography Conference (TCC), volume 2951 of Lecture Notes in Computer Science, pages 315-335. Springer Verlag, 2004.
28. D. Wikström. A sender verifiable mix-net and a new proof of a shuffle. In Advances in Cryptology - Asiacrypt 2005, volume 3788 of Lecture Notes in Computer Science, pages 273-292. Springer Verlag, 2005. (Full version [29]).
29. D. Wikström. A sender verifiable mix-net and a new proof of a shuffle. Cryptology ePrint Archive, Report 2004/137, 2005. http://eprint.iacr. org/.
30. D. Wikström and J. Groth. An adaptively secure mix-net without erasures. In 33rd International Colloquium on Automata, Languages and Programming (ICALP), volume 4052 of Lecture Notes in Computer Science, pages 276-287. Springer Verlag, 2006.