Abstract
We propose a public-key cryptosystem which is derived from the Paillier cryptosystem. The scheme inherits the attractive homomorphic properties of Paillier encryption. In addition, we achieve two new properties: First, all users can use the same modulus when generating key pairs, this allows more efficient proofs of relations between different encryptions. Second, we can construct a threshold decryption protocol for our scheme that is length-flexible, i.e., it can handle efficiently messages of arbitrary length, even though the public key and the secret key shares held by decryption servers are of fixed size. We show how to apply this cryptosystem to build a self-tallying election scheme with perfect ballot secrecy, and to build a length-flexible mix-net which is universally verifiable, where the size of keys and ciphertexts do not depend on the number of mix servers, and is robust against a corrupt minority.
Basic Research in Computer Science, Centre of the Danish National Research Foundation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Waksman: A permutation network, Journal of the ACM 15(1), January 1968, pp. 159–163.
R. Cramer, I. Damgård and B. Schoenmakers: Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols, Proceedings of Crypto’ 94, Springer Verlag LNCS 839, pp. 174–187.
M. Abe: Mix-networks on Permutation Networks, Proceedings of AsiaCrypt’ 99, Springer Verlag LNCS 1716, pp. 258–273.
P. Paillier: Public-Key Cryptosystems based on Composite Degree Residue Classes, Proceedings of EuroCrypt’ 99, Springer Verlag LNCS 1592, pp. 223–238.
M. Abe and M. Ohkubo: A Length-Invariant Hybrid Mix, Proceedings of AsiaCrypt 2000, Springer Verlag LNCS 1976, pp. 178–191.
Y. Desmedt and K. Kurosawa: How to break a practical MIX and design a new one, Proceedings of EuroCrypt 2000, Springer Verlag LNCS 1807, pp. 557–572.
V. Shoup: Practical Threshold Signatures, Proceedings of EuroCrypt 2000, Springer Verlag LNCS 1807, pp. 207–220.
M. Abe and F. Hoshino: Remarks on Mix-network Based on Permutation Networks, Proceedings of PKC 2001, Springer Verlag LNCS 1992, pp. 317–324.
I. Damgård and M. Jurik: A Generalisation, a Simplification and some Applications of Paillier’s Probabilistic Public-Key System, Proceedings of PKC 2001, Springer Verlag LNCS 1992, pp. 119–136.
I. Damgård and M. Koprowski: Practical Threshold RSA Signatures Without a Trusted Dealer, Proceedings of EuroCrypt 2001, Springer Verlag LNCS 2045, pp. 152–165.
M. Jakobsson and A. Juels, An optimally robust hybrid mix network, Annual ACM Symposium on Principles of Distributed Computing 2001, pp 284–292.
R. Cramer and V. Shoup: Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption, Proceedings of EuroCrypt 2002, Springer Verlag LNCS 2332, pp. 45–64.
J. Algesheimer, J. Camenisch and V. Shoup: Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products Proceedings of Crypto 2002, Springer Verlag LNCS 2442, pp. 417–432.
A. Kiayias and M. Yung: Self-Tallying Elections and Perfect Ballot Secrecy, Proceedings of Public Key Cryptography 2002, Springer Verlag LNCS 2274, pp. 141–158.
I. Damgård, and M. Jurik: A Length-Flexible Threshold Cryptosystem with Applications, BRICS report series, record 03/16, http://www.brics.dk/RS/03/16/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Damgård, I., Jurik, M. (2003). A Length-Flexible Threshold Cryptosystem with Applications. In: Safavi-Naini, R., Seberry, J. (eds) Information Security and Privacy. ACISP 2003. Lecture Notes in Computer Science, vol 2727. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45067-X_30
Download citation
DOI: https://doi.org/10.1007/3-540-45067-X_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40515-3
Online ISBN: 978-3-540-45067-2
eBook Packages: Springer Book Archive