Multi-authority secret-ballot elections with linear work

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1070, Issue , 1996, Pages 72-83

  Cramer, Ronald ^a   Franklin, Matthew ^b   Schoenmakers, Berry ^c   Yung, Moti ^d  

^a CWI   (Netherlands)

^b LUCENT TECHNOLOGIES   (United States)

^c DigiCash   (Netherlands)

^d IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POPULATION STATISTICS;

CRYPTOGRAPHIC OPERATIONS; CRYPTOGRAPHIC PROTOCOLS; LINEAR WORKS; MULTI AUTHORITIES; NOVEL TECHNIQUES; POPULATION SIZES; VERIFIABILITY; VERIFIABLE SECRET SHARING SCHEME;

CRYPTOGRAPHY;

EID: 77951106449     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68339-9_7     Document Type: Conference Paper

References (17)

1. [Ben87a] J. Benaloh. Cryptographic capsules: A disjunctive primitive for interactive protocols. InAdvances in Cryptology-CRYPTO'86, volume 263 ofLecture Notes in Computer Science, pages 213-222, Berlin, 1987. Springer-Verlag.
2. [Ben87b] J. Benaloh.Verifiable Secret-Ballot Elections. PhD thesis, Yale University, Department of Computer Science Department, New Haven, CT, September 1987.
3. [BT94] J. Benaloh and D. Tuinstra. Receipt-free secret-ballot elections. InProc. 26th Symposium on Theory of Computing (STOC'94), pages 544-553, New York, 1994. A.C.M.
4. [BY86] J. Benaloh and M. Yung. Distributing the power of a government to enhance the privacy of voters. InProc. 5th ACM Symposium on Principles of Distributed Computing (PODC'86), pages 52-62, New York, 1986. A.C.M.
5. [CDS94] R. Cramer, I. Damgård, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. InAdvances in Cryptology-CRYPTO'9J4, volume 839 ofLecture Notes in Computer Science, pages 174-187, Berlin, 1994. Springer-Verlag.
6. [CF85] J. Cohen and M. Fischer. A robust and verifiable cryptographically secure election scheme. InProc. 26th IEEE Symposium on Foundations of Computer Science (FOCS'85), pages 372-382. IEEE Computer Society, 1985.
7. [Cha81] D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms.Communications of the ACM, 24(2):84-88, 1981.
8. [Che94] L. Chen.Witness Hiding Proofs and Applications. PhD thesis, Aarhus University, Computer Science Department, Aarhus, Denmark, August 1994.
9. [CP95] L. Chen and T. P. Pedersen. New group signature schemes. InAdvances in Cryptology-EUROCRYPT'94, volume 950 ofLecture Notes in Computer Science, pages 171-181, Berlin, 1995. Springer-Verlag.
10. [FS87] A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. InAdvances in Cryptology-CRYPTO'86, volume 263 ofLecture. Notes in Computer Science, pages 186-194, New York, 1987. Springer-Verlag.
11. [Gen95] R. Gennaro. Achieving independence efficiently and securely. InProc. 14th ACM Symposium on Principles of Distributed Computing (PODC'95), New York, 1995. A.C.M.
12. [GQ88] L. C. Guillou and J.-J. Quisquater. A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. InAdvances in Cryptology-EUROCRYPT'88, volume 330 ofLecture Notes in Computer Science, pages 123-128, Berlin, 1988. Springer-Verlag.
13. [Oka93] T. Okamoto. Provably secure and practical identification schemes and corresponding signature schemes. InAdvances in Cryptology-CRYPTO'92, volume 740 of Lecture Notes in Computer Science, pages 31-53, Berlin, 1993. Springer-Verlag.
14. [Ped92] T. P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. InAdvances in Cryptology-CRYPTO'91, volume 576 of Lecture Notes in Computer Science, pages 129-140, Berlin, 1992. SpringerVerlag.
15. [Sch91] C. P. Schnorr. Efficient signature generation by smart cards.Journal of Cryptology, 4(3):161-174, 1991.
16. [SK94] K. Sako and J. Kilian. Secure voting using partially compatible homomor- phisms. InAdvances in Cryptology-CRYPTO'94, volume 839 of Lecture Notes in Computer Science, pages 411-424, Berlin, 1994. Springer-Verlag.
17. [SK95] K. Sako and J. Kilian. Receipt-free mix-type voting scheme-a practical solution to the implementation of a voting booth. InAdvances in Cryptology-EUROCRYPT'95, volume 921 of Lecture Notes in Computer Science, pages 393-403, Berlin, 1995. Springer-Verlag.