An adaptively secure mix-net without erasures

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

Volumn 4052 LNCS, Issue , 2006, Pages 276-287

  Wikström, Douglas ^a,c   Groth, Jens ^b,d,e  

^a ETH ZURICH   (Switzerland)

^b Engineering IV   (United States)

^c ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^d Cryptomathic   (Denmark)

^e AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SYSTEMS; ALGORITHMS; CRYPTOGRAPHY; MATHEMATICAL MODELS; SERVERS;

COIN-FLIPPING; FIRST MIX-NET; MIX-SERVERS; RESIDUOSITY ASSUMPTION;

SECURITY OF DATA;

EID: 33746365152     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11787006_24     Document Type: Conference Paper

References (17)

1. M. Abe and H. Imai. Flaws in some robust optimistic mix-nets. In Australasian Conference on Information Security and Privacy - ACISP 2008, volume 2727 of LNCS, pages 39-50. Springer Verlag, 2003.
2. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pages 136-145. IEEE Computer Society Press, 2001. (Full version at Cryptology ePrint Archive, Report 2000/067, http://eprint.iacr.org, October, 2001.).
3. D. Chaum. Untraceable electronic mail, return addresses and digital pseudo-nyms. Communications of the ACM, 24(2):84-88, 1981.
4. I. Darngård and E. Fujisaki. A statistically-hiding integer commitment scheme based on groups with hidden order. In Advances in Cryptology - Asiacrypt 2002, volume 2501 of LNCS, pages 125-142. Springer Verlag, 2002.
5. I. Darngå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 LNCS, pages 119-136. Springer Verlag, 2001.
6. I. Damgård and J. B. Nielsen. Universally composable efficient rnultiparty computation from threshold homornorphic encryption. In Advances in Cryptology -Crypto 2003, volume 2729 of LNCS, pages 247-267. Springer Verlag, 2003.
7. J. Furukawa. Efficient and verifiable shuffling arid shuffle-decryption. IEICE Transactions, 88-A(1):172-188, 2005.
8. J. Furukawa and K. Sako. An efficient scheine for proving a shuffle. In Advances in Cryptology - Crypto 2001, volume 2139 of LNCS, pages 368-387. Springer Verlag, 2001.
9. J. Groth. A verifiable secret shuffle of homomorphic encryptions. In Public Key Cryptography - PKC 2003, volume 2567 of LNCS, pages 145-160. Springer Verlag, 2003. Full version at Cryptology ePrint Archive, Report 2005/246, 2005, http://eprint.iacr.org/.
10. A. Lysyanskaya and C. Peikert. Adaptive security in the threshold setting: From cryptosystems to signature schemes. In Advances in Cryptology - Asiacrypt 2001, volume 2248 of LNCS, pages 331-350. Springer Verlag, 2001.
11. M. Naor and M. Yung. Public-key cryptosystems provably secure against chosen ciphertext attack. In 22th ACM Symposium on the Theory of Computing (STOC), pages 427-437. ACM Press, 1990.
12. 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.
13. P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology - Eurocrypt '99, volume 1592 of LNCS, pages 223-238. Springer Verlag, 1999.
14. T. P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Advances in Cryptology - Crypto' 91, volume 576 of LNCS, pages 129-140. Springer Verlag, 1992.
15. A. Shamir. How to share a secret. Communications of the ACM, 22(11):612-613, 1979.
16. D. Wikström. A universally composable mix-net. In 1st Theory of Cryptography Conference (TCC), volume 2951 of LNCS, pages 315-335. Springer Verlag, 2004.
17. D. Wikström. A sender verifiable mix-net and a new proof of a shuffle. In Advances in Cryptology - Asiacrypt 2005, volume 3788 of LNCS, pages 273-292. Springer Verlag, 2005.