Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Algesheimer J, Camenisch J, Shoup V (2002) Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In: Advances in cryptology—CRYPTO ’02. Lecture notes in computer science, vol 2442. Springer, Berlin, pp 417–432
Benaloh J, Yung M (1986) Distributing the power of a government to enhance the privacy of voters. In: Proceedings of the 5th ACM symposium on principles of distributed computing (PODC ’86), ACM, New York, pp 52–62
Cramer R, Damgård I, Nielsen JB (2000) Multiparty computation from threshold homomorphic encryption. In: Advances in cryptology—EUROCRYPT ’01. Lecture notes in computer science, vol 2045. Springer, Berlin, pp 280–300. Full version eprint.iacr.org/2000/055, 27 October 2000
Cramer R, Gennaro R, Schoenmakers B (1997) A secure and optimally efficient multi-authority election scheme. In: Advances in cryptology—EUROCRYPT ’97. Lecture notes in computer science, vol 1233. Springer, Berlin, pp 103–118
Damgård I, Jurik M (2001) A generalisation, a simplification and some applications of Paillier’s probabilistic public-key system. In: Public key cryptography—PKC ’01. Lecture notes in computer science, vol 1992. Springer, Berlin, pp 119–136
Damgård I, Mikkelsen G (2010) Efficient, robust and constant-round distributed RSA key generation. In: Proceedings of the 7th theory of cryptography conference, TCC 2006. Lecture notes in computer science, vol 5978. Springer, Berlin, pp 183–200
Damgård I, Nielsen JB (2003) Universally composable efficient multiparty computation from threshold homomorphic encryption. In: Advances in cryptology—CRYPTO ’03. Lecture notes in computer science, vol 2729. Springer, Berlin, pp 247–264
Franklin M, Haber S (1996) Joint encryption and message-efficient secure computation. J Cryptol 9(4):217–232
Gennaro R, Jarecki S, Krawczyk H, Rabin T (1999) Secure distributed key generation for discrete-log based cryptosystems. In: Advances in cryptology—EUROCRYPT ’99. Lecture notes in computer science, vol 1592. Springer, Berlin, pp 295–310
Pedersen T (1991) A threshold cryptosystem without a trusted party. In: Advances in cryptology—EUROCRYPT ’91. Lecture notes in computer science, vol 547. Springer, Berlin, pp 522–526
Schoenmakers B, Tuyls P (2004) Practical two-party computation based on the conditional gate. In: Advances in cryptology—ASIACRYPT ’04. Lecture notes in computer science, vol 3329. Springer, Berlin, pp 119–136
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this entry
Cite this entry
Schoenmakers, B. (2011). Threshold Homomorphic Cryptosystems. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_13
Download citation
DOI: https://doi.org/10.1007/978-1-4419-5906-5_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5905-8
Online ISBN: 978-1-4419-5906-5
eBook Packages: Computer ScienceReference Module Computer Science and Engineering