International Journal of Network Management最新文献

The metaverse is a virtual environment that combines the real and digital worlds through technological and social structures. It heralds a novel paradigm in internet applications and societal engagement by weaving together diverse cutting-edge technologies to facilitate a virtual representation of the tangible world. Within the metaverse, the facets of economy, culture, and other dimensions are fully documentable, trackable, and quantifiable, largely owing to the capabilities of blockchain technology. Nonetheless, the transactional volume within the metaverse is typically substantial, posing challenges for a singular blockchain platform in terms of efficiency and support capacity. Consequently, a multi-blockchain infrastructure becomes essential to underpin the economic fabric of the metaverse. Enabling the collaborative operation of multiple blockchain platforms, specifically achieving the seamless transfer of value across different blockchain ecosystems, has emerged as a critical challenge. To address this challenge, this paper introduces a cross-chain protocol predicated on a multi-role notary system designed to facilitate inter-blockchain value transfers. The protocol specifies the functions of different entities within the notary framework, allocating specific duties to notaries, committees, and a leader. It also promotes mutual oversight among notaries to sustain a dynamic and equitable group structure. Furthermore, an incentive mechanism is proposed to motivate committee members toward prompt and judicious decision-making regarding votes. Based on experiments conducted on the Ethereum platform, our proposed solution exhibits a 75% reduction in transaction time compared to Ethereum's transaction confirmation time.

In the digital age, the expansion of cyberspace has resulted in increasing complexity, making clear cyberspace visualization crucial for effective analysis and decision-making. Current cyberspace visualizations are overly complex and fail to accurately reflect node importance. To address the challenge of complex cyberspace visualization, this study introduces the integrated centrality metric (ICM) for constructing a metaphorical map that accurately reflects node importance. The ICM, a novel node centrality measure, demonstrates superior accuracy in identifying key nodes compared to degree centrality (DC), k-shell centrality (KC), and PageRank values. Through community partitioning and point-cluster feature generalization, we extract a network's hierarchical structure to intuitively represent its community and backbone topology, and we construct a metaphorical map that offers a clear visualization of cyberspace. Experiments were conducted on four original networks and their extracted backbone networks to identify core nodes. The Jaccard coefficient was calculated considering the results of the three aforementioned centrality measures, ICM, and the SIR model. The results indicate that ICM achieved the best performance in both the original networks and all extracted backbone networks. This demonstrates that ICM can more precisely evaluate node importance, thereby facilitating the construction of metaphorical maps. Moreover, the proposed metaphorical map is more convenient than traditional topological maps for quickly comprehending the complex characteristics of networks.

As the internet of vehicles (IoV) technology develops, it promotes the intelligent interaction among vehicles, roadside units, and the environment. Nevertheless, it also brings vehicle information security challenges. In recent years, vehicle data sharing is suffering to algorithm substitution attacks (ASA), which means backdoor adversaries can carry out filtering attacks through data sharing. Therefore, this paper designs a blockchain-based proxy re-encryption (PRE) scheme with cryptographic reverse firewall (BIBPR-CRF) for IoV. In our proposal, CRF can promise the internal safety of vehicle units. More specifically, it can prevent ASA attacks while ensuring chosen plaintext attack (CPA)-security. Meanwhile, the PRE algorithm can provide the confidential sharing and secure operation of data. Moreover, we use a consortium blockchain service center (CBSC) to store the first ciphertext and re-encrypt it with smart contracts on the blockchain, which can avoid single point of failure and achieve higher efficiency compared to proxy servers. Finally, we evaluate the performance of BIBPR-CRF with regard to communication cost, computational cost, and energy consumption. Our proposal is the most fitting for IoV application, in contrast with the other three schemes.

Updatable signature (US) resists key compromise attacks and is integral in numerous fields that require authentication. However, previous US schemes granted excessive power to update token, which cannot achieve no-directional key update. In this paper, we improve Cini et al.'s US scheme by weakening update token. The improvement lies in changing the mode of generating an update token, from the signer alone to the signer and the server cooperatively. Specifically, they first negotiate a secret value, which is then used by the signer to generate an update token. This mode ensures that only the entity who owns the secret value can use the update token to update a signature. Furthermore, we employ indistinguishability obfuscation to minimize information leakage through update token. These advancements make the improved updatable signature scheme achieve no-directional key update and unidirectional signature update. Finally, we present an enhanced security model, where an adversary is permitted to freely corrupt update tokens and signing keys, except the signing key at challenge epoch, and then prove the improved scheme to be unforgeable based on CDH hardness.

In witness encryption (WE), an instance $��x�$ of an NP problem is allowed to be used to encrypt a message, and who holding a witness of the problem can efficiently decrypt the ciphertext. In this work, we put forth the concept of homomorphic witness encryption (HWE), where one can evaluate functions over ciphertexts of the same instance without decrypting them, that is, one can manipulate a set of ciphertexts with messages $��(�{�M�}_{�1�}�,�\cdots ��,�{�M�}_{�n�}�)�$ to obtain the evaluation of $��f�(�{�M�}_{�1�}�,�\cdots ��,�{�M�}_{�n�}�)�$, for any function $��f�$. We declare that such homomorphic witness encryption schemes can be generically constructed from indistinguishable obfuscation ($��i�O�$