A Toolbox for Verifiable Tally-Hiding E-Voting Systems
Authors:
- 22 September 2022
- book chapter
- Published by Springer Nature
- p. 631-652
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Secure Equality and Greater-Than Tests with Sublinear Online Complexity2013
- Distributed Paillier Cryptosystem without Trusted Dealer2011
- A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election methodSocial Choice and Welfare, 2010
- Efficient Binary Conversion for Paillier Encrypted Values2006
- A Sender Verifiable Mix-Net and a New Proof of a Shuffle2005
- Universally Composable DKG with Linear Number of Exponentiations2005
- Practical Two-Party Computation Based on the Conditional Gate2004
- On Diophantine Complexity and Statistical Zero-Knowledge Arguments2003
- Multiparty Computation from Threshold Homomorphic Encryption2001
- A Theorem on Boolean MatricesJournal of the ACM, 1962