English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Distributed Hash Table (DHT) lookup is a core technique in structuredpeer-to-peer (P2P) networks. Its decentralized nature introduces security andprivacy vulnerabilities for applications built on top of them; we thus set outto design a lookup mechanism achieving both security and anonymity, heretoforean open problem. We present Octopus, a novel DHT lookup which provides strongguarantees for both security and anonymity. Octopus uses attackeridentification mechanisms to discover and remove malicious nodes, severelylimiting an adversary's ability to carry out active attacks, and splits lookupqueries over separate anonymous paths and introduces dummy queries to achievehigh levels of anonymity. We analyze the security of Octopus by developing anevent-based simulator to show that the attacker discovery mechanisms canrapidly identify malicious nodes with low error rate. We calculate theanonymity of Octopus using probabilistic modeling and show that Octopus canachieve near-optimal anonymity. We evaluate Octopus's efficiency on Planetlabwith 207 nodes and show that Octopus has reasonable lookup latency andmanageable communication overhead.

Octopus: A Secure and Anonymous DHT Lookup