Sharing Decryption in the Context of Voting or Lotteries

By Pierre-Alain Fouque, Guillaume Poupard, Jacques Stern. Financial Cryptography, 2000

366 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/738b65b76cd2a0297a6bf233378776788f5239ca

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

In Computer Vision and Pattern Recognition

Citations in the corpus

Privacy-Preserving Set Operations (2005, background): “Note that Paillier’s cryptosystem [23] satisfies each of our requirements: it is additively homomorphic, supports ciphertexts re-randomization and threshold decryption (secure in the malicious case) [10,11], and allows certain efficient zero-knowledge proofs (standard constructions from [5,3], and p”
Distributed Paillier Cryptosystem without Trusted Dealer (2010, methodology): “For the same technical reason, the threshold Paillier cryptosystem [23] also needs an RSA modulus that is a product of two safe primes.”
A Survey of Homomorphic Encryption for Nonspecialists (2007, neutral): “…(see, e.g., [5]), commitment schemes (see, e.g., [3]), anonymity, privacy, electronic voting, electronic auctions, lottery protocols (see, e.g., [6]), protection of mobile agents (see, e.g., [7]), multiparty computation (see, e.g., [3]), mix-nets (see, e.g., [8, 9]), watermarking or…”
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting (2012, methodology): “Prior to this work, solutions for distributed discrete log-based key generation systems [38], and threshold encryption/decryption for RSA [39,62], DSS [37] and Paillier [6,23,34] in the multiparty setting, have been presented.”
DeepChain: Auditable and Privacy-Preserving Deep Learning with Blockchain-Based Incentive (2019, methodology): “hardware like Intel SGX [45]) only takes part in the setup phase in Threshold Paillier algorithm [46], and it does not involve in other process.”
Multiparty Computation from Threshold Homomorphic Encryption (2000, methodology): “While the first example is known (from [9] and independently in [10]), the second is new and may be of independent interest.”
A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System (2001, methodology): “In work independent from, but earlier than ours, Fouque, Poupard and Stern [6] proposed the first threshold version of Paillier’s original scheme.”
Practical multi-candidate election system (2001, background): “Both of these arguments are the ma~n components to design multi-candidate election schemes and finally a threshold version of this crypt@system appeared in [15] and was rediscovered independently but later in [11].”
Secure SVM Training Over Vertically-Partitioned Datasets Using Consortium Blockchain for Vehicular Social Networks (2020, methodology): “We apply the threshold Paillier to avoid introducing a trusted third-party and both encryption and de-cryption operations can be done among those participants [28].”
Privacy-Preserving Set Union (2007, methodology): “We utilize a threshold version of Paillier’s scheme throughout this paper, such as the one presented in [2,4,8].”