Conducting secret ballot elections in computer networks: Problems and solutions-Reference-Cited by-同舟云学术

Conducting secret ballot elections in computer networks: Problems and solutions

Published:1994-04 Issue:4 Volume:51 Page:185-194
ISSN:0254-5330
Container-title:Annals of Operations Research
language:en
Short-container-title:Ann Oper Res

Author:

Nurmi Hannu,Salomaa Arto

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Decision Sciences

Link

http://link.springer.com/content/pdf/10.1007/BF02032763.pdf

Reference12 articles.

1. J.D.C. Benaloh, Verifiable secret-ballot elections, Technical Report 561, Computer Science Department, Yale University (1987).

2. D. Chaum, Election with unconditionally-secret ballots and disruption equivalent to breaking RSA, in:Lecture Notes in Computer Science, Vol. 330, ed. C.G. Gunther (Springer, Berlin/Heidelber/New York, 1988) pp. 177–182.

3. W. Diffie and M. Hellman, New directions in cryptography, IEEE Trans. Inf. Theory IT-22(1976)644–654.

4. K.R. Iversen, A cryptographic scheme for computerized general elections (extended abstract),Crypto '91, Session 9: Secure Computation Protocols.

5. H. Nurmi and A. Salomaa, A cryptographic approach to the secret ballot, Behavioral Sci. 36(1991)34–40.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Prospects of Electronic Voting in Russia: Technological and Political Aspects;Humanities and Social Sciences. Bulletin of the Financial University;2021-08-20

2. Development Principles for Electronic Voting System Using Distributed Ledger Technology;2020 IEEE 11th International Conference on Dependable Systems, Services and Technologies (DESSERT);2020-05

3. A secure and practical electronic voting scheme;Computer Communications;1999-02

4. On public-key cryptosystem based on Church-Rosser string-rewriting systems;Lecture Notes in Computer Science;1995