The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Efficient identification and signatures for smart cards
CRYPTO '89 Proceedings on Advances in cryptology
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Receipt-free secret-ballot elections (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
New blind signatures equivalent to factorization (extended abstract)
Proceedings of the 4th ACM conference on Computer and communications security
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
A user authentication scheme not requiring secrecy in the computer
Communications of the ACM
A high security log-in procedure
Communications of the ACM
Contemporary Cryptology: The Science of Information Integrity
Contemporary Cryptology: The Science of Information Integrity
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Provably Secure Blind Signature Schemes
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
An Efficient Blind Signature Scheme for Information Hiding
International Journal of Electronic Commerce
Cryptanalysis of Lee-Hwang-Yang blind signature scheme
Computer Standards & Interfaces
An efficient multi-receipt mechanism for uncoercible anonymous electronic voting
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
In a runoff election, the second round of voting must be performed to elect an absolute-majority winner when no candidate receives more than 50% of the votes in the first round of voting. Many states, such as France, Portugal, and Russia, have adopted this type of voting systems to elect their Presidents. In this paper, an unlinkably divisible and intention attachable ticket scheme is designed for runoff elections. A ticket in our scheme is composed of a main vote and a spare vote. The main vote containing some voter's intention can be extracted from the ticket for the first round of voting. If the second round of voting is required, the tally center enables the spare votes such that each voter can derive a spare vote from his ticket. A voter can then attach his intention to his spare vote for the second round of voting and, especially, the spare vote cannot be linked to the main vote by the tally center.