Cryptographic Voting — A Gentle Introduction
From MaRDI portal
Publication:5253589
DOI10.1007/978-3-319-10082-1_7zbMath1448.94188OpenAlexW1598127773MaRDI QIDQ5253589
Bogdan Warinschi, David Bernhard
Publication date: 27 May 2015
Published in: Foundations of Security Analysis and Design VII (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-10082-1_7
Voting theory (91B12) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient signature generation by smart cards
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- A public key cryptosystem and a signature scheme based on discrete logarithms
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- New directions in cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- Securing threshold cryptosystems against chosen ciphertext attack
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- A practical secret voting scheme for large scale elections
- How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios
- Advances in Cryptology – CRYPTO 2004
This page was built for publication: Cryptographic Voting — A Gentle Introduction
