Efficient universally-verifiable electronic voting with everlasting privacy
From MaRDI portal
Publication:6660396
DOI10.1007/978-3-031-71070-4_15MaRDI QIDQ6660396
Publication date: 10 January 2025
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The algebraic group model and its applications
- Linearly-homomorphic signatures and scalable mix-nets
- Efficient signatures on randomizable ciphertexts
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications
- Computing on Authenticated Data
- Improved Security for Linearly Homomorphic Signatures: A Generic Framework
- Homomorphic Signatures for Polynomial Functions
- Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
- Structure-Preserving Signatures and Commitments to Group Elements
- Signing a Linear Subspace: Signature Schemes for Network Coding
- A public key cryptosystem and a signature scheme based on discrete logarithms
- 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
- On the Size of Pairing-Based Non-interactive Arguments
- Traceable constant-size multi-authority credentials
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)
