A practical secret voting scheme for large scale elections
The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Untraceable electronic mail, return addresses, and digital pseudonyms
Chaum, D. L. (1981) · Communications of the ACM · doi:10.1145/358549.358563 · Cited by 4,289
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Ben-Or, M., & Wigderson, A. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62213 · Cited by 2,524
Security without identification: transaction systems to make big brother obsolete
Chaum, D. (1985) · Communications of the ACM · doi:10.1145/4372.4373 · Cited by 1,666
Multiparty unconditionally secure protocols
Chaum, D., Crépeau, C., & Damgard, I. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62214 · Cited by 1,544
The dining cryptographers problem: Unconditional sender and recipient untraceability
Chaum, D. (1988) · Journal of Cryptology · doi:10.1007/bf00206326 · Cited by 1,408
Untraceable Electronic Cash: (Extended Abstract)
Chaum, D., Fiat, A., & Naor, M. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34799-2_25 · Cited by 1,120
Bit commitment using pseudorandomness
Naor, M. (1991) · Journal of Cryptology · doi:10.1007/bf00196774 · Cited by 807
Advances in Cryptology — CRYPTO ’91: Proceedings
(1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1 · Cited by 687
Advances in Cryptology — CRYPTO’ 88
(1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2 · Cited by 415
A robust and verifiable cryptographically secure election scheme
Cohen, J. D., & Fischer, M. J. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.2 · Cited by 408
Bit Commitment Using Pseudo-Randomness
Naor, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_13 · Cited by 206
Untraceable Electronic Mail, Return Address and Digital Pseudonyms
Chaum, D. (1981) · Cited by 163
Cited by
A verifiable secret shuffle and its application to e-voting
Neff, C. A. (2001) · Proceedings of the 8th ACM conference on Computer and Communications Security · doi:10.1145/501983.502000 · Cited by 513
Efficient Receipt-Free Voting Based on Homomorphic Encryption
Hirt, M., & Sako, K. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_38 · Cited by 483
Coercion-resistant electronic elections
Juels, A., Catalano, D., & Jakobsson, M. (2005) · Proceedings of the 2005 ACM workshop on Privacy in the electronic society · doi:10.1145/1102199.1102213 · Cited by 414
Linkable Spontaneous Anonymous Group Signature for Ad Hoc Groups
Liu, J. K., Wei, V. K., & Wong, D. S. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-27800-9_28 · Cited by 405
Civitas: Toward a Secure Voting System
Clarkson, M. R., Chong, S., & Myers, A. C. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.32 · Cited by 397
Metadata
- Authors
- Fujioka, A., Okamoto, T., & Ohta, K.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1993
- Pages
- 244-251
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1479744988
- Cited by
- 832
- References
- 14
- FWCI
- 6.12
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.