Computational Puzzles as Sybil Defenses

Cambridge, United Kingdom September 06-June 08

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/P2P.2006.10

Sixth IEEE International Conference o ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Nikita Borisov

	ASCII Text	x
	Nikita Borisov, "Computational Puzzles as Sybil Defenses," Peer-to-Peer Computing, IEEE International Conference on, pp. 171-176, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06), 2006.

	BibTex	x
	@article{ 10.1109/P2P.2006.10, author = {Nikita Borisov}, title = {Computational Puzzles as Sybil Defenses}, journal ={Peer-to-Peer Computing, IEEE International Conference on}, volume = {0}, year = {2006}, isbn = {0-7695-2679-9}, pages = {171-176}, doi = {http://doi.ieeecomputersociety.org/10.1109/P2P.2006.10}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Peer-to-Peer Computing, IEEE International Conference on TI - Computational Puzzles as Sybil Defenses SN - 0-7695-2679-9 SP171 EP176 A1 - Nikita Borisov, PY - 2006 KW - null VL - 0 JA - Peer-to-Peer Computing, IEEE International Conference on ER -

Nikita Borisov, University of Illinois at Urbana-Champaign, USA

We consider the problem of defending against Sybil attacks using computational puzzles. A fundamental difficulty in such defenses is enforcing that puzzle solutions not be reused by attackers over time. We propose a fully decentralized scheme to enforce this by continually distributing locally generated challenges that are then incorporated into the puzzle solutions.

Our approach consists of an all-to-all broadcast of challenges, with a combining function to ensure this can be done efficiently. The combining function generates certificates that can be used to prove that each node?s challenge was delivered to and used by each other node, therefore proving the freshness of each puzzle. We show how our distribution and verification mechanisms can be implemented on top of the the Chord [21] overlay.

Citation:

Nikita Borisov, "Computational Puzzles as Sybil Defenses," p2p, pp.171-176, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06), 2006

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.