End-to-End Verifiable Quadratic Voting with Everlasting Privacy

DOI10.1007/978-3-030-43725-1_22zbMath1519.91101OpenAlexW3012275400MaRDI QIDQ6166542

Olivier Pereira, Peter B. Rønne

Publication date: 3 August 2023

Published in: Financial Cryptography and Data Security (Search for Journal in Brave)

Full work available at URL: http://orbilu.uni.lu/handle/10993/45353

Mathematics Subject Classification ID

Voting theory (91B12) Cryptography (94A60)

Related Items (1)

Multi-input non-interactive functional encryption: constructions and applications

Cites Work

• Secure distributed key generation for discrete-log based cryptosystems
• Simplified Submission of Inputs to Protocols
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios
• Pairing-Friendly Elliptic Curves of Prime Order
• Theory of Cryptography
• PandA: Pairings and Arithmetic
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: End-to-End Verifiable Quadratic Voting with Everlasting Privacy