A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Rumor Riding: An Anonymity Approach for Decentralized Peer to Peer Systems
2014
Wireless personal communications
Preserved Fulltext
The very heavy load path construction carries by RR system using random walk mechanism for free initiate peers. ...
In this paper it has been proposed mutual anonymity Rumor riding (RR) protocol for decentralization environment peer to peer systems (P2P). ...
Our protocol design the main idea is random walk. ...
doi:10.1007/s11277-014-1878-9
fatcat:5qfrdrud3jcsrhujjxgttwpm2m
ShadowWalker
2009
Proceedings of the 16th ACM conference on Computer and communications security - CCS '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
We propose ShadowWalker: a new low-latency P2P anonymous communication system, based on a random walk over a redundant structured topology. ...
We base our design on shadows that redundantly check and certify neighbor information; these certifications enable nodes to perform random walks over the structured topology while avoiding route capture ...
Acknowledgments We are very grateful to Matthew Wright, Nick Mathewson and the anonymous reviewers for their invaluable feedback on the draft manuscript. ...
doi:10.1145/1653662.1653683
dblp:conf/ccs/MittalB09
fatcat:xxysgeg2pnganbism2kpzwkyqu
Rumor Riding: Anonymizing Unstructured Peer-to-Peer Systems
2006
Proceedings of the 2006 IEEE International Conference on Network Protocols
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
RR employs a random walk scheme which frees initiating peers from the heavy load of path construction. ...
Compared with previous RSA-based anonymity approaches, RR also takes advantage of lower cryptographic overhead by mainly utilizing a symmetric cryptographic algorithm to achieve anonymity. ...
ACKNOWLEDGEMENTS The authors would like to thank the shepherd, Bobby Bhattacharjee, for his constructive feedback and valuable input. ...
doi:10.1109/icnp.2006.320195
dblp:conf/icnp/HanL06
fatcat:c4kxechegzem7h6gt3wo5djqrq
Rumor Riding: Anonymizing Unstructured Peer-to-Peer Systems
2011
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
RR employs a random walk scheme which frees initiating peers from the heavy load of path construction. ...
Compared with previous RSA-based anonymity approaches, RR also takes advantage of lower cryptographic overhead by mainly utilizing a symmetric cryptographic algorithm to achieve anonymity. ...
ACKNOWLEDGMENT The authors would like to thank the shepherd, Bobby Bhattacharjee, for his constructive feedback and valuable input. ...
doi:10.1109/tpds.2010.98
fatcat:qphhlgj63zegjjwlxq5criz6ue
Anonymous and censorship resistant content sharing in unstructured overlays
2008
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing - PODC '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
In this work we present Clouds, a novel P2P search infrastructure for providing anonymous and censorship resistant search functionality in such networks. ...
Semantic overlay networks are an instance of unstructured overlays, where peers that are semantically, thematically, or socially close are organized into groups to exploit similarities at query time. ...
This query follows a random walk in the cloud to obscure the message initiator, leaves the cloud from multiple peers to ensure higher resistance to censorship, and is routed towards a region in the network ...
doi:10.1145/1400751.1400822
dblp:conf/podc/BackesHLMTW08
fatcat:g77ocnuurve3dapv3o6wmd2yd4
Split Message-Based Anonymity for JXTA Applications
2012
2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
JXTA is an open peer-to-peer (P2P) protocols specification that, in its about 10 years of history, has slowly evolved to appeal to a broad set of applications. ...
Even though path-based approaches are quite popular, it is considered that, in dynamic groups, using a split message-based one is better. ...
Whenever a peer executing the Anonymity Service receives a rumor, it is able to discern whether a rumor is being backtracked, instead of executing a random walk, in the following manner. ...
doi:10.1109/cisis.2012.14
dblp:conf/cisis/Arnedo-MorenoP12
fatcat:6c3uc4a3zngknakyzviwccbkx4
Agyaat: mutual anonymity over structured P2P networks
2006
Internet Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Purpose -To provide mutual anonymity over traditionally un-anonymous Distributed Hash Tables (DHT) based Peer-to-Peer overlay networks, while maintaining the desired scalability and guaranteed lookup properties ...
Originality/value -Agyaat uses a novel topology architecture and associated protocols that are conducive to providing mutually anonymous services. ...
While most unstructured P2P systems like Gnutella (Gnutella, 2002) , Kazaa (Kazaa, 2002) provide anonymity through the use of a random overlay topology and a flooding based routing protocol, they suffer ...
doi:10.1108/10662240610656519
fatcat:pdkupuurlfg7dhhehhr6mwmhaa
Non Path-based Mutual Anonymity Approach with Secure Cipher Text to Image Encryption Message-Peer-to-Peer Systems
2017
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In Anonymous peer to peer system regularly incurred extra expenses if wants to do perfect transfer. ...
After become image, now applying Random walk mechanism for lower overhead systems, by using the symmetric cryptographic algorithm. ...
Key rumor and image encryption are the two important point of this protocol to achieve mutual anonymity and meet the design objective. ...
doi:10.5120/ijca2017913433
fatcat:mcsgs2k6g5drzovwkxp67gvjia
Anonymous communications for JXTA peer-to-peer services: A multi-protocol approach
2013
IN3 Working Paper Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Whenever a peer executing the Anonymity Service receives a rumor, it is able to discern whether a rumor is being backtracked, instead of executing a random walk, in the following manner. ...
Random Walk Whenever the Anonymity Service is executing in a peer, it is always listening to its input pipe, waiting for inbound rumors of any type: message and key. ...
In this work, we used the proposed protocol adaptation to compare the unimessage (onion routing) and split-message (rumor riding) based approaches on an even field: the JXTA middleware. ...
doi:10.7238/in3wps.v0i0.1650
fatcat:yrl3msip2fe6hn2syoxntumaom
A Survey on Routing in Anonymous Communication Protocols
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
To this end, we provide a taxonomy for clustering all prevalently considered approaches (including Mixnets, DC-nets, onion routing, and DHT-based protocols) with respect to their unique routing characteristics ...
As a result, public interest in systems for anonymous communication has drastically increased. ...
We consider a protocol a random walk protocol if node selection is hop-by-hop routed and a random selection. Random walk protocols are often combined with peer-to-peer network structures. ...
arXiv:1608.05538v1
fatcat:arxwswqhl5e7pfhvngni5k3bby
Pisces: Anonymous Communication Using Social Networks
[article]
2012
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A fundamental challenge in this setting is the design of a secure process to discover peers for use in a user's circuit. ...
In Pisces, we discover peers by using random walks in the social network graph with a bias away from highly connected nodes to prevent a few nodes from dominating the circuit creation process. ...
ACKNOWLEDGMENT We would like to thank the attendees of HotPETs 2010 and USENIX HotSec 2010 for helpful comments. ...
arXiv:1208.6326v1
fatcat:p3vugpynjbc5resjeixc6vhpbe
Friends Troubleshooting Network: Towards Privacy-Preserving, Automatic Troubleshooting
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To preserve privacy, we use historyless and futureless random-walk in the FTN, during which search along with parameter aggregation are carried out for the purpose of troubleshooting. ...
In this paper, we leverage this nature of peer-to-peer systems to tackle a new problem: automatic misconfiguration troubleshooting. ...
There are two essential goals in designing a PeerPressure-based peer-to-peer troubleshooting system: • Integrity: We should preserve the integrity of the troubleshooting results. • Privacy: We should protect ...
doi:10.1007/978-3-540-30183-7_18
fatcat:cdii7r67i5f6llqqqxqsmsqmue
Client-side web mining for community formation in peer-to-peer environments
2006
SIGKDD Explorations
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we present a framework for forming interestsbased Peer-to-Peer communities using client-side web browsing history. ...
We have also carefully considered privacy concerns of the peers and adopted cryptographic protocols to measure similarity between them without disclosing their personal profiles. ...
To implement a random walk, the initiator sends out a message contains a time-to-live (TTL) parameter that indicates the length of the walk. ...
doi:10.1145/1233321.1233323
fatcat:lv4bpm4qzzftrkqpenogzrzgou
Anonymity and Censorship Resistance in Unstructured Overlay Networks
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
This paper presents Clouds, a peer-to-peer protocol that guarantees both anonymity and censorship resistance in semantic overlay networks. ...
The design of such a protocol needs to meet a number of challenging goals: enabling the exchange of encrypted messages without assuming previously shared secrets, avoiding centralised infrastructures, ...
To avoid correlation of roles in the protocol with specific actions, which would compromise anonymity, the protocol is designed so that the observable behaviour is the same for all peers, regardless of ...
doi:10.1007/978-3-642-05148-7_12
fatcat:yxjtsc7qjfdh5kkk3rcqoamgqu
Preserving Context Privacy in Distributed Hash Table Wireless Sensor Networks
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
For this reason, peer-to-peer primitives such as Distributed Hash Table ( DHT), which can greatly enhance the scalability and resilience of a network, are increasingly being introduced in the design of ...
In this paper, we propose a protocol achieving a modified version of onion routing over wireless sensor networks based on the DHT paradigm. ...
Random walks for the transmission of the information, in particular, have been adopted in a number of designs. ...
doi:10.1007/978-3-319-29814-6_37
fatcat:o66wfpdfknbyrafakfjvcvbtvy
« Previous
Showing results 1 — 15 out of 11,231 results