Security without identification: transaction systems to make big brother obsolete
Communications of the ACM
Distributing the power of a government to enhance the privacy of voters
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Elections with unconditionally-secret ballots and disruption equivalent to breaking RSA
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Efficient anonymous channel and all/nothing election scheme
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Secure Voting Using Partially Compatible Homomorphisms
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
A Practical Secret Voting Scheme for Large Scale Elections
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Fault tolerant anonymous channel
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
A robust and verifiable cryptographically secure election scheme
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Multi-authority secret-ballot elections with linear work
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
A secure and optimally efficient multi-authority election scheme
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Receipt-free mix-type voting scheme: a practical solution to the implementation of a voting booth
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
An Efficient and Provably Secure Threshold Blind Signature
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
The Append-Only Web Bulletin Board
Formal Aspects in Security and Trust
Algorithms and theory of computation handbook
New receipt-free voting scheme using double-trapdoor commitment
Information Sciences: an International Journal
Open research questions of privacy-enhanced event scheduling
iNetSec'10 Proceedings of the 2010 IFIP WG 11.4 international conference on Open research problems in network security
Defeating malicious servers in a blind signatures based voting system
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
Fair blind signatures without random oracles
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
An implementation of a mix-net based network voting scheme and its use in a private organization
Towards Trustworthy Elections
On some incompatible properties of voting schemes
Towards Trustworthy Elections
Improving remote voting security with codevoting
Towards Trustworthy Elections
k-times anonymous authentication with a constant proving cost
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Boardroom voting scheme with unconditionally secret ballots based on DC-Net
NSS'12 Proceedings of the 6th international conference on Network and System Security
| Hi-index | 0.00 |
This paper improves voters' convenience in the secret-ballot voting scheme offered by Fujioka, Ohta and Okamoto. In their scheme, all voters have to participate in all stages of the voting scheme; that is, the registering, the voting and the counting stages. In our scheme voters do not need to join to the counting stage; hence the voters can walk away once they cast their ballots. This property, realized by the introduction of distributed talliers, will be beneficial in the practical implementation of a voting scheme where less round complexity is desired.