Non-interactive Zero-Knowledge Arguments for Voting
From MaRDI portal
Publication:3593168
DOI10.1007/11496137_32zbMath1126.68397MaRDI QIDQ3593168
Publication date: 24 September 2007
Published in: Applied Cryptography and Network Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11496137_32
94A60: Cryptography
68P25: Data encryption (aspects in computer science)
94A62: Authentication, digital signatures and secret sharing
Related Items
Verifiable Elections That Scale for Free, Efficient Non-interactive Range Proof, Removing the Strong RSA Assumption from Arguments over the Integers, A verifiable secret shuffle of homomorphic encryptions, Filling the gap between voters and cryptography in e-voting, Timed-release computational secret sharing and threshold encryption, Secure Authenticated Comparisons, A General, Flexible and Efficient Proof of Inclusion and Exclusion, A Secure and Efficient Proof of Integer in an Interval Range, Efficient Protocols for Set Membership and Range Proofs