Abstract
Several public key cryptosystems with additional homomorphic properties have been proposed so far. They allow to perform computation with encrypted data without the knowledge of any secret information In many applications, the ability to perform decryption, i.e. the knowledge of the secret key, gives a huge power. A classical way to reduce the trust in such a secret owner, and consequently to increase the security, is to share the secret between many entities in such a way that cooperation between them is necessary to decrypt. In this paper, we propose a distributed version of the Paillier cryptosystem presented at Eurocrypt ’99. This shared scheme can for example be used in an electronic voting scheme or in a lottery where a random number related to the winning ticket has to be jointly chosen by all participants.
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
J. Benaloh. Verifiable Secret-Ballot Elections. PhD thesis, Yale University, 1987.
J. Camenisch and M. Michels. A Group Signature Scheme with Improved Efficiency. In Asiacrypt’ 98, LNCS 1514. Springer-Verlag, 1998.
D. Chaum and T. P. Pedersen. Wallet Databases with Observers. In Crypto’ 92, LNCS 740, pages 89–105. Springer-Verlag, 1992.
J. Cohen and M. Fisher. A robust and verifiable cryptographically secure election scheme. In Symposium on Foundations of Computer Science. IEEE, 1985.
R. Cramer, R. Gennaro, and B. Schoenmakers. A Secure and Optimally Efficient Multi-Authority Election Scheme. In Eurocrypt’ 97, LNCS 1233, pages 113–118. Springer-Verlag, 1997.
Y. Desmedt and Y. Frankel. Parallel reliable threshold multisignature. Technical report, Department of E.E. and C.S. University of Wisconsin-Milwaukee, April 1992. TR-92-04-02.
Y. Frankel, P. Gemmel, Ph. MacKenzie, and M. Yung. Optimal-Resilience Proactive Public-Key Cryptosystems. In Proc. 38th FOCS, pages 384–393. IEEE, 1997.
R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust and efficient sharing of RSA functions. In Crypto’ 96, LNCS 1109, pages 157–172. Springer-Verlag, 1996.
R. Gennaro and V. Shoup. Securing Threshold Cryptosystems against Chosen Ciphertext Attack. In Eurocrypt’ 98, LNCS 1403, pages 1–16. Springer-Verlag, 1998.
D.M. Goldschlag and S.G. Stubblebine. Publicly Verifiable Lotterie: Applications of Delaying Functions. In Financial Crypto’ 98, LNCS 1465, pages 214–226. Springer-Verlag, 1998.
S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28, 1984.
D. Naccache and J. Stern. A New Public Key Cryptosystem Based on Higher Residues. In Proc. of the 5th CCCS. ACM press, 1998.
T. Okamoto and S. Uchiyama. A New Public-Key Cryptosystem as Secure as Factoring. In Eurocrypt’ 98, LNCS 1403, pages 308–318. Springer-Verlag, 1998.
P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In Eurocrypt’ 99, LNCS 1592, pages 223–238. Springer-Verlag, 1999.
G. Poupard and J. Stern. Security Analysis of a Practical “on the fly” Authentication and Signature Generation. In Eurocrypt’ 98, LNCS 1403, pages 422–436. Springer-Verlag, 1998.
T. Rabin. A Simplified Approach to Threshold and Proactive RSA. In Crypto’ 98, LNCS 1462, pages 89–104. Springer-Verlag, 1998.
R.L. Rivest, A. Shamir, and L.M. Adleman. A method for obtaining digital signatures and public-key cryptosystem. Communications of the ACM, 21(2):120–126, 1978.
A. De Santis, Y. Desmedt, Y. Prankel, and M. Yung. How to share a function securely. In Proceedings of the 26th ACM Symposium on the Theory of Computing, pages 522–523. ACM, 1994.
C. P. Schnorr. Efficient Identification and Signatures for Smart Cards. In Crypto’ 89, LNCS 435, pages 235–251. Springer-Verlag, 1990.
A. Shamir. How to Share a Secret. Communications of the ACM, 22:612–613, Nov. 1979.
V. Shoup. Practical Threshold Signatures. Technical report, IBM, 1999. IBM Research Report RZ 3121.
S. Vanstone and R. Zuccherato. Elliptic Curve Cryptosystem Using Curves of Smooth Order Over the Ring Zn. IEEE Transaction on Information Theory, IT-43, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fouque, PA., Poupard, G., Stern, J. (2001). Sharing Decryption in the Context of Voting or Lotteries. In: Frankel, Y. (eds) Financial Cryptography. FC 2000. Lecture Notes in Computer Science, vol 1962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45472-1_7
Download citation
DOI: https://doi.org/10.1007/3-540-45472-1_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42700-1
Online ISBN: 978-3-540-45472-4
eBook Packages: Springer Book Archive