Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
5.3
2.6
Journals
Electronics
Special Issues
Applied Cryptography and Practical Cryptoanalysis for Web 3.0
share announcement

Applied Cryptography and Practical Cryptoanalysis for Web 3.0

A special issue of Electronics (ISSN 2079-9292). This special issue belongs to the section "Computer Science & Engineering".

Deadline for manuscript submissions: 15 June 2025 | Viewed by 15011

Special Issue Editors

Dr. Tong Wu

E-Mail Website
Guest Editor
School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing 100083, China
Interests: applied cryptography; security and privacy in blockchain; industrial internet of things
Prof. Dr. Weiping Wang

E-Mail Website
Guest Editor
School of Computer and Communication Engineering, University of Science and Technology Beijing (USTB), Beijing 100083, China
Interests: security on artificial intelligence; industrial IoT security
Dr. Hailun Yan

E-Mail Website
Guest Editor
School of Cryptology, University of Chinese Academy of Sciences, Beijing 100049, China
Interests: cryptoanalysis; symmetric cryptographic primitive
Dr. Qing Fan

E-Mail Website
Guest Editor
School of Cyberspace Science and Technology, Beijing Institute of Technology, Beijing 100081, China
Interests: applied cryptography; secure protocol design; searchable encryption

Special Issue Information

Dear Colleagues,

In the rapidly evolving landscape of the digital era, Web 3.0 and cryptographic technologies stand at the forefront of innovation, promising a paradigm shift in how we interact with the internet and safeguard our digital assets. Web 3.0 represents the next evolutionary stage of the internet, focusing on creating a more intelligent, interconnected, and decentralized web experience. One of its core tenets is to empower users with greater control over their data, fostering transparency and privacy. This shift is crucial in an era in which concerns about data breaches, identity theft, and centralized control of information have become prevalent. Decentralization lies at the heart of Web 3.0, aiming to reduce reliance on central authorities and intermediaries. Web 3.0 uses blockchain technology to authenticate and verify the ownership of unique digital assets, which not only empowers creators by providing a direct avenue for monetization but also ensures the authenticity and provenance of digital content. Smart contracts, self-executing contracts with the terms of the agreement directly written into the code, exemplify the efficiency and trust that Web 3.0 seeks to instill in online interactions. Cryptographic technologies form the backbone of Web 3.0, providing the tools necessary for confidentiality, integrity, and authenticity. The importance of applied cryptography and cryptoanalysis techniques cannot be overstated. Applied cryptography ensures the confidentiality and integrity of data through sophisticated algorithms, while cryptoanalysis helps identify vulnerabilities of these building blocks. In an era where cyber threats are increasingly sophisticated, the adoption of these technologies becomes paramount, fortifying our defenses and ensuring the resilience of digital infrastructure against security issues in Web 3.0.

As we strive for a more decentralized, secure, and intelligent digital future, understanding and embracing these technologies becomes imperative. From the perspective of revolutionizing digital ownership, Web 3.0 and cryptographic technologies are not just technological advancements but catalysts for a more resilient, transparent, and equitable digital ecosystem. This Special Issue therefore seeks to contribute to the agenda of cryptography-based solutions and cryptographic analysis techniques through enriching the theoretical knowledge and practical solutions that improve performance and deployment by bringing into focus various cryptographic technologies suitable for Web 3.0, with the aim of achieving technical, social, and economic goals. We therefore invite papers on innovative technical developments, reviews, and analytical studies as well as assessment papers from different disciplines that are relevant to applied cryptography and cryptoanalysis for Web 3.0. Topics of interest for this publication include but are not limited to:

  • Security and privacy issues in Web3.0;
  • Access control suitable for Web3.0;
  • Data management in Web3.0;
  • Decentralized identification;
  • Distributed computing in Web3.0;
  • Edge computing in Web3.0;
  • AI-driven Web3.0;
  • Cryptocurrency;
  • Cybersecurity;
  • Cryptoanalysis on Web3.0 components;
  • Side-channel attack;
  • Practical data sharing;
  • Federated learning through Web3.0;
  • Secure big data technique.

Original research articles and reviews are welcome submissions to this Special Issue.

We look forward to receiving your contributions.

Dr. Tong Wu
Prof. Dr. Weiping Wang
Dr. Hailun Yan
Dr. Qing Fan
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Electronics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2400 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • cryptographic technologies
  • cryptography
  • cybersecurity
  • web 3.0

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue policies can be found here.

Published Papers (12 papers)

Download All Papers
Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

25 pages, 3771 KiB  
Article
RBFAC: A Redactable Blockchain Framework with Fine-Grained Access Control Based on Flexible Policy Chameleon Hash
by Shiyang Wu, Lifei Wei, Shihai Wu and Lei Zhang
Electronics 2025, 14(8), 1680; https://doi.org/10.3390/electronics14081680 - 21 Apr 2025
Abstract
While blockchain’s immutability ensures data integrity, it also poses significant challenges when dealing with illegal or erroneous data that require modification. The concept of redactable blockchain has emerged, utilizing Chameleon Hash (CH) and subsequent Policy-based Chameleon Hash (PCH) for controlled data editing. However, [...] Read more.
While blockchain’s immutability ensures data integrity, it also poses significant challenges when dealing with illegal or erroneous data that require modification. The concept of redactable blockchain has emerged, utilizing Chameleon Hash (CH) and subsequent Policy-based Chameleon Hash (PCH) for controlled data editing. However, current redactable blockchain implementations exhibit significant limitations, particularly in their inability to separate data editing from policy modification and their insufficient support for decentralized management of diverse editing operations. To address these issues, this paper initially introduces the concept of Flexible Policy Chameleon Hash (FPCH), which integrates PCH with non-interactive zero-knowledge proofs to enable enhanced policy management flexibility. Moreover, this paper proposes a Redactable Blockchain Framework with Fine-grained Access Control (RBFAC) based on FPCH. The RBFAC framework employs a hybrid cryptographic approach to separate the right of data editing from policy modification. The framework also provides essential functionalities, including editing accountability, key tracking and revocation mechanisms, and policy privacy protection. Finally, experimental evaluations demonstrate that the RBFAC framework maintains acceptable performance overhead while delivering these advanced features. The results indicate that the proposed solution addresses the limitations of existing redactable blockchain systems, offering a more flexible and secure approach to controlled data editing in blockchain environments. Full article
(This article belongs to the Special Issue Applied Cryptography and Practical Cryptoanalysis for Web 3.0)
►▼ Show Figures

Figure 1

20 pages, 648 KiB  
Article
Logarithmic NTRU-Based Certificateless Ring Signature in E-Voting Applications
by Wen Gao, Tianyou Fu, Simeng Ren, Shixuan Jin, Xiaoli Dong and Zhen Zhao
Electronics 2025, 14(7), 1358; https://doi.org/10.3390/electronics14071358 - 28 Mar 2025
Viewed by 158
Abstract
In electronic voting systems, a large number of voters are often required to vote. It is also necessary to ensure the security of the voters and the fairness of the vote. The use of ring signatures is very suitable for e-voting systems because [...] Read more.
In electronic voting systems, a large number of voters are often required to vote. It is also necessary to ensure the security of the voters and the fairness of the vote. The use of ring signatures is very suitable for e-voting systems because of their special anonymity. Among the many types of ring signatures, certificateless ring signature (CRS) stands out because it does not require certificates and avoids the need to completely trust the key generation center (KGC). In this paper, we propose a certificateless ring signature based on the special structure of the number theory research unit (NTRU) lattice, which utilizes the Merkle tree and seed tree to split commitments and integrate them again to generate signatures. At the same time, we embed the NTRU small integer solution (NTRU-SIS) problem and provide a detailed proof of security under the random oracle model (ROM). In efficiency, the Merkle tree makes the signature size logarithmically increase with the ring scale. In the era of big data explosion, this feature enables the proposed scheme to maintain a comparatively short signature size even when the number of ring members N is very large. When N=8, the signature size is 61.08 KB; when N increases to 512, the size is 65.02 KB. From the data, we can observe that the signature size grows slowly, by only 4 KB when N grows exponentially, which is much slower than ring signatures with linear growth. Full article
(This article belongs to the Special Issue Applied Cryptography and Practical Cryptoanalysis for Web 3.0)
►▼ Show Figures

Figure 1

18 pages, 681 KiB  
Article
Building Traceable Redactable Blockchain with Time-Verifiable Chameleon Hash
by Mingliang Chen, Guoqiang Xie, Benren Pan, Jinyan Fang, Zaide Xu and Zhen Zhao
Electronics 2025, 14(5), 846; https://doi.org/10.3390/electronics14050846 - 21 Feb 2025
Viewed by 393
Abstract
Blockchain is a decentralized digital ledger that records transactions across a distributed network of computers, enabling secure and transparent operations without requiring trust in a central authority. While initially developed for Bitcoin, blockchain technology now underpins many cryptocurrencies and other applications. It serves [...] Read more.
Blockchain is a decentralized digital ledger that records transactions across a distributed network of computers, enabling secure and transparent operations without requiring trust in a central authority. While initially developed for Bitcoin, blockchain technology now underpins many cryptocurrencies and other applications. It serves as an open trust layer without central reliance and is widely used in cryptocurrencies such as Bitcoin and Ethereum. However, this public and permanent open storage has raised concerns about its potential misuse for illegal trades or the distribution of unwanted content. In EuroS&P 2017, Ateniese et al. introduced the concept of the redactable blockchain, which utilizes the trapdoor collision function provided by chameleon hash to rewrite block contents without causing hashing inconsistencies. Recent research has continued to propose solutions for redactable blockchains, leveraging cryptographic algorithms such as chameleon hash and attribute-based encryption (ABE). Current solutions often employ sophisticated cryptographic schemes, such as ABE, but lack sufficient focus on developing secure and scalable solution for practical use. In this work, we propose the time-verifiable policy-based chameleon hash (TPCH) as a candidate solution for practical redaction to rewrite blockchain contents. Our solution for redactable blockchains enables the verification of whether a redaction was executed at a specific time, thereby offering time-based traceability for dominant algorithms in TPCH. Additionally, it restricts misbehavior or abuse of redaction powers by introducing a new trapdoor finding algorithm, Update, in addition to the adapt algorithm Adapt. We formally introduce TPCH with both black-box and white-box constructions. Our experimental and theoretical analysis demonstrates the feasibility and practicality of the proposed solution. Full article
(This article belongs to the Special Issue Applied Cryptography and Practical Cryptoanalysis for Web 3.0)
►▼ Show Figures

Figure 1

20 pages, 4464 KiB  
Article
Proximal Policy Optimization-Based Hierarchical Decision-Making Mechanism for Resource Allocation Optimization in UAV Networks
by Kun Sun, Jianyong Yang, Jinglei Li, Bo Yang and Shuman Ding
Electronics 2025, 14(4), 747; https://doi.org/10.3390/electronics14040747 - 14 Feb 2025
Viewed by 485
Abstract
To address the resource allocation problem in dynamic environments where multiple unmanned aerial vehicle base stations (UAV-BSs) provide efficient downlink services to ground users, this paper proposes a novel hierarchical decision-making mechanism based on the Proximal Policy Optimization (PPO) algorithm. The proposed method [...] Read more.
To address the resource allocation problem in dynamic environments where multiple unmanned aerial vehicle base stations (UAV-BSs) provide efficient downlink services to ground users, this paper proposes a novel hierarchical decision-making mechanism based on the Proximal Policy Optimization (PPO) algorithm. The proposed method optimizes time-frequency resource allocation in the downlink, aiming to maximize the total user throughput over multiple time slots. By constructing channel and interference models, the complex multi-channel resource allocation problem is decomposed into a series of single-channel decision subproblems, significantly reducing the action space complexity. Specifically, the original exponential complexity O(NM) (where N is the number of users and M is the number of channels) is reduced to a linear complexity O(N), effectively alleviating the curse of dimensionality. Simulation results demonstrate that the proposed hierarchical architecture, integrated with the PPO algorithm, achieves superior performance in terms of total throughput, convergence speed, and stability compared to existing methods. This study provides new insights and technical support for efficient resource management in UAV-BS systems operating in complex and dynamic environments. Full article
(This article belongs to the Special Issue Applied Cryptography and Practical Cryptoanalysis for Web 3.0)
►▼ Show Figures

Figure 1

16 pages, 516 KiB  
Article
Lattice-Based Group Signature with VLR for Anonymous Medical Service Evaluation System
by Wen Gao, Simeng Ren, Zhaoyang Liu, Baodong Qin, Xiaoli Dong and Zhen Zhao
Electronics 2025, 14(4), 680; https://doi.org/10.3390/electronics14040680 - 10 Feb 2025
Viewed by 535
Abstract
The medical industry has made significant advancements in recent years. However, the lack of accountability in medical management has resulted in systemic deficiencies, which have adversely affected patient trust and contributed to an increase in medical disputes. As a result, there is a [...] Read more.
The medical industry has made significant advancements in recent years. However, the lack of accountability in medical management has resulted in systemic deficiencies, which have adversely affected patient trust and contributed to an increase in medical disputes. As a result, there is a growing emphasis on managing the quality of medical services, particularly in enhancing patient experience. To address these challenges, we propose a new system for evaluating health services. This system will allow patients to anonymously rate the services they receive while also providing doctors the opportunity to appeal specific reviews. The hospital handles the evaluations and appeals through the management of the cloud platform. We propose a new scheme to assist the work of the platform, which is a lattice-based group signature with verifier-local revocation (VLR-GS). Most of the work on VLR-GS has focused on the random oracle model (ROM) or using non-interactive zero-knowledge proofs (NIZKs). Our construction is anonymous and traceable in the standard model under the hardness of the learning with errors problem and short integer solution problem. Furthermore, theoretically analyzing it has practical significance in both security and efficiency. In conclusion, the proposed scheme establishes a secure and privacy-oriented platform for an anonymous medical service evaluation system, with the goal of fostering patient trust and improving hospital service quality within the healthcare sector. Full article
(This article belongs to the Special Issue Applied Cryptography and Practical Cryptoanalysis for Web 3.0)
►▼ Show Figures

Figure 1

29 pages, 4144 KiB  
Article
Physical-Unclonable-Function-Based Lightweight Anonymous Authentication Protocol for Smart Grid
by Yu Guo, Lifeng Li, Xu Jin, Chunyan An, Chenyu Wang and Hairui Huang
Electronics 2025, 14(3), 623; https://doi.org/10.3390/electronics14030623 - 5 Feb 2025
Viewed by 681
Abstract
In the Internet of Everything era of Web 3.0, smart grid (SG) technology is also developing towards intelligent interconnection of terminal devices. However, in the smart grid scenario, security issues are particularly prominent, especially the openness of wireless sensor networks. Sensor nodes are [...] Read more.
In the Internet of Everything era of Web 3.0, smart grid (SG) technology is also developing towards intelligent interconnection of terminal devices. However, in the smart grid scenario, security issues are particularly prominent, especially the openness of wireless sensor networks. Sensor nodes are vulnerable to attacks and other security threats, which makes confirming the legitimacy of access identity and ensuring the secure transmission of data an urgent problem to be solved. At present, although a variety of authentication schemes for smart grid nodes have been proposed, most of them have problems. For example, some cannot achieve forward security. Therefore, this paper aims to solve this problem and proposes a lightweight anonymous authentication protocol based on physical unclonable functions (PUFs), which can implement mutual authentication and session key agreement between gateway nodes and sensor nodes. Compared to five state-of-the-art schemes in security and performance, the proposed scheme achieves all eight of the listed security requirements with lightweight calculation overhead, communication overhead, and storage overhead. Full article
(This article belongs to the Special Issue Applied Cryptography and Practical Cryptoanalysis for Web 3.0)
►▼ Show Figures

Figure 1

15 pages, 1376 KiB  
Article
Temporal Feature Prediction in Audio–Visual Deepfake Detection
by Yuan Gao, Xuelong Wang, Yu Zhang, Ping Zeng and Yingjie Ma
Electronics 2024, 13(17), 3433; https://doi.org/10.3390/electronics13173433 - 29 Aug 2024
Cited by 4 | Viewed by 2422
Abstract
The rapid growth of deepfake technology, generating realistic manipulated media, poses a significant threat due to potential misuse. Therefore, effective detection methods are urgently needed to prevent malicious use, as current approaches often focus on single modalities or the simple fusion of audio–visual [...] Read more.
The rapid growth of deepfake technology, generating realistic manipulated media, poses a significant threat due to potential misuse. Therefore, effective detection methods are urgently needed to prevent malicious use, as current approaches often focus on single modalities or the simple fusion of audio–visual signals, limiting their accuracy. To solve this problem, we propose a deepfake detection scheme based on bimodal temporal feature prediction, which innovatively introduces the idea of temporal feature prediction into the audio–video bimodal deepfake detection task, aiming at fully exploiting the temporal laws of audio–visual modalities. First, pairs of adjacent audio–video sequence clips are used to construct input quadruples, and a dual-stream network is employed to extract temporal feature representations from video and audio, respectively. A video prediction module and an audio prediction module are designed to capture the temporal inconsistencies within each single modality by predicting future temporal features and comparing them with reference features. Then, a projection layer network is designed to align the audio–visual features, using contrastive loss functions to perform contrastive learning and maximize the differences between real and fake video modalities. Experiments on the FakeAVCeleb dataset demonstrate superior performance with an accuracy of 84.33% and an AUC of 89.91%, outperforming existing methods and confirming the effectiveness of our approach in deepfake detection. Full article
(This article belongs to the Special Issue Applied Cryptography and Practical Cryptoanalysis for Web 3.0)
►▼ Show Figures

Figure 1

17 pages, 1887 KiB  
Article
A Privacy-Preserving Friend Matching Scheme Based on Attribute Encryption in Mobile Social Networks
by Li Yu, Xingxing Nan and Shufen Niu
Electronics 2024, 13(11), 2175; https://doi.org/10.3390/electronics13112175 - 3 Jun 2024
Cited by 2 | Viewed by 1019
Abstract
In mobile social networks, users can easily communicate with others through smart devices. Therefore, the protection of user privacy in social networks is becoming a significant subject. To solve this problem, this paper proposes a fine-grained data access control scheme that uses attributes [...] Read more.
In mobile social networks, users can easily communicate with others through smart devices. Therefore, the protection of user privacy in social networks is becoming a significant subject. To solve this problem, this paper proposes a fine-grained data access control scheme that uses attributes to match friends. In our scheme, the friend-making parties generate friend preference and self-description lists, respectively, realizing attribute hiding by converting friendship preference into ciphertext access control policies and self-description into attribute keys. The social platform matches user profiles to quickly eliminate unmatched users and avoids invalid decryption. In order to reduce the computational burden and communication cost of mobile devices, we adopt an algorithm mechanism for outsourcing decryption. When the user meets the matching conditions, the algorithm outsources the bilinear pair operation with large computation to the friend server. After that, the user finally decrypts the ciphertext. Security analysis shows that our scheme is safe and effective. In addition, performance evaluation shows that the proposed scheme is efficient and practical. Full article
(This article belongs to the Special Issue Applied Cryptography and Practical Cryptoanalysis for Web 3.0)
►▼ Show Figures

Figure 1

21 pages, 850 KiB  
Article
Reinventing Web Security: An Enhanced Cycle-Consistent Generative Adversarial Network Approach to Intrusion Detection
by Menghao Fang, Yixiang Wang, Liangbin Yang, Haorui Wu, Zilin Yin, Xiang Liu, Zexian Xie and Zixiao Kong
Electronics 2024, 13(9), 1711; https://doi.org/10.3390/electronics13091711 - 29 Apr 2024
Cited by 1 | Viewed by 1712
Abstract
Web3.0, as the link between the physical and digital domains, faces increasing security threats due to its inherent complexity and openness. Traditional intrusion detection systems (IDSs) encounter formidable challenges in grappling with the multidimensional and nonlinear traffic data characteristic of the Web3.0 environment. [...] Read more.
Web3.0, as the link between the physical and digital domains, faces increasing security threats due to its inherent complexity and openness. Traditional intrusion detection systems (IDSs) encounter formidable challenges in grappling with the multidimensional and nonlinear traffic data characteristic of the Web3.0 environment. Such challenges include insufficient samples of attack data, inadequate feature extraction, and resultant inaccuracies in model classification. Moreover, the scarcity of certain traffic data available for analysis by IDSs impedes the system’s capacity to document instances of malicious behavior. In response to these exigencies, this paper presents a novel approach to Web3.0 intrusion detection, predicated on the utilization of cycle-consistent generative adversarial networks (CycleGANs). Leveraging the data transformation capabilities of its generator, this method facilitates bidirectional conversion between normal Web3.0 behavioral data and potentially intrusive behavioral data. This transformative process not only augments the diversity and volume of recorded intrusive behaviors but also clandestinely simulates various attack scenarios. Furthermore, through fostering mutual competition and learning between the discriminator and generator, the approach enhances the ability to discern the defining characteristics of potential intrusive behaviors, thereby bolstering the accuracy of intrusion detection. To substantiate the efficacy of the CycleGAN-based intrusion detection method, simulation experiments were conducted utilizing public datasets, including KDD CUP 1999 (KDD), CIC-DDOS2019, CIC-IDS2018, and SR-BH 2020. The experimental findings evince the method’s remarkable accuracies across the four datasets, attaining rates of 99.81%, 97.79%, 89.25%, and 95.15%, respectively, while concurrently maintaining low false-positive rates. This research contributes novel insights and methodologies toward the advancement of Web3.0 intrusion detection through the application of CycleGAN technology, which is poised to play a pivotal role in fortifying the security landscape of Web3.0. Full article
(This article belongs to the Special Issue Applied Cryptography and Practical Cryptoanalysis for Web 3.0)
►▼ Show Figures

Figure 1

24 pages, 3024 KiB  
Article
A Data Sharing Model for Blockchain Trusted Sensor Leveraging Mimic Hash Mechanism
by Gaoyuan Quan, Zhongyuan Yao, Xueming Si, Weihua Zhu and Longfei Chen
Electronics 2024, 13(8), 1495; https://doi.org/10.3390/electronics13081495 - 14 Apr 2024
Cited by 1 | Viewed by 1687
Abstract
Blockchain, as a distributed trust database, has been widely applied in the field of trustworthy sharing of Internet of Things (IoT) sensor data. A single hash mechanism has achieved, to some extent, the trustworthy on-chain storage of blockchain sensor data, that is, the [...] Read more.
Blockchain, as a distributed trust database, has been widely applied in the field of trustworthy sharing of Internet of Things (IoT) sensor data. A single hash mechanism has achieved, to some extent, the trustworthy on-chain storage of blockchain sensor data, that is, the consistency of data on and off the chain. However, it still faces potential security risks such as collision attacks, short password attacks, and rainbow table attacks. To address this issue, this paper proposes a resiliently secure blockchain sensor data trustworthy sharing model based on a mimic hash mechanism. Specifically, in response to the security risks that may arise from the single hash mechanism, this study innovatively introduces a mimic hash mechanism and proposes two methods for constructing mimic hashes based on Verifiable Random Function (VRF) and Cyber Mimic Defense (CMD) in dedicated Wireless Sensor Networks (WSNs) and open public networks, respectively. Theoretical analysis and experimental results demonstrate that this model effectively solves the problem of trustworthy on-chain storage of sensor data in edge computing environments, enhancing the trustworthiness and security of the data on the chain. Full article
(This article belongs to the Special Issue Applied Cryptography and Practical Cryptoanalysis for Web 3.0)
►▼ Show Figures

Figure 1

18 pages, 539 KiB  
Article
SM9 Identity-Based Encryption with Designated-Position Fuzzy Equality Test
by Siyue Dong, Zhen Zhao, Baocang Wang, Wen Gao and Shanshan Zhang
Electronics 2024, 13(7), 1256; https://doi.org/10.3390/electronics13071256 - 28 Mar 2024
Viewed by 1309
Abstract
Public key encryption with equality test (PKEET) is a cryptographic primitive that enables a tester to determine whether two ciphertexts encrypted with same or different public keys have been generated from the same message without decryption. Previous studies extended PKEET to public key [...] Read more.
Public key encryption with equality test (PKEET) is a cryptographic primitive that enables a tester to determine whether two ciphertexts encrypted with same or different public keys have been generated from the same message without decryption. Previous studies extended PKEET to public key encryption with designated-position fuzzy equality test (PKE-DFET), enabling testers to verify whether plaintexts corresponding to two ciphertexts are equal while ignoring specific bits at designated positions. In this work, we have filled the research gap in the identity-based encryption (IBE) cryptosystems for this primitive. Furthermore, although our authorization method is the all-or-nothing (AoN) type, it overcomes the shortcomings present in the majority of AoN-type authorization schemes. In our scheme, equality tests can only be performed between a ciphertext and a given plaintext. Specifically, even if a tester acquires multiple AoN-type authorizations, it cannot conduct unpermitted equality tests between users. This significantly reduces the risk of user privacy leaks when handling sensitive information in certain scenarios, while still retaining the flexible and simple characteristics of AoN-type authorizations. We use the Chinese national cryptography standard SM9-IBE algorithm to provide the concrete construction of our scheme, enhancing the usability and security of our scheme, while making deployment more convenient. Finally, we prove that our scheme achieves F-OW-ID-CCA security when the adversary has the trapdoor of the challenge ciphertext, and achieves IND-ID-CCA security when the adversary does not have the trapdoor of the challenge ciphertext. Full article
(This article belongs to the Special Issue Applied Cryptography and Practical Cryptoanalysis for Web 3.0)
►▼ Show Figures

Figure 1

49 pages, 1033 KiB  
Article
A Novel Authentication Scheme Based on Verifiable Credentials Using Digital Identity in the Context of Web 3.0
by Stefania Loredana Nita and Marius Iulian Mihailescu
Electronics 2024, 13(6), 1137; https://doi.org/10.3390/electronics13061137 - 20 Mar 2024
Cited by 5 | Viewed by 2875
Abstract
This paper explores the concept of digital identity in the evolving landscape of Web 3.0, focusing on the development and implications of a novel authentication scheme using verifiable credentials. The background sets the stage by placing digital identity within the broad context of [...] Read more.
This paper explores the concept of digital identity in the evolving landscape of Web 3.0, focusing on the development and implications of a novel authentication scheme using verifiable credentials. The background sets the stage by placing digital identity within the broad context of Web 3.0′s decentralized, blockchain-based internet, highlighting the transition from earlier web paradigms. The methods section outlines the theoretical framework and technologies employed, such as blockchain, smart contracts, and cryptographic algorithms. The results summarize the main findings, including the proposed authentication scheme’s ability to enhance user control, security, and privacy in digital interactions. Finally, the conclusions discuss the broader implications of this scheme for future online transactions and digital identity management, emphasizing the shift towards self-sovereignty and reduced reliance on centralized authorities. Full article
(This article belongs to the Special Issue Applied Cryptography and Practical Cryptoanalysis for Web 3.0)
►▼ Show Figures

Figure 1

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-12
Back to TopTop