Cryptology ePrint Archive: Report 2006/382
Provisioning Protected Resource Sharing in Multi-Hop Wireless Networks
E-yong Kim and Hwangnam Kim and Kunsoo Park
Abstract: We propose a protection framework for resource sharing to promote cooperation among nodes in multi-hop wireless networks.
In the resource sharing protocol, a node claims credits when it relays others' packets.
A node also issues rewards to the node which relays its packets.
Rewards are used to validate the correctness of credits.
In order to protect credits and rewards, we devise a secure registry scheme that supports the timed test of credit validation, and then prove that the scheme is not susceptible to various security attacks.
Without any trusted authority in the operation of the framework, we make cryptographic definitions for the scheme, construct a provably secure registry scheme, and implement the timed test of credit validation with one-way chains.
Finally, simulation results observed in J-Sim simulator corroborate that resource sharing is correctly supported and that credits and rewards are secured from selfish behaviors.
Category / Keywords: cryptographic protocols / resource sharing, multi-hop wireless networks, provably secure registry, one-way chains
Date: received 2 Nov 2006, last revised 2 Nov 2006
Contact author: eykim at theory snu ac kr
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation
Version: 20061103:163704 (All versions of this report)
Short URL: ia.cr/2006/382
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]