NDSS 2025 – Iris: Dynamic Privacy Preserving Search In Authenticated Chord Peer-To-Peer Networks
嗯,用户让我帮忙总结一篇文章的内容,控制在100个字以内,而且不需要用“文章内容总结”这样的开头。看起来他需要的是一个简洁明了的摘要。 首先,我需要仔细阅读用户提供的文章内容。这篇文章是关于Iris方案的,用于在Chord这种结构化的P2P网络中实现动态隐私保护搜索。Chord网络的问题在于中间节点会知道数据地址,导致隐私泄露。Iris的目的是在不改变现有协议的情况下提供隐私保护。 接下来,文章提到提出了一个新的隐私概念,叫做alpha, delta-privacy,用来衡量在多次搜索中泄露的信息总量。他们还进行了安全分析和性能测试,结果表明Iris是有效的,并且性能开销可以调节。 所以,总结的时候需要涵盖这些要点:Iris方案、Chord网络中的隐私问题、新的隐私概念、分析结果以及性能优势。 然后,我要确保语言简洁,不超过100个字。可能的结构是先介绍Iris的目的和方法,然后提到新的隐私概念和分析结果。 最后,检查一下是否符合用户的要求:中文、100字以内、直接描述内容。 </think> 该研究提出了一种名为Iris的动态隐私保护搜索方案,在Chord结构化P2P网络中实现查询隐私保护。通过引入新的alpha, delta-privacy隐私概念,方案确保了在多次搜索中泄露信息的总量可控,并支持现有Chord协议的兼容性。实验表明该方案在保持高效性能的同时实现了可调节的隐私保护。 2026-1-28 16:0:0 Author: securityboulevard.com(查看原文) 阅读量:0 收藏

Session 10C: Privacy Preservation

Authors, Creators & Presenters: Angeliki Aktypi (University of Oxford), Kasper Rasmussen (University of Oxford)
PAPER
Iris: Dynamic Privacy Preserving Search in Authenticated Chord Peer-to-Peer Networks
In structured peer-to-peer networks, like Chord, users find data by asking a number of intermediate nodes in the network. Each node provides the identity of the closet known node to the address of the data, until eventually the node responsible for the data is reached. This structure means that the intermediate nodes learn the address of the sought after data. Revealing this information to other nodes makes Chord unsuitable for applications that require query privacy so in this paper we present a scheme Iris to provide query privacy while maintaining compatibility with the existing Chord protocol. This means that anyone using it will be able to execute a privacy preserving query but it does not require other nodes in the network to use it (or even know about it). In order to better capture the privacy achieved by the iterative nature of the search we propose a new privacy notion, inspired by $k$-anonymity. This new notion called alpha, delta-privacy, allows us to formulate privacy guarantees against adversaries that collude and take advantage of the total amount of information leaked in all iterations of the search. We present a security analysis of the proposed algorithm based on the privacy notion we introduce. We also develop a prototype of the algorithm in Matlab and evaluate its performance. Our analysis proves Iris to be alpha, delta-private while introducing a modest performance overhead. Importantly the overhead is tunable and proportional to the required level of privacy, so no privacy means no overhead.
ABOUT NDSS
The Network and Distributed System Security Symposium (NDSS) fosters information exchange among researchers and practitioners of network and distributed system security. The target audience includes those interested in practical aspects of network and distributed system security, with a focus on actual system design and implementation. A major goal is to encourage and enable the Internet community to apply, deploy, and advance the state of available security technologies.

Our thanks to the Network and Distributed System Security (NDSS) Symposium for publishing their Creators, Authors and Presenter’s superb NDSS Symposium 2025 Conference content on the Organizations’ YouTube Channel.

Permalink

*** This is a Security Bloggers Network syndicated blog from Infosecurity.US authored by Marc Handelman. Read the original post at: https://www.youtube-nocookie.com/embed/W6eE7rouoWQ?si=8WNlE371IOtH0_4S


文章来源: https://securityboulevard.com/2026/01/ndss-2025-iris-dynamic-privacy-preserving-search-in-authenticated-chord-peer-to-peer-networks/
如有侵权请联系:admin#unsafe.sh