Non-interactive Zero-Knowledge Arguments for Voting

DOI10.1007/11496137_32zbMath1126.68397MaRDI QIDQ3593168

Jens Groth

Publication date: 24 September 2007

Published in: Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11496137_32

Mathematics Subject Classification ID

94A60: Cryptography

68P25: Data encryption (aspects in computer science)

94A62: Authentication, digital signatures and secret sharing

Related Items

Verifiable Elections That Scale for Free, Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model, Efficient Non-interactive Range Proof, Removing the Strong RSA Assumption from Arguments over the Integers, Zero-knowledge arguments for subverted RSA groups, Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup, Inner product functional commitments with constant-size public parameters and openings, An algebraic framework for silent preprocessing with trustless setup and active security, Zero-knowledge range arguments for signed fractional numbers from lattices, Arithmetic sketching, A verifiable secret shuffle of homomorphic encryptions, Filling the gap between voters and cryptography in e-voting, Timed-release computational secret sharing and threshold encryption, Efficient range proofs with transparent setup from bounded integer commitments, Secure Authenticated Comparisons, A General, Flexible and Efficient Proof of Inclusion and Exclusion, A Secure and Efficient Proof of Integer in an Interval Range, Efficient Protocols for Set Membership and Range Proofs