On cryptological schemes for r-person secret vote and r-person authentication
BongJu Kim

TL;DR
This paper presents cryptological schemes for secure voting and authentication that ensure voter privacy and anonymity using novel partition number identities.
Contribution
It introduces new cryptographic schemes for secret voting and authentication that conceal voter count and verify membership securely.
Findings
Schemes effectively hide the number of voters.
Ensures secure and anonymous voting.
Provides methods for membership verification.
Abstract
We introduce a scheme for the membership verification, a scheme for a secret ballot, a scheme for the unanimity rule which can hide the number of voter using some partition number identities.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Quantum Computing Algorithms and Architecture · Coding theory and cryptography
