New Advances in Coding Theory and Cryptography, 2nd Edition

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "Computational and Applied Mathematics".

Deadline for manuscript submissions: 31 August 2024 | Viewed by 1503

Special Issue Editors


E-Mail Website
Guest Editor
School of Cyberspace Science and Technology, Beijing Institute of Technology, Beijing 100081, China
Interests: Internet of Things (IoT) security; applied cryptography; network security; computer security
Special Issues, Collections and Topics in MDPI journals
School of Computer Science and Information Engineering, Hefei University of Technology, ‎Anhui‎ 230601, China
Interests: security; privacy; applied cryptography; blockchain
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China
Interests: authentication; identification; privacy
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

With the rapid development of information technology and advanced communications, new threats and malicious attackers have rapidly emerged, bringing serious challenges in the cybersecurity domain. Consequently, coding theory and cryptography have become common and indispensable to tackle security problems in both the academic and industrial communities.

Recent years have witnessed a proliferation of powerful coding and cryptographic algorithms, protocols, and systems which combine with promising technologies, including artificial intelligence, blockchain, cloud computing, digital twins, edge computing, etc. It is conducive for academic researchers and industry practitioners to exchange new ideas and discuss increasing technology convergence.

This Special Issue welcomes contributions from theory to practice and aims to publish high-quality and original research papers on various technologies for secure computing and communication. Topics include, but are not limited to, the following:

  • Homomorphic encryption and attribute-based encryption;
  • Zero knowledge proofs and secure multiparty computation;
  • Authentication and key exchange;
  • Lattice theory and its applications;
  • Blockchain-based secure communication systems;
  • Cloud security and privacy;
  • Trustworthy digital twins in industrial IoT systems;
  • Federated learning in edge computing;
  • Vulnerabilities, attacks, and defenses;
  • Privacy-preserving machine learning.

Prof. Dr. Liehuang Zhu
Dr. Meng Li
Dr. Zijian Zhang
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. Mathematics 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 2600 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

  • encryption
  • verifiable computing
  • cryptographic protocols
  • coding theory
  • blockchain
  • cloud security
  • digital twins
  • edge computing
  • threat and attack
  • machine learning

Published Papers (2 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

17 pages, 1358 KiB  
Article
Adaptive Parallel Scheduling Scheme for Smart Contract
by Wenjin Yang, Meng Ao, Jing Sun, Guoan Wang, Yongxuan Li, Chunhai Li and Zhuguang Shao
Mathematics 2024, 12(9), 1347; https://doi.org/10.3390/math12091347 - 29 Apr 2024
Viewed by 261
Abstract
With the increasing demand for decentralized systems and the widespread usage of blockchain, low throughput and high latency have become the biggest stumbling blocks in the development of blockchain systems. This problem seriously hinders the expansion of blockchain and its application in production. [...] Read more.
With the increasing demand for decentralized systems and the widespread usage of blockchain, low throughput and high latency have become the biggest stumbling blocks in the development of blockchain systems. This problem seriously hinders the expansion of blockchain and its application in production. Most existing smart contract scheduling solutions use static feature analysis to prevent contract conflicts during parallel execution. However, the conflicts between transactions are complex; static feature analysis is not accurate enough. In this paper, we first build the dependency between smart contracts by analyzing the features. After numerous experiments, we propose a conflict model to adjust the relationship between threads and conflict to achieve high throughput and low latency. Based on these works, we propose adaptive parallel scheduling for smart contracts on the blockchain. Our adaptive parallel scheduling can distinguish conflicts between smart contracts and dynamically adjust the execution strategy of smart contracts based on the conflict factors we define. We implement our scheme on ChainMaker, one of the most popular open-source permissioned blockchains, and build experiments to verify our solution. Regarding latency, our solution demonstrates remarkable efficiency compared with the fully parallel scheme, particularly in high-conflict transaction scenarios, where our solution achieves latency levels just one-twentieth of the fully parallel scheme. Regarding throughput, our solution significantly outperforms the fully parallel scheme, achieving 30 times higher throughput in high-conflict transaction scenarios. These results highlight the superior performance and effectiveness of our solution in addressing latency and throughput challenges, particularly in environments with high transaction conflicts. Full article
(This article belongs to the Special Issue New Advances in Coding Theory and Cryptography, 2nd Edition)
Show Figures

Figure 1

14 pages, 631 KiB  
Article
BNS: A Detection System to Find Nodes in the Bitcoin Network
by Ruiguang Li, Liehuang Zhu, Chao Li, Fudong Wu and Dawei Xu
Mathematics 2023, 11(24), 4885; https://doi.org/10.3390/math11244885 - 06 Dec 2023
Viewed by 865
Abstract
Bitcoin was launched over a decade ago and has made an increasing impact on the world’s financial order, which has attracted the attention of researchers all over the world. The Bitcoin system runs on a dynamic P2P network, containing tens of thousands of [...] Read more.
Bitcoin was launched over a decade ago and has made an increasing impact on the world’s financial order, which has attracted the attention of researchers all over the world. The Bitcoin system runs on a dynamic P2P network, containing tens of thousands of nodes, including reachable nodes and unreachable nodes. In this article, a detection system, BNS (Bitcoin Network Sniffer), which could collect as many Bitcoin nodes as possible is proposed. For reachable nodes, the authors designed an algorithm, BRF (Bitcoin Reachable-Nodes Finding), based on node activity evaluation which reduces the nodes to be detected and greatly shortens the detection time. For unreachable nodes, the authors trained a decision tree model, BUF (Bitcoin Unreachable-Nodes Finding), to identify unreachable nodes based on attribute features from a large number of node addresses. Experiments showed that BNS discovered an average of 1093 more reachable nodes (6.4%) and 662 more unreachable nodes (2.3%) than the well-known website “Bitnodes” per day. It showed better performance in total nodes and efficiency. Based on the experimental results, the authors analyzed the real network size, node “churn”, and geographical distribution. Full article
(This article belongs to the Special Issue New Advances in Coding Theory and Cryptography, 2nd Edition)
Show Figures

Figure 1

Back to TopTop