Cryptography in Digital Networks

A special issue of Future Internet (ISSN 1999-5903). This special issue belongs to the section "Cybersecurity".

Deadline for manuscript submissions: closed (30 June 2023) | Viewed by 2973

Special Issue Editor

Faculty of Information Technology, Beijing University of Technology, Beijing 100124, China
Interests: information security; wireless networks; blockchain technology; digital forensics
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

The rapid development of information technology, especially the emergence of Internet of Things (IoT), cloud and edge computing, big data analytics, etc., in recent years has made the security of information in storage and during transmission crucial in any modern information system.

Today, billions of people around the world are inter-connected through digital networks to enable the exchange and sharing of information of all kinds, making security and privacy serious issues in various applications. Attacks of all kinds, such as hacking, impersonation, traffic analysis, etc., cause devastating violations to the confidentiality, integrity and availability of information to which modern cryptography algorithms and technologies can be applied in the development of effective solutions. Therefore, the study of the various theories, designs, implementations, analyses and applications of cryptography would be very helpful in dealing effectively and efficiently with the potential dangers of security and privacy in digital networks.

This Special Issue is dedicated to exploring the theories and the recent trends in the development of cryptography as well as the application of cryptography in digital networks to counter security and privacy problems. To achieve the goal, this Special Issue invites researchers and practitioners to contribute high-quality original research papers in the areas that cover both the theoretical and the practical aspects of cryptography.

Prof. Dr. Jingsha He
Guest Editor

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. Future Internet is an international peer-reviewed open access monthly 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 1600 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

  • cryptography
  • information security
  • privacy protection
  • public-key cryptography
  • cryptographic algorithms
  • cryptanalysis techniques
  • authentication
  • key exchange
  • digital signature

Published Papers (2 papers)

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

Research

21 pages, 693 KiB  
Article
How Can We Achieve Query Keyword Frequency Analysis in Privacy-Preserving Situations?
by Yiming Zhu, Dehua Zhou, Yuan Li, Beibei Song and Chuansheng Wang
Future Internet 2023, 15(6), 197; https://doi.org/10.3390/fi15060197 - 29 May 2023
Viewed by 1048
Abstract
Recently, significant progress has been made in the field of public key encryption with keyword search (PEKS), with a focus on optimizing search methods and improving the security and efficiency of schemes. Keyword frequency analysis is a powerful tool for enhancing retrieval services [...] Read more.
Recently, significant progress has been made in the field of public key encryption with keyword search (PEKS), with a focus on optimizing search methods and improving the security and efficiency of schemes. Keyword frequency analysis is a powerful tool for enhancing retrieval services in explicit databases. However, designing a PEKS scheme that integrates keyword frequency analysis while preserving privacy and security has remained challenging, as it may conflict with some of the security principles of PEKS. In this paper, we propose an innovative scheme that introduces a security deadline to query trapdoors through the use of timestamps. This means that the keywords in the query trapdoor can only be recovered after the security deadline has passed. This approach allows for keyword frequency analysis of query keywords without compromising data privacy and user privacy, while also providing protection against keyword-guessing attacks through the dual-server architecture of our scheme. Moreover, our scheme supports multi-keyword queries in multi-user scenarios and is highly scalable. Finally, we evaluate the computational and communication efficiency of our scheme, demonstrating its feasibility in practical applications. Full article
(This article belongs to the Special Issue Cryptography in Digital Networks)
Show Figures

Figure 1

17 pages, 2932 KiB  
Article
A Game Theory-Based Model for the Dissemination of Privacy Information in Online Social Networks
by Jingsha He, Yue Li and Nafei Zhu
Future Internet 2023, 15(3), 92; https://doi.org/10.3390/fi15030092 - 27 Feb 2023
Cited by 2 | Viewed by 1366
Abstract
Online social networks (OSNs) have experienced rapid growth in recent years, and an increasing number of people now use OSNs, such as Facebook and Twitter, to share and spread information on a daily basis. As a special type of information, user personal information [...] Read more.
Online social networks (OSNs) have experienced rapid growth in recent years, and an increasing number of people now use OSNs, such as Facebook and Twitter, to share and spread information on a daily basis. As a special type of information, user personal information is also widely disseminated in such networks, posing threats to user privacy. The study on privacy information dissemination is thus useful for the development of mechanisms and tools for the effective protection of privacy information in OSNs. In this paper, we propose to apply the game theory to establish a sender–receiver game model and the Nash equilibrium to describe the behavioral strategies of users in disseminating privacy information. Factors that affect the dissemination of privacy information are also analyzed with two important aspects: intimacy and popularity of the privacy-concerning subject. Simulation experiments were conducted based on real data sets from scale-free networks and real social networks to compare and analyze the effectiveness of the model. Results show that the proposed game theory is applicable to the privacy information dissemination model, which implements intimacy and popularity in the modeling of the dissemination of privacy information in OSNs. Both the impact of the macro-level OSNs and the micro-relationships between users are evaluated on the dissemination of privacy information, which provides a new perspective for exploring the dissemination of privacy information and facilitates the development of effective mechanisms for privacy protection in OSNs. Full article
(This article belongs to the Special Issue Cryptography in Digital Networks)
Show Figures

Figure 1

Back to TopTop