Non-interactive Zero-Knowledge Arguments for Voting

DOI10.1007/11496137_32MaRDI QIDQ3593168zbMATH OpenOpenAlexFDO

Authors 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

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 1406797
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• Efficent receipt-free voting based on homomorphic encryption
• A homomorphic encryption-based secure electronic voting scheme
• Financial Cryptography

Cited in

(25)

• 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
• Making Sigma-protocols non-interactive without random oracles
• 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
• 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
• Non-interactive zero-sharing with applications to private distributed decision making
• A verifiable secret shuffle of homomorphic encryptions
• 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
• Vector commitments with proofs of smallness: short range proofs and more
• Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments
• DewTwo: a transparent PCS with quasi-linear prover, logarithmic verifier and 4.5KB proofs from falsifiable assumptions
• Inner-product commitments over integers with applications to succinct arguments
• Improved constant-sized polynomial commitment schemes without trusted setup

This page was built for publication: Non-interactive Zero-Knowledge Arguments for Voting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593168)