Efficient universally-verifiable electronic voting with everlasting privacy

DOI10.1007/978-3-031-71070-4_15MaRDI QIDQ6660396zbMATH OpenFDO

Authors David Pointcheval

Publication date 10 January 2025

Full work available at URL https://doi.org/10.1007/978-3-031-71070-4_15

zbMATH Keywords

linearly-homomorphic signaturesuniversal verifiability

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
• Practical Everlasting Privacy
• Encryption mechanisms for receipt-free and perfectly private verifiable elections
• On some incompatible properties of voting schemes
• End-to-End Verifiable Quadratic Voting with Everlasting Privacy

Cites work

• A public key cryptosystem and a signature scheme based on discrete logarithms
• Computing on Authenticated Data
• Efficient signatures on randomizable ciphertexts
• Homomorphic signatures for polynomial functions
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 1952905 (Why is no real title available?)
• scientific article; zbMATH DE number 2079932 (Why is no real title available?)
• Improved security for linearly homomorphic signatures: a generic framework
• Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
• Linearly Homomorphic Structure-Preserving Signatures and Their Applications
• Linearly-homomorphic signatures and scalable mix-nets
• On the size of pairing-based non-interactive arguments
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Quadratic span programs and succinct NIZKs without PCPs
• Recursive composition and bootstrapping for SNARKs and proof-carrying data
• Signing a Linear Subspace: Signature Schemes for Network Coding
• Structure-preserving signatures and commitments to group elements
• Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
• The algebraic group model and its applications
• Traceable constant-size multi-authority credentials

Cited in

(1)

• On security proofs of existing equivalence class signature schemes

This page was built for publication: Efficient universally-verifiable electronic voting with everlasting privacy

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