检索结果-内蒙古大学图书馆

Research on IPFS Image Copyright Protection Method Based on Blockchain

Computers, Materials & Continua 2024年第10期81卷 663-684页

作者： Xin Cong Lanjin Feng Lingling Zi College of Computer and Information Science Chongqing Normal UniversityChongqing401331China

In the digital information age,distributed file storage technologies like the InterPlanetary File System(IPFS)have gained considerable traction as a means of storing and disseminating media *** the advantages of decentralized storage,the proliferation of decentralized technologies has highlighted the need to address the issue of file *** aim of this paper is to address the critical issues of source verification and digital copyright protection for IPFS image *** this end,an innovative approach is proposed that integrates blockchain,digital signature,and blind *** technology functions as a decentralized and tamper-resistant ledger,recording and verifying the source information of files,thereby establishing credible evidence of file origin.A digital signature serves to authenticate the identity and integrity of the individual responsible for uploading the file,ensuring data ***,blind watermarking is employed to embed invisible information within images,thereby safeguarding digital copyrights and enabling file *** further optimize the efficiency of file retrieval within IPFS,a dual-layer distributed hash table(DHT)indexing structure is *** structure divides file index information into a global index layer and a local index layer,significantly reducing retrieval time and network *** feasibility of the proposed approach is demonstrated through practical examples,providing an effective solution to the copyright protection issues associated with IPFS image files.

关键词： Blockchain copyright protection IPFS distributed hash table digital sig

来源：评论

学校读者我要写书评

暂无评论

Securing cloud access with enhanced attribute-based cryptography

引用

COMPUTING 2024年第12期106卷 4193-4207页

作者： Kumar, Ashutosh Verma, Garima DIT Univ Sch Comp Comp Sci & Engn Dept Dehra Dun India DIT Univ Sch Comp Dehra Dun India

With technological advancements and increasing globalization, cloud computing has emerged as one of the most favoured environments for managing and maintaining data, information, and services worldwide. However, this widespread use of cloud computing necessitates addressing various security challenges and implementing adequate provisions for ensuring data confidentiality and privacy. This paper proposes a modified model to address the above challenges. An improved access control system utilizing attribute-based encryption (ABE) has been proposed for secure cloud access. In this system, the message is broadcasted by the owner, and only precise users possessing definite attributes and constraints are authorized to access shared data. The encryption is carried out on the basis of attributes of the users, and each user's secret share is generated based on their given identity information. The distributed hash table (DHT) is used to distribute ciphertext share and decryption key. The authorized users can receive the disseminated ciphertext only by utilizing their secret shares and the required attributes. The proposed model has been experimentally evaluated and compared with existing state-of-the-art systems, demonstrating its effectiveness and superiority. Additionally, the model incorporates extra features such as a time limit for data availability, biometrics-based identity verification, and resistance to various attacks.

关键词： Cloud security Identity Attacks Attribute-based encryption distributed hash table Biometrics

来源：评论

学校读者我要写书评

暂无评论

HIGH-PERFORMANCE COMPUTING WEB SEARCH SYSTEM BASED ON COMPUTER BIG DATA

引用

SCALABLE COMPUTING-PRACTICE AND EXPERIENCE 2024年第3期25卷 1932-1939页

作者： Kang, Yingxi Tang, Beiping Hu, Xiaodong Hunan Inst Engn Xiangtan 411104 Hunan Peoples R China

File sharing, streaming media, collaborative computing, and other P2P systems are all unicast to establish the corresponding overlapping network. The superimposed network is generally carried out based on the existing primary network. In this way, the access of each node is random. At the same time, this will cause the topological structure of the upper and lower layers to be inconsistent. This will increase the communication delay between nodes and cause an excellent bandwidth burden to the underlying network. The existing topology matching methods still face problems, such as poor scalability and long node aggregation time. This paper aims to design a topological distributed node aggregation method based on network coordination and distributed hash table (DHT) algorithm. This paper established a two-dimensional mesh model of nodes based on equal-distance concentric circles and divided into two equal areas. The parts of multiple namespaces correspond one by one according to their location. Because nodes are kept close, neighbours can be aggregated through DHT's primary "publish" and "search" primitives. Experimental results show that the TANRA method can match the network's topology under a slight delay and a large number of nodes. The TANRA method can effectively reduce the path delay in structured networks.

关键词： Topological induction Node proximity Topology aware node aggregation algorithm Node cluster distributed hash table Overlay Network

来源：评论

学校读者我要写书评

暂无评论

A collaborative ledger storing model for lightweight blockchains based on Chord Ring

引用

JOURNAL OF SUPERCOMPUTING 2024年第4期80卷 5593-5615页

作者： Nie, ZiXiang Li, Jin Duan, FengHui Lu, Yueming Beijing Univ Posts & Telecommun Key Lab Trustworthy Distributed Comp & Serv BUPT Minist Educ Beijing 100876 Peoples R China

A blockchain is one distributed ledger system and keeps the high redundancy of ledger copies to make the assurance of network security. However, the continuously duplicated full copies also impose a tremendous amount of demand on some nodes for data storage. The development of blockchain technologies in the Internet of things (IoT) application scenario is hampered by the restricted storage capacities of terminal devices used in the IoT edge computing scenario, which makes it difficult to load the full copy with infinite growth. Our paper suggests a collaborative ledger storing model based on Chord Ring to address the issues with lightweight blockchains in data storage. On-chain blocks are split by Chord Ring structure and stored in various node clusters in a decentralized manner, and off-chain blocks at various levels are provided with proof-of-work consensus asynchronously and archived centrally to the cloud storage on a regular basis. The theoretical and experimental analysis indicates that this model can reduce the data storage redundancy of blockchains while ensuring the high availability of data and the high decentralization of the network.

关键词： Lightweight blockchains Ledger structure Asynchronous consensus distributed hash table

来源：评论

学校读者我要写书评

暂无评论

CCECGP: causal consistency model of edge-cloud collaborative based on grouping protocol

引用

JOURNAL OF SUPERCOMPUTING 2023年第8期79卷 8401-8424页

作者： Tian, Junfeng Jia, Haoyi Bai, Wenqing Hebei Univ Sch Cyber Secur & Comp Baoding 071000 Peoples R China Hebei Univ Hebei Key Lab High Confidence Informat Syst Baoding 071000 Peoples R China

At present, most causal consistency models based on cloud storage can no longer meet the needs of delay-sensitive applications. Moreover, the overhead of data synchronization between replicas is too high. This paper proposes a causal consistency model of edge-cloud collaborative based on grouping protocol. The model is based on the edge-cloud collaboration architecture, partitions cloud data centers and groups edge nodes by distributed hash tables, and stores a subset of the complete data set in nodes located at the edge of the network, thereby realizing partial geo-replication in edge-cloud collaboration environment. At the same time, we design a group synchronization algorithm called Imp_Paxos, so that the update only needs to be synchronized to the main group, which reduces the visibility delay of the update and decreases the data synchronization overhead. Besides, a sort timestamp is proposed in this paper, which generates different timestamps according to the type of update to track causality, keeping the amount of metadata managed in a relatively stable and low state. Therefore, the proposed model reduces the overhead of metadata for system management and improves throughput quantity of system. Experiments show that our model performs well in terms of throughput, operation latency, and update visibility latency compared with existing causal consistency models.

关键词： Causal consistency Edge-cloud collaborative distributed hash table Sort timestamp Grouping algorithm

来源：评论

学校读者我要写书评

暂无评论

An effective approach for reducing data redundancy in multi-agent system communication

引用

MULTIAGENT AND GRID SYSTEMS 2024年第1期20卷 69-88页

作者： Qasim, Awais Ghouri, Arslan Munawar, Adeel Govt Coll Univ Lahore Dept Comp Sci Lahore Pakistan Lahore Garrison Univ Dept Comp Sci Lahore Pakistan Thammasat Univ Sirindhorn Int Inst Technol Bangkok Thailand

The redundancy of the data is an active research topic. While an agent works in a multi-agent system, the number of messages between them increases. This is due to the fact that the functionalities data depends on other agents in terms of functional requirements. Typically, only one agent in a multi-agent system is responsible for accessing a database instead of replicating the database on each agent. A database is stored on multiple agents rather than a single agent to avoid a single point of failure. In this approach, the system has a higher load because one agent is responsible for all agent queries and must send duplicate messages to multiple agents, resulting in redundant data. In this research, we present Multi-Agent System for Commodity Data (MASCD) framework, the multi-agent system based communication using the distributed hash system, to reduce data redundancy in multi-agent system communication. Our anticipated method demonstrated how we divided the database names and efficiently distributed data to each agent. The database splitting is based on manufacturer names or product names. We utilize a table based on prime numbers. Through the hash function, we ascertain the index of the agent granted access to the relevant data. Each agent is accountable for its data. We use a distributed hash table for efficient querying that stores data as key-value pairs. Each agent maintains a Finger table containing the next and previous nodes for agent communication purposes. Using FIPA messages, we demonstrated how an agent could interact optimally. In conclusion, we illustrate the application of the proposed approach through a case study of mobile phones and university information systems.

关键词： Multi-agent systems distributed hash table agent communication FIPA communication

来源：评论

学校读者我要写书评

暂无评论

Peer to peer sybil and eclipse attack detection via fuzzy kademlia

引用

JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2023年第4期44卷 6925-6937页

作者： Geepthi, D. Columbus, C. Christopher Jeyanthi, C. PSN Coll Engn & Technol Dept Comp Sci & Engn Tirunelveli 627152 India PSN Coll Engn & Technol Dept Elect & Commun Engn Tirunelveli India

P2P networks are particularly vulnerable to Sybil and Eclipse attacks, especially those based on distributed hash tables (DHT). However, detecting Sybil and Eclipse attacks is a challenging task, and existing methods are ineffective due to unequal sample distribution, incomplete definitions of discriminating features, and weak feature perception. This paper proposes a Fuzzy Secure Kademlia (FSK) that detects and mitigates the Sybil and Eclipse attack. At first, a node requests authentication by providing its MAC address, location, Node Angle (NA), and Node Residual Energy (NRE) to an infrastructure server. As long as the packet's ID, location, NA, and NRE match the packet's received ID, it can be recognized as normal. The incoming packet, however, is detected as Sybil or Eclipse attack packets if copies are made in locations other than those specified. When the Sybil or Eclipse attack has been detected, locate the multiplied nodes. By using the FSK, the malicious node can be removed, preventing it from causing any harm to the network. The suggested framework is compared with existing methods in terms of detection time, and energy consumption. Experimental results indicate that the suggested FSK technique achieves a better detection time of 29.4%, 25.5%, 22.6%, and 18.1% than CSI, DHT, CMA, and EDA methods.

关键词： To-peer sybil attack eclipse attack fuzzy secure kademlia distributed hash table detection mitigate

来源：评论

学校读者我要写书评

暂无评论

Keyword-based multimedia data lookup in decentralized systems 8

Keyword-based multimedia data lookup in decentralized system...

引用

IEEE 8th International Conference on Information and Communication Technologies for Disaster Management (ICT-DM)

作者： Fazzini, Emanuele Zichichi, Mirko Ferretti, Stefano D'Angelo, Gabriele Univ Bologna Dept Comp Sci & Engn Bologna Italy IOTA Fdn Rome Italy Univ Urbino Carlo Bo Dept Pure & Appl Sci Urbino PU Italy

ISBN: (纸本)9798350319514

The use of decentralized systems has the potential to offer secure and efficient collaboration without intermediaries, and in the absence or fault of a central server. However, searching for content in a decentralized system is still an issue, especially when real-time information needs to be retrieved (e.g. emergency situations). We propose a keyword-based decentralized lookup scheme, based on the International Standard Content Code (ISCC), which enables the unique identification of digital content without the need for a centralized registry or authority. Our approach exploits a hypercube distributed hash table (DHT) for storing and retrieving shared resources and compares different approaches to index contents within it. Results show that the use of ISCC, as the basis for creating identifiers, enables more efficient content placement and retrieval, which could pave the way for novel decentralized solutions that surmount the presence of centralized servers for content lookup.

关键词： distributed hash table Keyword Search Decentralized File Storage distributed Ledger Technology

来源：评论

学校读者我要写书评

暂无评论

Sybil Attack Strikes Again: Denying Content Access in IPFS with a Single Computer 24

Sybil Attack Strikes Again: Denying Content Access in IPFS w...

引用

19th International Conference on Availability, Reliability, and Security (ARES)

作者： Cholez, Thibault Ignat, Claudia-Lavinia Univ Lorraine CNRS Inria LORIA Nancy France

ISBN: (纸本)9798400717185

The distributed hash table (DHT) architecture is known to be a very efficient way to implement peer-to-peer (P2P) computer networks. However, the scientific literature also proved that DHT functioning in P2P networks can be easily disrupted by a single entity controlling many peers, known as the Sybil Attack. Various defensive mechanisms are known to prevent such attacks, or at least hinder them. The current study evaluates the resiliency of the InterPlanetary File System (IPFS) P2P network to a legacy Sybil Attack. We show that, surprisingly, IPFS does not implement basic defense mechanisms, allowing the most simple attack from a single computer to easily take the control of any DHT entry. A practical use of this attack is to almost entirely deny access to a given content on the network. Thus we provide some recommendations to quickly remediate this vulnerability.

关键词： Sybil Attack IPFS distributed hash table Denial of Service P2P network

来源：评论

学校读者我要写书评

暂无评论

A Scalable State Sharing Protocol for Low-Resource Validator Nodes in Blockchain Networks 6

A Scalable State Sharing Protocol for Low-Resource Validator...

引用

6th Conference on Blockchain Research & Applications for Innovative Networks and Services

作者： Hias, Ruben Wang, Weihong Vanhoof, Jan Van Cutsem, Tom Katholieke Univ Leuven Leuven Belgium Katholieke Univ Leuven DistriNet Leuven Belgium

ISBN: (纸本)9798350367850;9798350367843

The perpetual growth of data stored on popular blockchains such as Ethereum leads to significant scalability challenges and substantial storage costs for operators of full nodes. Increasing costs may lead to fewer independently operated nodes in the network, which poses risks to decentralization (and hence network security), but also pushes decentralized app developers towards centrally hosted API services. This paper introduces a new protocol that allows validator nodes to participate in a blockchain network without the need to store the full state of the network on each node. The key idea is to use the blockchain network as both a replicated state machine and as a distributed storage system. By distributing states across nodes and enabling efficient data retrieval through a Kademlia-inspired routing protocol, we reduce storage costs for validators. Cryptographic proofs (such as Merkle proofs) are used to allow nodes to verify data stored by other nodes without having to trust those nodes directly. While the protocol trades off data storage for increased network bandwidth, we show how gossiping and caching can minimize the increased bandwidth needs. To validate our state sharing protocol, we conduct an extensive quantitative analysis of Ethereum's data storage and data access patterns. Our findings indicate that while our protocol significantly lowers storage needs, it comes with an increased bandwidth usage ranging from 1.5 MB to 5 MB per block, translating to an additional monthly bandwidth of 319 GB to 1,065 GB. Despite this, the size remains small enough such that it can be passed to all nodes and validated within Ethereum's 12-second block validation window. Further analysis shows that Merkle proofs are the most significant contributor to the additional bandwidth. To address this concern, we also analyze the impact of switching to the more space-efficient Verkle Proofs. Our findings show that Verkle Proofs would promise significant efficiency gains if integrat

关键词： Blockchain Networks distributed hash table Low-Resource Validator Nodes Ethereum

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：