Blockchain Peer Voting via Vote Sharding and Homomorphic Encryption
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing blockchain voting systems face challenges in ensuring fair and secure peer voting without a trusted authority, as they risk revealing votes during tallying, allowing vote manipulation, and lack mechanisms for detecting dishonest votes.
Innovation Solution
The method involves dividing each vote into multiple partial votes, randomly distributing them among peer nodes for anonymous counting, using homomorphic encryption for privacy protection and digital signatures for authenticity, and implementing detectability and punishment mechanisms to prevent cheating.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If votes are tallied centrally, then counting is simple, but vote privacy is compromised and trust is required
Solution Approach 1:
The patent divides each vote into multiple partial votes (shards) that are distributed across different peer nodes. Each peer only sees and counts a portion of the total votes, making it impossible for any single peer to reconstruct individual votes or the complete tally without colluding with others. This segmentation resolves the contradiction by enabling distributed counting that preserves vote privacy while maintaining operational simplicity through automated cryptographic protocols.
Solution Approach 2:
The patent introduces cryptographic intermediaries including homomorphic encryption schemes and verifiable secret sharing protocols that enable vote aggregation without revealing individual votes. These cryptographic mechanisms act as intermediaries between voters and the counting process, allowing peers to verify the correctness of tallies without compromising vote privacy, thus resolving the trust-privacy tradeoff.
2Reliability
If voting is decentralized across peer nodes, then trust authority is reduced, but vote manipulation and dishonest voting become harder to detect
Solution Approach 1:
The patent implements feedback mechanisms where peer nodes broadcast their vote counts and cryptographic proofs to the network. Other peers can verify these broadcasts against the distributed partial votes, creating a feedback loop that detects dishonest behavior. If a peer submits an incorrect tally, the network can identify and exclude that peer's votes, providing detectability and punishment for dishonest voting while maintaining decentralized trust.
Solution Approach 2:
The patent employs preliminary cryptographic commitments and verifiable secret sharing that prevent dishonest voting before it occurs. Voters commit to their votes cryptographically before the tallying process, and the verifiable secret sharing scheme ensures that partial votes cannot be altered without detection. This preliminary anti-action makes vote manipulation extremely difficult while enabling decentralized verification.
3Productivity
If all votes are counted by a single entity, then tallying is efficient, but the system becomes a single point of failure and trust risk
Solution Approach 1:
The patent segments the tallying function across multiple peer nodes, with each peer responsible for counting and verifying a subset of partial votes. This distributed approach eliminates single points of failure while maintaining efficiency through parallel processing. The cryptographic protocols enable peers to independently verify each other's work, ensuring reliability without sacrificing productivity.
4Loss of information
If votes are distributed anonymously, then voter privacy is protected, but verification of vote inclusion becomes difficult
Solution Approach 1:
The patent uses cryptographic intermediaries including homomorphic encryption and verifiable secret sharing that enable voters to verify their votes are included in the tally without revealing their identity. The cryptographic proofs allow verification of vote inclusion while maintaining anonymity, as the verification process operates on encrypted representations of votes rather than identifiable voter data.
Data Source
AI summary
An example method of operation may include one or more of identifying one or more votes in a distributed voting configuration, dividing each of the one or more votes into a plurality of partial votes, such that each of the one or more votes comprises two or more partial votes, randomly distributing the plurality of partial votes to a plurality of peer nodes associated with a blockchain, and receiving a broadcast from each of the peer nodes based on a distributed tally of the plurality of partial votes.