Iris: dynamic privacy preserving search in authenticated chord peer-to-peer networks
<p>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...
| Main Authors: | , |
|---|---|
| Format: | Conference item |
| Language: | English |
| Published: |
2025
|
| _version_ | 1824459123834486784 |
|---|---|
| author | Aktypi, A Rasmussen, K |
| author_facet | Aktypi, A Rasmussen, K |
| author_sort | Aktypi, A |
| collection | OXFORD |
| description | <p>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).</p>
<p>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 (α, δ)-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.</p>
<p>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 (α, δ)-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.</p> |
| first_indexed | 2025-02-19T04:36:47Z |
| format | Conference item |
| id | oxford-uuid:b9b5ef17-e150-43a7-981d-150bd45ea2f0 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2025-02-19T04:36:47Z |
| publishDate | 2025 |
| record_format | dspace |
| spelling | oxford-uuid:b9b5ef17-e150-43a7-981d-150bd45ea2f02025-02-03T11:46:09ZIris: dynamic privacy preserving search in authenticated chord peer-to-peer networksConference itemhttp://purl.org/coar/resource_type/c_5794uuid:b9b5ef17-e150-43a7-981d-150bd45ea2f0EnglishSymplectic Elements2025Aktypi, ARasmussen, K<p>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).</p> <p>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 (α, δ)-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.</p> <p>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 (α, δ)-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.</p> |
| spellingShingle | Aktypi, A Rasmussen, K Iris: dynamic privacy preserving search in authenticated chord peer-to-peer networks |
| title | Iris: dynamic privacy preserving search in authenticated chord peer-to-peer networks |
| title_full | Iris: dynamic privacy preserving search in authenticated chord peer-to-peer networks |
| title_fullStr | Iris: dynamic privacy preserving search in authenticated chord peer-to-peer networks |
| title_full_unstemmed | Iris: dynamic privacy preserving search in authenticated chord peer-to-peer networks |
| title_short | Iris: dynamic privacy preserving search in authenticated chord peer-to-peer networks |
| title_sort | iris dynamic privacy preserving search in authenticated chord peer to peer networks |
| work_keys_str_mv | AT aktypia irisdynamicprivacypreservingsearchinauthenticatedchordpeertopeernetworks AT rasmussenk irisdynamicprivacypreservingsearchinauthenticatedchordpeertopeernetworks |