Secret sharing homomorphisms: keeping shares of a secret secret
Proceedings on Advances in cryptology---CRYPTO '86
Partitioned encryption and achieving simultaneity by partitioning
Information Processing Letters
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Communications of the ACM
Practical multi-candidate election system
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
A reputation system for peer-to-peer networks
NOSSDAV '03 Proceedings of the 13th international workshop on Network and operating systems support for digital audio and video
Addressing cheating in distributed MMOGs
NetGames '05 Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games
Understanding churn in peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Fireflies: scalable support for intrusion-tolerant network overlays
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Three voting protocols: ThreeBallot, VAV, and twin
EVT'07 Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology
Ostra: leveraging trust to thwart unwanted communication
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
SybilGuard: defending against sybil attacks via social networks
IEEE/ACM Transactions on Networking (TON)
Scalable Multiparty Computation with Nearly Optimal Work and Resilience
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
IEEE Transactions on Parallel and Distributed Systems
A peer auditing scheme for cheat elimination in MMOGs
Proceedings of the 7th ACM SIGCOMM Workshop on Network and System Support for Games
Sybil-resilient online content voting
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Brahms: Byzantine resilient random membership sampling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Understanding online social network usage from a network perspective
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Decentralized Polling with Respectable Participants
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
E-voting without 'cryptography'
FC'02 Proceedings of the 6th international conference on Financial cryptography
Scalable and unconditionally secure multiparty computation
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Secretive birds: privacy in population protocols
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
A survey of DHT security techniques
ACM Computing Surveys (CSUR)
Information and Computation
| Hi-index | 0.00 |
We consider the polling problem in a social network: participants express support for a given option and expect an outcome reflecting the opinion of the majority. Individuals in a social network care about their reputation: they do not want their vote to be disclosed or any potential misbehavior to be publicly exposed. We exploit this social aspect of users to model dishonest behavior, and show that a simple secret sharing scheme, combined with lightweight verification procedures, enables private and accurate polling without requiring any central authority or cryptography. We present DPol, a simple and scalable distributed polling protocol in which misbehaving nodes are exposed with positive probability and in which the probability of honest participants having their privacy violated is traded off against the impact of dishonest participants on the accuracy of the polling result. The trade-off is captured by a generic parameter of the protocol, an integer k called the privacy parameter. In a system of N nodes with B dishonest participants, the probability of disclosing a participant's vote is bounded by (B/N)^k^+^1, whereas the impact on the score of each polling option is at most (3k+2)B, with high probability when dishonest users are a minority (i.e., B