๐Ÿ“–
Sharing Decryption in the Context of Voting or Lotteries
Pierre-Alain Fouque, Guillaume Poupard, Jacques Stern

Sharing Decryption in the Context of Voting or Lotteries

Science & Mathematics Published 2000 Verification Pending

Overview & Synopsis

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.

Indexed from repository: HAL Open Science (hal.science)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title Sharing Decryption in the Context of Voting or Lotteries
Author / Organization Pierre-Alain Fouque, Guillaume Poupard, Jacques Stern
Subject & Discipline Multidisciplinary Academic Open Research
Categories Science & Mathematics
Publication Year 2000
License / Rights Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website HAL Open Science (hal.science)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-45331
Original Source Link Visit Source Page on hal.science »