A mix-net from any CCA2 secure cryptosystem
2012 (English)In: Advances in Cryptology – ASIACRYPT 2012: 18th International Conference on the Theory and Application of Cryptology and Information Security, Beijing, China, December 2-6, 2012. Proceedings / [ed] Xiaoyun Wang, Kazue Sako, Springer, 2012, 607-625 p.Conference paper (Refereed)
We construct a provably secure mix-net from any CCA2 secure cryptosystem. The mix-net is secure against active adversaries that statically corrupt less than λ out of k mix-servers, where λ is a threshold parameter, and it is robust provided that at most min(λ - 1, k - λ) mix-servers are corrupted. The main component of our construction is a mix-net that outputs the correct result if all mix-servers behaved honestly, and aborts with probability 1 - O(H-(t-1)) otherwise (without disclosing anything about the inputs), where t is an auxiliary security parameter and H is the number of honest parties. The running time of this protocol for long messages is roughly 3tc, where c is the running time of Chaum's mix-net (1981).
Place, publisher, year, edition, pages
Springer, 2012. 607-625 p.
, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743 ; 7658 LNCS
Active adversary, Mix-net, Provably secure, Running time, Security parameters, Threshold parameters
IdentifiersURN: urn:nbn:se:kth:diva-116795DOI: 10.1007/978-3-642-34961-4_37ScopusID: 2-s2.0-84871540389ISBN: 978-364234960-7OAI: oai:DiVA.org:kth-116795DiVA: diva2:600917
18th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2012, 2 December 2012 through 6 December 2012, Beijing
QC 201301282013-01-282013-01-282013-09-06Bibliographically approved