Sharing decryption in the context of voting or lotteries

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

Volumn 1962, Issue , 2001, Pages 90-104

  Fouque, Pierre Alain ^a   Poupard, Guillaume ^a   Stern, Jacques ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC VOTING; PUBLIC KEY CRYPTOGRAPHY;

ELECTRONIC VOTING SCHEME; ENCRYPTED DATA; HOMOMORPHIC PROPERTY; PAILLIER CRYPTOSYSTEM; PUBLIC KEY CRYPTOSYSTEMS; RANDOM NUMBERS; SECRET INFORMATION; SECRET KEY;

CHROMIUM COMPOUNDS;

EID: 84944328129     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45472-1_7     Document Type: Conference Paper

References (22)

1. J. Benaloh. Verifiable Secret-Ballot Elections. PhD thesis, Yale University, 1987.
2. J. Camenisch and M. Michels. A Group Signature Scheme with Improved Efficiency. In Asiacrypt’98, LNCS 1514. Springer-Verlag, 1998.
3. D. Chaum and T. P. Pedersen. Wallet Databases with Observers. In Crypto’92, LNCS 740, pages 89-105. Springer-Verlag, 1992.
4. J. Cohen and M. Fisher. A robust and verifiable cryptographically secure election scheme. In Symposium on Foundations of Computer Science. IEEE, 1985.
5. 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.
6. 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.
7. Y. Frankel, P. Gemmel, Ph. MacKenzie, and M. Yung. Optimal-Resilience Proactive Public-Key Cryptosystems. In Proc. 38th FOGS, pages 384-393. IEEE, 1997.
8. 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.
9. R. Gennaro and V. Shoup. Securing Threshold Cryptosystems against Chosen Ciphertext Attack. In Eurocrypt’98, LNCS 1403, pages 1-16. Springer-Verlag, 1998.
10. 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.
11. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System, Sciences, 28, 1984.
12. D. Naccache and J. Stern. A New Public Key Cryptosystem Based on Higher Residues. In Proc. of the 5th CCCS. ACM press, 1998.
13. 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.
14. P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In Eurocrypt’99, LNCS 1592, pages 223-238. Springer-Verlag, 1999.
15. 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.
16. T. Rabin. A Simplified Approach to Threshold and Proactive RSA. In Crypto’98, LNCS 1462, pages 89-104. Springer-Verlag, 1998.
17. 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.
18. A. De Santis, Y. Desmedt, Y. Frankel, 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.
19. C. P. Schnorr. Efficient Identification and Signatures for Smart Cards. In Crypto’89, LNCS 435, pages 235-251. Springer-Verlag, 1990.
20. A. Shamir. How to Share a Secret. Communications of the ACM, 22:612-613, Nov. 1979.
21. V. Shoup. Practical Threshold Signatures. Technical report, IBM, 1999. IBM Research Report RZ 3121.
22. S. Vanstone and R. Zuccherato.: Elliptic Curve Cryptosystem Using Curves of Smooth Order Over the Ring Zn. IEEE Transaction on Information Theory, 43, 1997.