Adding Query Privacy to Robust DHTs

Details Adding Query Privacy to Robust DHTs Adding Query Privacy to Robust DHTs

2011-07-06

arxiv.org/abs/1107.1072v2

Computer Science

Cryptography and Security

To appear at ACM ASIACCS 2012

Scientific paper

Interest in anonymous communication over distributed hash tables (DHTs) has increased in recent years. However, almost all known solutions solely aim at achieving sender or requestor anonymity in DHT queries. In many application scenarios, it is crucial that the queried key remains secret from intermediate peers that (help to) route the queries towards their destinations. In this paper, we satisfy this requirement by presenting an approach for providing privacy for the keys in DHT queries. We use the concept of oblivious transfer (OT) in communication over DHTs to preserve query privacy without compromising spam resistance. Although our OT-based approach can work over any DHT, we concentrate on communication over robust DHTs that can tolerate Byzantine faults and resist spam. We choose the best-known robust DHT construction, and employ an efficient OT protocol well-suited for achieving our goal of obtaining query privacy over robust DHTs. Finally, we compare the performance of our privacy-preserving protocols with their more privacy-invasive counterparts. We observe that there is no increase in the message complexity and only a small overhead in the computational complexity.

Affiliated with

Also associated with

No associations

Rating

Adding Query Privacy to Robust DHTs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Adding Query Privacy to Robust DHTs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adding Query Privacy to Robust DHTs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-677870