Relevant bibliographies by topics / Peer-to-Peer Network Security

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Peer-to-Peer Network Security'

Author: Grafiati
Published: 3 June 2025
Last updated: 13 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Peer-to-Peer Network Security.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Peer-to-Peer Network Security"

1

Mahmoud, Mostafa. "Bitcoin's Blockchain Peer-to-Peer Network Security Attacks and Countermeasures." Indian Journal of Science and Technology 13, no. 7 (2020): 767–86. https://doi.org/10.17485/ijst/2020/v13i07/149691.

Full text
Abstract:
Abstract <strong>Objectives:</strong>&nbsp;The main objective of this work is familiarizing users and researchers about Bitcoin&rsquo;s blockchain peer-to-peer network system and investigating security attacks that threat this critical financial digital cash network. <strong>Method:</strong>&nbsp;A comprehensive research analysis was conducted to identify Bitcoin&rsquo;s blockchain peer-to-peer network security attacks and possible countermeasures to protect the Bitcoin network against such attacks. This bibliographical survey covers the related research works from the launch of blockchain in 2008 until the end of 2019. <strong>Results:</strong>&nbsp;This study investigates eleven attacks that threaten Bitcoin&rsquo;s blockchain peer-to-peer network systems and presents the possible countermeasures to defend these attacks. <strong>Conclusion:</strong>&nbsp;The conclusion obtained is encouraging the researchers to explore this hot research area. Besides, the study provides perspectives for future research directions in this domain. <strong>Keywords:</strong> Bitcoin, Blockchain, Cryptocurrency, Security, Attacks, Countermeasures.
APA, Harvard, Vancouver, ISO, and other styles
2

Feng, Liping, Hongbin Wang, Qi Han, Qingshan Zhao, and Lipeng Song. "Modeling Peer-to-Peer Botnet on Scale-Free Network." Abstract and Applied Analysis 2014 (2014): 1–8. http://dx.doi.org/10.1155/2014/212478.

Full text
Abstract:
Peer-to-peer (P2P) botnets have emerged as one of the serious threats to Internet security. To prevent effectively P2P botnet, in this paper, a mathematical model which combines the scale-free trait of Internet with the formation of P2P botnet is presented. Explicit mathematical analysis demonstrates that the model has a globally stable endemic equilibrium when infection rate is greater than a critical value. Meanwhile, we find that, in scale-free network, the critical value is very little. Hence, it is unrealistic to completely dispel the P2P botnet. Numerical simulations show that one can take effective countermeasures to reduce the scale of P2P botnet or delay its outbreak. Our findings can provide meaningful instruction to network security management.
APA, Harvard, Vancouver, ISO, and other styles
3

Mostafa, Mahmoud. "Bitcoin’s Blockchain Peer-to-Peer Network Security Attacks and Countermeasures." Indian Journal of Science and Technology 13, no. 07 (2020): 767–86. http://dx.doi.org/10.17485/ijst/2020/v13i07/149691.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wararkar, Pravin, Naman Kapil, Vyom Rehani, Yash Mehra, and Yashi Bhatnagar. "Resolving Problems Based on Peer to Peer Network Security Issue's." Procedia Computer Science 78 (2016): 652–59. http://dx.doi.org/10.1016/j.procs.2016.02.113.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ke, Chih Kun, and Zheng Hua Lin. "Secure Data Synchronization over a Mobile Peer-to-Peer Network." Applied Mechanics and Materials 764-765 (May 2015): 950–54. http://dx.doi.org/10.4028/www.scientific.net/amm.764-765.950.

Full text
Abstract:
In previous work, we have proposed a service mechanism which automatically syncs the file resources among discrete mobile devices. The mechanism includes four modules. The role-based access control module (RBAC) defined an organization policy which constructs some rules for file resources accessing. The user identification module dispatches a user some specific role (s) with relevant permission (s) and constraint (s) to access organization file resources. The en-capsulation/de-capsulation module enforces the JXTA protocol to sync the file resource synchronization over a mobile peer-to-peer network. The knowledge base module stores various organization file resources in the proposed service mechanism. However, the service mechanism faces an important challenge about data security. How to securely sync organization file resources among discrete mobile devices is worth exploring. In this study, we enforces some cryptographic techniques, including advanced encryption standard (AES), Triple data encryption standards (Triple-DES), and data encryption standards (DES), to examine secure synchronization of organization file resources among discrete mobile devices. The experiment results show the proposed mechanism is secure to automatically sync file resources among discrete mobile devices. The contribution of this work is to solve data security issue in syncing organization file resources among discrete mobile devices. We also strengthen an organization mobility to acquire the file resources by a mobile device in anywhere.
APA, Harvard, Vancouver, ISO, and other styles
6

S, Archana, Princy Mary, Sangami S, and Mahalakshmi V. "Peer-to-Peer Network Node Distribution Analysis Using Block chain." International Research Journal of Computer Science 11, no. 04 (2024): 309–13. http://dx.doi.org/10.26562/irjcs.2024.v1104.29.

Full text
Abstract:
This project uses block chain technology to propose a decentralized access control method for anonymous authentication and secure cloud data storage. The suggested plan improves privacy by guaranteeing that users can authenticate themselves to the cloud without disclosing who they are. Block chain integration improves system security by removing single points of failure and enabling robust, decentralized access management. The plan handles user revocation, enables fine-grained access control, and successfully thwarts replay assaults. Users have similar communication, processing, and storage overheads to centralized methods when creating, editing, and reading material that is stored on the cloud. Our method is decentralized, which sets it apart from conventional models and makes it a useful and effective way to store data securely on the cloud for applications that need a high degree of trust.
APA, Harvard, Vancouver, ISO, and other styles
7

Osman, Dr Yassir S. K., Dr Rajalingam A., and Dr Jayakumar M.S. "A Novel Application Service Security Using Peer-to-Peer Trust Slicing Trust Model." International Innovative Research Journal of Engineering and Technology 8, no. 3 (2023): 25–32. http://dx.doi.org/10.32595/iirjet.org/v8i3.2023.171.

Full text
Abstract:
Network applications provide services for different user categories in a distributed and shared scenario. The challenge in providing services is security due to the presence of common communication and sharing networks. In such cases, the presence of adversaries is tedious to be identified. In this article, the Slicing-dependent Secure Distribution (SSD) of services is introduced. This method is designed to combat man-in-the-middle adversaries that are present in commonly shared networks. The service network is partitioned into slices for identifying the distribution patterns and security measures. The trust and its allied communication between the consecutive slices are verified in a peer-to-peer (P2P) manner. The performance is verified under the purely naïve and purely collective scenario and against attack.
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Gengxian, Chundong Wang, and Huaibin Wang. "Unreachable Peers Communication Scheme in Decentralized Networks Based on Peer-to-Peer Overlay Approaches." Future Internet 14, no. 10 (2022): 290. http://dx.doi.org/10.3390/fi14100290.

Full text
Abstract:
Decentralized networks bring us many benefits, but as networks evolve, many nodes either actively or passively become unreachable behind an NAT or a firewall. This has become a hindrance to the development of decentralized networks, where peer-to-peer communication data transfer between unreachable nodes cannot be accomplished, whether in decentralized file systems, decentralized social, or decentralized IoT. The existing scheme requires a series of centralized servers or requires network-wide flooding for consensus data, which can lead to the loss of decentralized nature of the network and cause flooding bottlenecks, contrary to the design concept of decentralization. In this paper, our proposed scheme uses a structured P2P overlay network to store the indexes of unreachable nodes in the whole network, so that the characteristics of a decentralized network are still maintained while ensuring the efficiency of lookup. When nodes communicate, the transmission channel is established so that both nodes continuously transmit data streams peer-to-peer without relying on the central server. Moreover, the scheme guarantees the security and privacy of nodes’ data transmission and the P2P overlay network without relying on centralized trusted institutions. Finally, we deploy a real cluster environment to verify the effectiveness of each module at different network sizes and prove the overall feasibility of the scheme. The scheme has certain advantages over existing solutions in terms of security, privacy, communication efficiency, device democracy, etc.
APA, Harvard, Vancouver, ISO, and other styles
9

Vimal, S1 Vijayalakshmi V2. "SURVEY: COMPARISON OF PEER-TO-PEER OVERLAY NETWORK FOR FILE SEARCHING AND SHARING METHODS." INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY 7, no. 1 (2018): 338–43. https://doi.org/10.5281/zenodo.1147478.

Full text
Abstract:
The infrastructure of Peer to Peer network is underlying on the network flows and end host. The overlay network forecasting the numerical performance of the network and it can improve the connection between the neighbor&rsquo;s nodes via proper routers. The performance of the overlay network is calculated by the amount of failure and success rate of the file sharing and improves the performance in the good usage of resources. We examine the peer to peer overlays networks by different networks similar by ad-hoc networks, sensor networks and Wireless LANs. This survey provides the features of P2P networks and well-organized scheme of locating the data item and to select the close nodes redundant storage with different permanence of data, to maintain the trust between the nodes and security of overlay networks. <strong>KEYWORDS</strong>: Overlay Networks, Neighbor Peer. Trust
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, Xin. "A Novel Security Architecture for Peer-to-Peer IMS System." Advanced Materials Research 664 (February 2013): 1076–81. http://dx.doi.org/10.4028/www.scientific.net/amr.664.1076.

Full text
Abstract:
Recently, some proposals suggest to use a peer-to-peer network instead of servers to facilitate SIP user registration and location in IMS communication systems. Due to the lack of central authority, security issue becomes one of the main problems in such P2P IMS systems. In this paper, we propose a novel security architecture for P2P IMS system. By using this architecture, our P2P IMS system becomes a fully distributed secure system in which there is not a central server indeed. Furthermore, our system is a scalable system which is capable of anonymous yet accountable real time communication based on SIP protocol which enables the system compatible with any existing IMS systems.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Peer-to-Peer Network Security"

1

Petersson, Linus. "Peer-to-peer : time to lock the door." Thesis, Blekinge Tekniska Högskola, Institutionen för programvaruteknik och datavetenskap, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-1724.

Full text
Abstract:
Is a regulating policy concerning peer-to-peer applications required so that companies and institutions can better manage the security issues of internal peer-to-peer applications? There is high security and privacy risks involved when using p2p applications like KaZaA, Bearshare, Audiogalaxy and ICQ. With the high speed networks of today it is very important to really know what is going on in your network and which applications is doing what and with whom. If not, there are high possibilities that your system will be used for more or less malicious purposes. Therefore it is interesting to find out if p2p applications have found their way behind company walls. A policy can prevent the issues discussed either by banning employees from using p2p applications or by regulate the use of these applications in a very detailed manner. The implementation of a policy makes the usage controlled and easily supervised by the company security staff. Implementing a policy that regulates the use of p2p applications can prevent possible attacks on the company/organisation network.
APA, Harvard, Vancouver, ISO, and other styles
2

Chen, Ta-wei. "Optimization of Transport Security for Securing Peer-to-Peer Communication in Heterogeneous Networks." Thesis, KTH, Mikroelektronik och Informationsteknik, IMIT, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-92298.

Full text
Abstract:
This thesis concerns the security of tomorrow’s peer-to-peer real-time communication in heterogeneous networks. Because of the additional delay caused by inband handshake and the poor compatibilities of some transport protocols, it was determined that existing security protocols such as transport layer security (TLS) and datagram transport layer security (DTLS) are not suitable in such a user scenario and a new security protocol should be designed. This new security protocol is called transport encapsulation security payload (TESP). TESP not only has the advantage of low initialization delay, but also fully supports transport protocols including TCP, UDP, stream control transmission protocol (SCTP), and datagram congestion control protocol (DCCP). Also a security analysis of TESP was carried out and no security flaws were found.<br>Denna uppsats behandlar säkerheten för morgondagens "peer-to-peer" (P2P) realtidskommunikation i heterogena nät. På grund av den adderade fördröjning som orsakas av inbandssignalering och dålig kompabilitet hos många transportprotokoll, så kan man fastställa att existerande säkerhetsprotokoll, såsom "(Datagram) Transport Layer Security" (TLS och DTLS), inte är lämpade för denna typ av kommunikation och att ett nytt säkerhetsprotokoll bör tas fram. "Transport Encapsulation Security Payload" (TESP) är ett sådant protokoll. TESP har inte bara fördelar såsom låg uppstartsfördröjning, utan har också stöd för många transportprotokoll, t.ex. "Transport Control Protocol" (TCP), "User Datagram Protocol" (UDP), "Stream Control Transmission Protocol" (SCTP) och "Datagram Congestion Control Protocol" (DCCP). Även en säkerhetsanalys av TESP har gjorts, där inga säkerhetsproblem har kunnat påvisas.
APA, Harvard, Vancouver, ISO, and other styles
3

Agbeko, Joseph. "Evaluation and application of bloom filters in computer network security /." Connect to resource online, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1253733230.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

WANG, HONGHAO. "An Efficient and Secure Overlay Network for General Peer-to-Peer Systems." University of Cincinnati / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1204080675.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Zhao, Xiwei. "Foundational Forensic Techniques for Cellular and Ad Hoc Multi-hop Networks." FIU Digital Commons, 2008. http://digitalcommons.fiu.edu/etd/23.

Full text
Abstract:
The Internet has become an integral part of our nation's critical socio-economic infrastructure. With its heightened use and growing complexity however, organizations are at greater risk of cyber crimes. To aid in the investigation of crimes committed on or via the Internet, a network forensics analysis tool pulls together needed digital evidence. It provides a platform for performing deep network analysis by capturing, recording and analyzing network events to find out the source of a security attack or other information security incidents. Existing network forensics work has been mostly focused on the Internet and fixed networks. But the exponential growth and use of wireless technologies, coupled with their unprecedented characteristics, necessitates the development of new network forensic analysis tools. This dissertation fostered the emergence of a new research field in cellular and ad-hoc network forensics. It was one of the first works to identify this problem and offer fundamental techniques and tools that laid the groundwork for future research. In particular, it introduced novel methods to record network incidents and report logged incidents. For recording incidents, location is considered essential to documenting network incidents. However, in network topology spaces, location cannot be measured due to absence of a 'distance metric'. Therefore, a novel solution was proposed to label locations of nodes within network topology spaces, and then to authenticate the identity of nodes in ad hoc environments. For reporting logged incidents, a novel technique based on Distributed Hash Tables (DHT) was adopted. Although the direct use of DHTs for reporting logged incidents would result in an uncontrollably recursive traffic, a new mechanism was introduced that overcome this recursive process. These logging and reporting techniques aided forensics over cellular and ad-hoc networks, which in turn increased their ability to track and trace attacks to their source. These techniques were a starting point for further research and development that would result in equipping future ad hoc networks with forensic components to complement existing security mechanisms.
APA, Harvard, Vancouver, ISO, and other styles
6

MERLANTI, Danilo. "MULTIMEDIA ON GEOGRAPHIC NETWORK." Doctoral thesis, Università degli studi di Ferrara, 2012. http://hdl.handle.net/11392/2389464.

Full text
Abstract:
In this thesis we investigate the topic of the multimedia contents distribution on a geo- graphic network which is a rarefied and huge field. First of all we have to classify the main parts necessary in the multimedia distribution on a geographic network. The main aspects of a geographic network that will be highlighted in this thesis are: the mechanism used to retrieve the sources of the multimedia content; in the case of the peer-to-peer network on geographic network one of the most important mechanism is the query flooding protocol. The kind of overlay network (peer-to-peer) used to distribute the multimedia content. The usage of this overlay network in a multicast network. The security of the overlay network over a geographic network. Therefore the first topic which is investigated in this thesis is the query flooding protocol that can be used in any kind of query operation on a peer-to-peer network. For this protocol we achieve an analytical model through a complex analysis of the proxies network. In this analysis we can see how the proxies permit an improvement in the performance with respect to the routing operations in a generic network of routers. Moreover we address a simple formulation and framework about the performance of the network with and without layer 7 (proxy) and we apply them in three different types of scenarios to show the advantages achieved with the usage of proxies instead of routers. Through the query flooding operation, each peer of the peer-to-peer network can achieve the list of the peers that hold the desired multimedia content. In a multimedia content dis- tribution system, after the previous step in which the list of the peers that hold the desired multimedia content is retrieved, it is necessary to establish the kind of peer-to-peer network used to distribute this multimedia content to the peers that require it. Therefore the second aspect analysed in this thesis, is how the peer-to-peer network is built so that it is possible to provide the multimedia content to the vast majority of peers (that require this content) with the minimum delay. The construction of the peer-to-peer networks used for the distribution of the multimedia contents is not a very investigated field. Thus in this thesis we produce new algorithms used to build peer-to-peer networks in an incremental way on asymmetric and radio channel and we establish which algorithm is better with respect to the maximum delay of the network, the maximization of the number of peers accepted in the network and the minimization of the bit error probability of each peer of the peer-to-peer network. In this thesis, we propose an usage of the overlay network (peer-to-peer network) in a multicast network. We introduce an innovative mechanism that exploits the peer-to-peer network to make reliable a standard unreliable multicast network. Moreover we present an analytical model for this innovative mechanism. Finally the last aspect of a geographic network is the security of the communications among a group of peers. Thus to ensure the maximum level of security with secure commu- nications among a group of three or more peers, in this thesis we propose a new protocol, based on the Massey Omura protocol, which can allow the communications among the peers of a peer-to-peer network in a secure way. Moreover we present the security prob- lems of this Massey Omura Multiple Users Protocol and how it is possible to avoid these issues through a specific encryption function and a specific decryption function by chang- ing the encryption and decryption keys of each peer when the source peer changes. Finally we present a new cryptography protocol which we use to share the decryption shared key that is used in the Massey Omura Multiple Users Protocol.
APA, Harvard, Vancouver, ISO, and other styles
7

Quinellato, Douglas Gielo. "Um sistema de reputação para redes Peer-to-Peer estruturado baseado na reputação de arquivos, com verificação pela reputação dos nos." [s.n.], 2009. http://repositorio.unicamp.br/jspui/handle/REPOSIP/276196.

Full text
Abstract:
Orientador: Paulo Licio de Geus<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação<br>Made available in DSpace on 2018-08-13T11:26:28Z (GMT). No. of bitstreams: 1 Quinellato_DouglasGielo_M.pdf: 2170090 bytes, checksum: 70af102166738a9e7bd99af678848faf (MD5) Previous issue date: 2009<br>Resumo: As redes P2P ganharam bastante popularidade na ultima decada, consolidando-se como um dos serviços mais populares da internet, provendo uma arquitetura distribuída para o fornecimento de servi¸cos sem a necessidade de um host assumir o papel de servidor. A popularidade trouxe, entretanto, a necessidade de se desenvolver mecanismos para garantir o funcionamento perante os crescentes ataques 'a rede. Com a estabilidade dos algoritmos relacionados ao funcionamento das redes P2P foi possível um aumento no desenvolvimento destes mecanismos de segurança. Nesta dissertação e proposto um sistema de reputação para redes P2P de compartilhamento de arquivos, um mecanismo de seguran¸ca que visa impedir a proliferação de arquivos corrompidos. Tais sistemas funcionam gerenciando as opiniões emitidas pelos nós participantes da rede sobre os serviços prestados pelos outros nós. Estas opiniões podem ser sobre o nó que prestou o serviço ou sobre a qualidade do serviço prestado. As opiniões sobre um mesmo nó ou serviço avaliado são armazenadas e posteriormente agregadas atraves de uma função, formando a reputação destes. O mecanismo proposto baseia-se nas opiniões emitidas sobre a autenticidade os arquivos, utilizando a reputação dos nós para indicar a qualidade da opinião sendo emitida por eles. Essa verificação da qualidade da opinião visa aumentar a confiança na opinião utilizada com a adicão de um nível de verificação por motivos de eficiência, visto que implementar uma rede de confiança inteira é custosa. Foram realizadas simulaçõs para a verificação da eficácia da rede, realizando comparações tanto com uma rede sem nenhum sistema de reputação quanto com outros sistemas de reputação.<br>Abstract: P2P networks have earned a great deal of popularity over the last decade, consolidating itself as one of the most popular internet service, providing a distributed architecture for the furnishing of services without the need of a centralized server host. However, such popularity brought the necessity for security mechanisms in order to assure the network availability in spite of the attacks on the network. Stability in the algorithms related to the basic operation of the P2P networks made possible the rise on the development of security systems. In this dissertation it's proposed a reputation system for file sharing P2P networks, a security mechanism aimed at lowering the spread of corrupted files in the network. Such systems work by managing the opinions issued by the participants of the network about the received services from the other nodes. These opinions can be about the nodes, or about the quality of the services themselves. Opinions about the same service or node are them joined through the use of a mathematical model (function), calculating their reputation. The proposed reputation system is based on the reputation of the files, using the node reputation as a means to assess the quality of the opinion being issued. This check is made with the purpose of improving trust in the used opinion by adding one level of opinion checking. Only one level is used for efficiency, since implementing a full trust network is expensive. Simulations were used in order to assess the effectiveness of the proposed reputation system. The results are used in comparisons with the same simulation without the use of any reputation system, and with the results of other reputation systems found in the literature.<br>Mestrado<br>Segurança de Redes<br>Mestre em Ciência da Computação
APA, Harvard, Vancouver, ISO, and other styles
8

Miller, John. "Distributed virtual environment scalability and security." Thesis, University of Cambridge, 2011. https://www.repository.cam.ac.uk/handle/1810/241109.

Full text
Abstract:
Distributed virtual environments (DVEs) have been an active area of research and engineering for more than 20 years. The most widely deployed DVEs are network games such as Quake, Halo, and World of Warcraft (WoW), with millions of users and billions of dollars in annual revenue. Deployed DVEs remain expensive centralized implementations despite significant research outlining ways to distribute DVE workloads. This dissertation shows previous DVE research evaluations are inconsistent with deployed DVE needs. Assumptions about avatar movement and proximity - fundamental scale factors - do not match WoW's workload, and likely the workload of other deployed DVEs. Alternate workload models are explored and preliminary conclusions presented. Using realistic workloads it is shown that a fully decentralized DVE cannot be deployed to today's consumers, regardless of its overhead. Residential broadband speeds are improving, and this limitation will eventually disappear. When it does, appropriate security mechanisms will be a fundamental requirement for technology adoption. A trusted auditing system ('Carbon') is presented which has good security, scalability, and resource characteristics for decentralized DVEs. When performing exhaustive auditing, Carbon adds 27% network overhead to a decentralized DVE with a WoW-like workload. This resource consumption can be reduced significantly, depending upon the DVE's risk tolerance. Finally, the Pairwise Random Protocol (PRP) is described. PRP enables adversaries to fairly resolve probabilistic activities, an ability missing from most decentralized DVE security proposals. Thus, this dissertations contribution is to address two of the obstacles for deploying research on decentralized DVE architectures. First, lack of evidence that research results apply to existing DVEs. Second, the lack of security systems combining appropriate security guarantees with acceptable overhead.
APA, Harvard, Vancouver, ISO, and other styles
9

Hsiao, Chih-Wen, David Turner, and Keith Ross. "A secure lightweight currency service provider." CSUSB ScholarWorks, 2004. https://scholarworks.lib.csusb.edu/etd-project/2594.

Full text
Abstract:
The main purpose of this project is to build a bank system that offers a friendly and simple interface to let users easily manage their lightweight currencies. The Lightweight Currency Protocol (LCP) was originally proposed to solve the problem of fairness in resource cooperatives. However, there are other possible applications of the protocol, including the control of spam and as a general purpose medium of exchange for low value transactions. This project investigates the implementation issues of the LCP, and also investigates LCP bank services to provide human interface to currency operations.
APA, Harvard, Vancouver, ISO, and other styles
10

Werapun, Warodom. "Architectures de réseaux pour la délivrance de services à domicile." Thesis, Toulouse, INPT, 2012. http://www.theses.fr/2012INPT0081/document.

Full text
Abstract:
Avec l’omniprésence au quotidien du numérique et de l’informatique, de plus en plus d’utilisateurs souhaitent avoir accès à Internet et à leurs applications via n’importe quel périphérique, de n’importe où et n’importe quand. Les appareils domestiques intelligents se développant, les besoins d’échanger des données au domicile même se font de plus en plus sentir. C’est dans ce contexte, celui des services à domicile avec besoin d’interconnexion que se situe notre étude. Ce type de service est qualifié de Home Service (HS) alors que le réseau à domicile est nommé Home Network (HN). La problématique pour les opérateurs est alors de concevoir des architectures appropriées à l’interconnexion des HN de manière sécurisée tout en permettant un déploiement facile et à grande échelle. Dans la première étape, nous considérons la livraison de services sécurisés à travers un réseau de nouvelle génération (NGN) : IMS (IP Multimedia Subsystem). IMS étant l’architecture de référence pour son caractère réseau NGN des opérateurs, diverses architectures peuvent être développées comme support aux HS. Nous avons choisi d'analyser et de mettre en place une architecture P2P centralisée et de le comparer à l’architecture de référence. Plusieurs mécanismes d'authentification sont mis en place autour du P2P centralisé afin de sécuriser la prestation de services. La modélisation et l’évaluation de notre proposition ont permis d’identifier sa relation à l’IMS mais aussi des problèmes inhérents aux solutions centralisées : la protection des données personnelles, l’impact de la taille sur réseau sur les performances, l’existence d’un point de faiblesse unique face aux attaques et la congestion au niveau du serveur centralisé. Par conséquent, nous nous sommes tournés vers les solutions distribuées pour résoudre ces problèmes. Dans la deuxième étape, nous considérons l’architecture P2P non-structurée, qualifiée de pur P2P. La cryptographie basée sur l'identité (IBC) est ajoutée au P2P pur afin d’authentifier les utilisateurs et de protéger leurs communications. Pour chacune des solutions une analyse du coût de signalisation est effectuée révélant une faiblesse en ce qui concerne l’étape de recherche. Dans un déploiement à grande échelle, le coût de cette phase est trop élevé. Aussi, nous examinons le P2P structuré basé sur les Dynamic Hash Tables, une autre solution distribuée. Cette architecture est étudiée par l'IETF en tant qu’une des dernières générations de P2P: REsource LOcation And Discovery (RELOAD) Base Protocol. Nous proposons son utilisation dans le cadre des HSs. Comme preuve du concept, cette solution a été implantée et déployée sur un petit réseau en utilisant TLS/SSL comme mécanisme de sécurité. Cette plateforme nous a permis d’étudier les délais et les coûts de cette solution. Pour terminer, un bilan est établi sur toutes les solutions proposées En outre, nous introduisons d’autres types de HS et leurs possibilités de déploiement futur<br>With digital life enhancement, more users would like to get seamless Internet and information with any devices, at any time and from anywhere. More and more home devices need to exchange data or to control other devices. The type of services is labelled Home Service (HS) and it is deployed though a Home Network (HN). Some users need to use their HS outside their HN, some others need to interconnect other HN. Operators have to provide suitable network architectures to ensure this interconnection and to provide at the same time, scalability, remote access, easy deployment and security. Here is the topic of our work. In the fist step, we consider a practical illustration around the Next-Generation Network (NGN) and the secured services. It is the IMS (IP Multimedia Subsystem) approach for the management of services that is generally supported by the NGN network operators. However, various network operator architectures can be developed to support these services. An alternative way is the P2P architectures. We choose to analyze and implement a centralized P2P and we compare it with the IMS solution. Several authentication mechanisms are introduced to secure the centralized P2P. An evaluation of these architectures is conducted. Since the previous solutions present some issues due to their centralized feature, we consider distributed solutions in a second step. The non-structured P2P, called pure P2P, can also support HS. Identity Based Crytography (IBC) is added to these architectures in order to offer authentication and protection to user communications. The different solutions are compared through their signaling and transmission cost. The study shows that searching step in this architecture is really costly, facing a scalability problem. Thus, we propose to use a structured P2P (called Dynamic Hash Table) for delivering HS between HN. This type of architecture is studied by IETF with the REsource Location And Discovery (RELOAD) Base Protocol. This solution is implanted and deployed here to be a proof of the concept. This test-bed enables the study of delay and security overhead in a real system. Eventually, the presented solutions are recaptured in order to see their advantages/ disadvantages. In addition, we introduce other perspectives in terms of HSs and network interconnection
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Peer-to-Peer Network Security"

1

Proudler, Graeme J. Security for a connectionless peer-to-peer link. Hewlett-Packard Laboratories, Technical Publications Department, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Korzun, Dmitry. Structured Peer-to-Peer Systems: Fundamentals of Hierarchical Organization, Routing, Scaling, and Security. Springer New York, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Oualha, Nouha. Peer-to-peer storage: Security and protocols. Nova Science Publishers, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Judiciary, United States Congress Senate Committee on the. The dark side of a bright idea: Could personal and national security risks compromise the potential of peer-to-peer file-sharing networks? : hearing before the Committee on the Judiciary, United States Senate, One Hundred Eighth Congress, first session, June 17, 2003. U.S. G.P.O., 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

United States. Federal Trade Commission. Office of Consumer and Business Education, ed. Uso compartido de archivos: Cómo evaluar los riesgos. Federal Trade Commission, Bureau of Consumer Protection, Office of Consumer and Business Education, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Reform, United States Congress House Committee on Government. Overexposed: The threats to privacy and security on filesharing networks : hearing before the Committee on Government Reform, House of Representatives, One Hundred Eighth Congress, first session, May 15, 2003. U.S. G.P.O., 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Malik, Zaki. Trust Management for Service-Oriented Environments. Springer-Verlag US, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Office, General Accounting. File sharing: Selected universities report taking action to reduce copyright infringement : report to congressional requesters. U.S. General Accounting Office, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Gurtov, Andrei, and Dmitry Korzun. Structured Peer-to-Peer Systems: Fundamentals of Hierarchical Organization, Routing, Scaling, and Security. Springer, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gurtov, Andrei, and Dmitry Korzun. Structured Peer-to-Peer Systems: Fundamentals of Hierarchical Organization, Routing, Scaling, and Security. Springer, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Peer-to-Peer Network Security"

1

Tsang, Patrick P., and Sean W. Smith. "PPAA: Peer-to-Peer Anonymous Authentication." In Applied Cryptography and Network Security. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-68914-0_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Cao, Tong, Jiangshan Yu, Jérémie Decouchant, Xiapu Luo, and Paulo Verissimo. "Exploring the Monero Peer-to-Peer Network." In Financial Cryptography and Data Security. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-51280-4_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tamassia, Roberto, and Nikos Triandopoulos. "Efficient Content Authentication in Peer-to-Peer Networks." In Applied Cryptography and Network Security. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-72738-5_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Thai, Phuc D., Minh Doan, Wei Liu, et al. "Blockchain Peer-to-Peer Network: Performance and Security." In Handbook on Blockchain. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-07535-3_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Collins, Michael P., and Michael K. Reiter. "Finding Peer-to-Peer File-Sharing Using Coarse Network Behaviors." In Computer Security – ESORICS 2006. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11863908_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Manulis, Mark. "Group Key Exchange Enabling On-Demand Derivation of Peer-to-Peer Keys." In Applied Cryptography and Network Security. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01957-9_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Garcia, Flavio D., and Jaap-Henk Hoepman. "Off-Line Karma: A Decentralized Currency for Peer-to-peer and Grid Applications." In Applied Cryptography and Network Security. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11496137_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Susilo, Willy, Yang-Wai Chow, and Rungrat Wiangsripanawan. "Towards Formalizing a Reputation System for Cheating Detection in Peer-to-Peer-Based Massively Multiplayer Online Games." In Network and System Security. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-34601-9_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kumar, K., J. Nafeesa Begum, and V. Sumathy. "Efficient Region-Based Key Agreement for Peer -to - Peer Information Sharing in Mobile Ad Hoc Networks." In Recent Trends in Network Security and Applications. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14478-3_29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Sen, Jaydip. "A Secure and Efficient Searching Scheme for Trusted Nodes in a Peer-to-Peer Network." In Computational Intelligence in Security for Information Systems. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21323-6_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Peer-to-Peer Network Security"

1

R, Rana Veer Samara Sihman Bharattej, Zaid Ajznblasm, E. G. Satish, Adlin Sylvia A, and M. Devi. "Enhancing Peer-to-Peer Network Security using 3D Convolutional Autoencoder based Anomaly Detection." In 2025 International Conference on Intelligent Systems and Computational Networks (ICISCN). IEEE, 2025. https://doi.org/10.1109/iciscn64258.2025.10934473.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Shi, Ruisheng, Zhiyuan Peng, Lina Lan, et al. "Eclipse Attacks on Monero's Peer-to-Peer Network." In Network and Distributed System Security Symposium. Internet Society, 2025. https://doi.org/10.14722/ndss.2025.240095.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chen, Jinrui, and Jianping Li. "The Research of Peer-to-Peer Network Security." In Proceedings of the International Conference. World Scientific Publishing Company, 2008. http://dx.doi.org/10.1142/9789812799524_0150.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Scanlon, Mark, and M.-Tahar Kechadi. "Universal Peer-to-Peer Network Investigation Framework." In 2013 Eighth International Conference on Availability, Reliability and Security (ARES). IEEE, 2013. http://dx.doi.org/10.1109/ares.2013.91.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Germanus, Daniel, Stefanie Roos, Thorsten Strufe, and Neeraj Suri. "Mitigating Eclipse attacks in Peer-To-Peer networks." In 2014 IEEE Conference on Communications and Network Security (CNS). IEEE, 2014. http://dx.doi.org/10.1109/cns.2014.6997509.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Faycal, Marguerite, and Ahmed Serhrouchni. "NETPOPPS: A Network Provider Oriented Peer-to-Peer System." In 2008 New Technologies, Mobility and Security (NTMS). IEEE, 2008. http://dx.doi.org/10.1109/ntms.2008.ecp.70.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kupershtein, Leonid M., Mykhailo D. Krentsin, and Andrii V. Prytula. "Use of peer-to-peer networks for secured communication." In 16th IC Measurement and Control in Complex Systems. VNTU, 2022. http://dx.doi.org/10.31649/mccs2022.20.

Full text
Abstract:
Peculiarities of the applied application of peering networks are considered (every node is equal; it can be both a client and a server). Mathematically, a decentralized network can be represented as a graph. The reasons for the emergence of peering networks are analyzed (low load on the client processor, the need to provide access to data and joint work on data). The classification of P2P networks according to three characteristics (functions, degree of centralization and method of connection) is also considered. The relevance and perspective of their application for personal communication, especially for data exchange within the company (required data security, fault tolerance and independence from Internet access) are determined.&#x0D; A peering network organization model is proposed, which provides for increased data security (messages, files, audio, user settings, etc.), reliable authentication of nodes (based on a combination of manual key distribution and trust network principles), scalability of the network itself and expansion of its functional capabilities (sending text, files, support for audio, video, etc.). The software implementation should work on most modern devices and operating systems (Android, IOS, Windows, MacOS). The created model makes it possible to increase security due to the combination of various cryptographic algorithms and data exchange protocols. Data exchange is based on the Tox protocol, which involves the use of distributed hash tables and asymmetric encryption. Data transport using the Tox protocol is organized based on TCP and UDP. A graphic representation of the above-described model is given, as well as a key exchange scheme between nodes. The data is also stored at the node in a protected form, and it can be read only if the key is present.
APA, Harvard, Vancouver, ISO, and other styles
8

Herwig, Stephen, Katura Harvey, George Hughey, Richard Roberts, and Dave Levin. "Measurement and Analysis of Hajime, a Peer-to-peer IoT Botnet." In Network and Distributed System Security Symposium. Internet Society, 2019. http://dx.doi.org/10.14722/ndss.2019.23488.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hamai, Tatsuaki, Masahiro Fujii, and Yu Watanabe. "ITU-T recommendations on peer-to-peer (P2P) network security." In 2009 International Symposium on Autonomous Decentralized Systems (ISADS). IEEE, 2009. http://dx.doi.org/10.1109/isads.2009.5207377.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Musa, Ahmad, Aliyu Abubakar, Usman Abdul Gimba, and Rasheed Abubakar Rasheed. "An Investigation into Peer-to-Peer Network Security Using Wireshark." In 2019 15th International Conference on Electronics, Computer and Computation (ICECCO). IEEE, 2019. http://dx.doi.org/10.1109/icecco48375.2019.9043236.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Peer-to-Peer Network Security"

1

Erol, Selman, and Michael Junho Lee. Financial System Architecture and Technological Vulnerability. Federal Reserve Bank of New York, 2024. http://dx.doi.org/10.59576/sr.1122.

Full text
Abstract:
This paper presents a framework to study of technological resiliency of financial system architecture. Financial market infrastructures, or platforms, compete with services critical functions along various stages in the lifecycle of a trade, and make investments in technological resiliency to guard against attackers seeking to exploit system weaknesses. Platforms’ financial network effects attenuate competition between platforms on security. Exposure to vulnerabilities is magnified in the presence of strategic adversaries. Private provision of technological resiliency is generally sub-optimal, with over- and underinvestment in security depending on market structure. Vulnerabilities evolve over the maturity of a financial system, but there generically exists a tipping point at which technological resiliency diverges from optimal and creates technological drag on the financial system. We find supportive evidence in tri-party repo settlement: the exit of duopolist resulted in a significant drop in IT-related investment by the sole provider, even as peer firms ramp up investment.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Peer-to-Peer Network Security' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography