Non-interactive Zero-Knowledge Arguments for Voting

By Jens Groth. 2005

174 citations recorded by the source corpus.

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

Bulletproofs: Short Proofs for Confidential Transactions and More (2018, background): “Groth [56] notes that the argument can be optimized by considering 4y ` 1, since integers of this form only require three squares.”
ZKPDL: A Language-Based System for Efficient Zero-Knowledge Proofs and Electronic Cash (2010, background): “Among the applications of zero-knowledge proofs are electronic voting [50, 57, 39, 52], anonymous authentication [22, 37, 63], anonymous electronic ticketing for public transportation [51], veriﬁable outsourced computation [10, 44], and essentially any system in which hon-esty needs to be enforced…”
A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols (2010, background): “Examples include voting schemes [3,4], biometric authentication [5,6], group signatures [7], interactive verifiable computation [8], e-cash [9,10] and secure multiparty computation [11].”
Efficient Protocols for Set Membership and Range Proofs (2008, methodology): “When using commitment schemes relying on RSA-like assumptions, there are solutions to this problem which require only a constant number of RSA-group elements to be exchanged between the prover and verifier [5, 16, 15].”
A Protocol for Privately Reporting Ad Impressions at Scale (2016, methodology): “Systems in the latter category, e.g. [42, 24], use cryptographic voting protocols: each ad is viewed as a candidate in an election and tabulated ballots reveal the total number of impressions each ad received — without revealing what each individual ballot “voted” for.”
Privacy-preserving smart metering (2011, methodology): “We employ the non-interactive zero-knowledge proof by Groth [21], based on expressing integers as the sum of 3 squares, to prove that an integer m ≥ 0.”