Practical multi-candidate election system

By Olivier Baudron, Pierre-Alain Fouque, David Pointcheval, Jacques Stern, Guillaume Poupard. ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2001

340 citations recorded by the source corpus.

Subfields: Artificial Intelligence

View Paper: https://www.semanticscholar.org/paper/bde5ab491153781bb27ac0d0175d3cffc150111a

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

Citations in the corpus

Towards Statistical Queries over Distributed Private User Data (2012, methodology): “To overcome this problem, we used non-interactive zero-knowledge proofs (ZKP) [8] based on the Fiat-Shamir heuristic [23] to ensure that all encrypted answer values are either 1 or 0.”
Coercion-resistant electronic elections (2005, methodology): “The Sako and Kilian scheme served as a conceptual basis for the later work of Hirt and Sako [25], followed by the more efficient approach of [3]; these two are the most efficient (and correct) receiptfree voting schemes to date.”
Provisions: Privacy-preserving Proofs of Solvency for Bitcoin Exchanges (2015, background): “If A and L are instead not a valid pair, or if L r ID s ‰ (cid:96) , then Pr r out U “ R EJECT s ě 1 ´ ν p k q .”
Threshold Ring Signatures and Applications to Ad-hoc Groups (2002, background): “Typical examples are electronic voting [4,14], digital lotteries [17,21], or e-cash applications [6,10].”
Civitas: Toward a Secure Voting System (2008, methodology): “Cryptographic voting schemes can be divided into three categories, based on the technique used to anonymize votes: homomorphic encryption [6, 20, 37, 65], blind signatures [31,58,59], and mix networks [4,11,52,66].”
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.”
Distributed Paillier Cryptosystem without Trusted Dealer (2010, background): “Many multiparty computation (MPC) protocols using threshold homomorphic cryptosystems are Paillier-based [32] construnctions (e.g., [13, 3 ,28,36,26]).”