Privacy-Preserving Spam-Protected Gossip-Based Routing

WAKU-RLN-RELAY is an anonymous peer-to-peer gossip-based routing protocol that features a privacy-preserving spam-protection with cryptographically guaranteed economic incentives. While being an anonymous routing protocol where routed messages are not attributable to their origin, it allows global i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Taheri-Boshrooyeh, Sanaz, Thorén, Oskar, Whitehat, Barry, Koh, Wei Jie, Kilic, Onur, Gurkan, Kobi
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Taheri-Boshrooyeh, Sanaz
Thorén, Oskar
Whitehat, Barry
Koh, Wei Jie
Kilic, Onur
Gurkan, Kobi
description WAKU-RLN-RELAY is an anonymous peer-to-peer gossip-based routing protocol that features a privacy-preserving spam-protection with cryptographically guaranteed economic incentives. While being an anonymous routing protocol where routed messages are not attributable to their origin, it allows global identification and removal of spammers. It addresses the performance and privacy issues of its counterparts including proof-of-work and reputation-based schemes. Its light computational overhead makes it suitable for resource-limited environments. The spam protection works by limiting the messaging rate of each network participant where rate violation results in financial punishment. We deploy the novel construct of rate-limiting nullifier to enforce the message rate limit. We provide a proof-of-concept implementation of WAKU-RLN-RELAY to prove the efficiency and feasibility of our solution.
doi_str_mv 10.48550/arxiv.2207.00116
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2207_00116</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2207_00116</sourcerecordid><originalsourceid>FETCH-LOGICAL-a676-86ad5c702153f18f675722bc8291913d4eb3101e19eddc23f632ce955e7eb8c3</originalsourceid><addsrcrecordid>eNotjstqwzAUBbXpIqT9gKyaH5CjK0UPL1OTuoVAQpO9kaXrIEhqI7mm_vu6bleHgcMwhKyAZVsjJdvY-B2GjHOmM8YA1IKoUwyDdSM9RUwYh_B5XZ87e5-47dH16Ndlm1Lo6ItNE3y0X_30eSQPjb0lfPrfJTm_7i_FGz0cy_did6BWaUWNsl46zThI0YBplJaa89oZnkMOwm-xFsAAIUfvHReNEtxhLiVqrI0TS_L8Z527qy6Gu41j9dtfzf3iB5vzP3o</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Privacy-Preserving Spam-Protected Gossip-Based Routing</title><source>arXiv.org</source><creator>Taheri-Boshrooyeh, Sanaz ; Thorén, Oskar ; Whitehat, Barry ; Koh, Wei Jie ; Kilic, Onur ; Gurkan, Kobi</creator><creatorcontrib>Taheri-Boshrooyeh, Sanaz ; Thorén, Oskar ; Whitehat, Barry ; Koh, Wei Jie ; Kilic, Onur ; Gurkan, Kobi</creatorcontrib><description>WAKU-RLN-RELAY is an anonymous peer-to-peer gossip-based routing protocol that features a privacy-preserving spam-protection with cryptographically guaranteed economic incentives. While being an anonymous routing protocol where routed messages are not attributable to their origin, it allows global identification and removal of spammers. It addresses the performance and privacy issues of its counterparts including proof-of-work and reputation-based schemes. Its light computational overhead makes it suitable for resource-limited environments. The spam protection works by limiting the messaging rate of each network participant where rate violation results in financial punishment. We deploy the novel construct of rate-limiting nullifier to enforce the message rate limit. We provide a proof-of-concept implementation of WAKU-RLN-RELAY to prove the efficiency and feasibility of our solution.</description><identifier>DOI: 10.48550/arxiv.2207.00116</identifier><language>eng</language><subject>Computer Science - Cryptography and Security</subject><creationdate>2022-06</creationdate><rights>http://creativecommons.org/licenses/by-nc-sa/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2207.00116$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2207.00116$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Taheri-Boshrooyeh, Sanaz</creatorcontrib><creatorcontrib>Thorén, Oskar</creatorcontrib><creatorcontrib>Whitehat, Barry</creatorcontrib><creatorcontrib>Koh, Wei Jie</creatorcontrib><creatorcontrib>Kilic, Onur</creatorcontrib><creatorcontrib>Gurkan, Kobi</creatorcontrib><title>Privacy-Preserving Spam-Protected Gossip-Based Routing</title><description>WAKU-RLN-RELAY is an anonymous peer-to-peer gossip-based routing protocol that features a privacy-preserving spam-protection with cryptographically guaranteed economic incentives. While being an anonymous routing protocol where routed messages are not attributable to their origin, it allows global identification and removal of spammers. It addresses the performance and privacy issues of its counterparts including proof-of-work and reputation-based schemes. Its light computational overhead makes it suitable for resource-limited environments. The spam protection works by limiting the messaging rate of each network participant where rate violation results in financial punishment. We deploy the novel construct of rate-limiting nullifier to enforce the message rate limit. We provide a proof-of-concept implementation of WAKU-RLN-RELAY to prove the efficiency and feasibility of our solution.</description><subject>Computer Science - Cryptography and Security</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotjstqwzAUBbXpIqT9gKyaH5CjK0UPL1OTuoVAQpO9kaXrIEhqI7mm_vu6bleHgcMwhKyAZVsjJdvY-B2GjHOmM8YA1IKoUwyDdSM9RUwYh_B5XZ87e5-47dH16Ndlm1Lo6ItNE3y0X_30eSQPjb0lfPrfJTm_7i_FGz0cy_did6BWaUWNsl46zThI0YBplJaa89oZnkMOwm-xFsAAIUfvHReNEtxhLiVqrI0TS_L8Z527qy6Gu41j9dtfzf3iB5vzP3o</recordid><startdate>20220630</startdate><enddate>20220630</enddate><creator>Taheri-Boshrooyeh, Sanaz</creator><creator>Thorén, Oskar</creator><creator>Whitehat, Barry</creator><creator>Koh, Wei Jie</creator><creator>Kilic, Onur</creator><creator>Gurkan, Kobi</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20220630</creationdate><title>Privacy-Preserving Spam-Protected Gossip-Based Routing</title><author>Taheri-Boshrooyeh, Sanaz ; Thorén, Oskar ; Whitehat, Barry ; Koh, Wei Jie ; Kilic, Onur ; Gurkan, Kobi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a676-86ad5c702153f18f675722bc8291913d4eb3101e19eddc23f632ce955e7eb8c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Cryptography and Security</topic><toplevel>online_resources</toplevel><creatorcontrib>Taheri-Boshrooyeh, Sanaz</creatorcontrib><creatorcontrib>Thorén, Oskar</creatorcontrib><creatorcontrib>Whitehat, Barry</creatorcontrib><creatorcontrib>Koh, Wei Jie</creatorcontrib><creatorcontrib>Kilic, Onur</creatorcontrib><creatorcontrib>Gurkan, Kobi</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Taheri-Boshrooyeh, Sanaz</au><au>Thorén, Oskar</au><au>Whitehat, Barry</au><au>Koh, Wei Jie</au><au>Kilic, Onur</au><au>Gurkan, Kobi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Privacy-Preserving Spam-Protected Gossip-Based Routing</atitle><date>2022-06-30</date><risdate>2022</risdate><abstract>WAKU-RLN-RELAY is an anonymous peer-to-peer gossip-based routing protocol that features a privacy-preserving spam-protection with cryptographically guaranteed economic incentives. While being an anonymous routing protocol where routed messages are not attributable to their origin, it allows global identification and removal of spammers. It addresses the performance and privacy issues of its counterparts including proof-of-work and reputation-based schemes. Its light computational overhead makes it suitable for resource-limited environments. The spam protection works by limiting the messaging rate of each network participant where rate violation results in financial punishment. We deploy the novel construct of rate-limiting nullifier to enforce the message rate limit. We provide a proof-of-concept implementation of WAKU-RLN-RELAY to prove the efficiency and feasibility of our solution.</abstract><doi>10.48550/arxiv.2207.00116</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2207.00116
ispartof
issn
language eng
recordid cdi_arxiv_primary_2207_00116
source arXiv.org
subjects Computer Science - Cryptography and Security
title Privacy-Preserving Spam-Protected Gossip-Based Routing
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T07%3A03%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Privacy-Preserving%20Spam-Protected%20Gossip-Based%20Routing&rft.au=Taheri-Boshrooyeh,%20Sanaz&rft.date=2022-06-30&rft_id=info:doi/10.48550/arxiv.2207.00116&rft_dat=%3Carxiv_GOX%3E2207_00116%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true