Introduction to finite fields and their applications
Introduction to finite fields and their applications
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
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Non-interactive zero-knowledge and its applications
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Receipt-free secret-ballot elections (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
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
Verifiable secret-ballot elections
Verifiable secret-ballot elections
A robust and verifiable cryptographically secure election scheme
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
On monotone formula closure of SZK
SFCS '94 Proceedings of the 35th 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
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient receipt-free voting based on homomorphic encryption
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Threshold Cryptosystems Based on Factoring
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Oblivious Counter and Majority Protocol
ISC '02 Proceedings of the 5th International Conference on Information Security
Self-tallying Elections and Perfect Ballot Secrecy
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Efficient Vote Validity Check in Homomorphic Electronic Voting
Information Security and Cryptology --- ICISC 2008
ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
Correction, Optimisation and Secure and Efficient Application of PBD Shuffling
Information Security and Cryptology
A Design of Secure Preferential E-Voting
VOTE-ID '09 Proceedings of the 2nd International Conference on E-Voting and Identity
Algorithms and theory of computation handbook
Public-key encryption with efficient amortized updates
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Practical universal random sampling
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Efficient multiplicative homomorphic e-voting
ISC'10 Proceedings of the 13th international conference on Information security
An efficient shuffling based eVoting scheme
Journal of Systems and Software
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
A novel method to maintain privacy in mobile agent applications
CANS'05 Proceedings of the 4th international conference on Cryptology and Network Security
Multiplicative homomorphic e-voting
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
We formalize the notion of a cryptographic counter, which allows a group of participants to increment and decrement a cryptographic representation of a (hidden) numerical value privately and robustly. The value of the counter can only be determined by a trusted authority (or group of authorities, which may include participants themselves), and participants cannot determine any information about the increment/decrement operations performed by other parties. Previous efficient implementations of such counters have relied on fully-homomorphic encryption schemes; this is a relatively strong requirement which not all encryption schemes satisfy. We provide an alternate approach, starting with any encryption scheme homomorphic over the additive group Z2 (i.e., 1-bit xor). As our main result, we show a general and efficient reduction from any such encryption scheme to a general cryptographic counter. Our main reduction does not use additional assumptions, is efficient, and gives a novel implementation of a general counter. The result can also be viewed as an efficient construction of a general n-bit cryptographic counter from any 1-bit counter which has the additional property that counters can be added securely. As an example of the applicability of our construction, we present a cryptographic counter based on the quadratic residuosity assumption and use it to construct an efficient voting scheme which satisfies universal verifiability, privacy, and robustness.