Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
4.0
2.3
Journals
Mathematics
Special Issues
New Advances in Applied Cryptography, Network Security and Data Privacy
share announcement

New Advances in Applied Cryptography, Network Security and Data Privacy

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "E1: Mathematics and Computer Science".

Deadline for manuscript submissions: 15 October 2025 | Viewed by 3442

Special Issue Editor

Prof. Dr. Miodrag Mihaljevic

E-Mail Website
Guest Editor
Mathematical Institute, The Serbian Academy of Sciences and Arts, 11000 Belgrade, Serbia
Interests: cryptology; information security; blockchain technology and elements of coding theory

Special Issue Information

Dear Colleagues,

Recent trends in the combination of cyber space and physical systems have enhanced the importance of cyber security and privacy requirements. In particular, this development has introduced new challenges regarding network security, data privacy, and applied cryptography. Also, blockchain technology may be used to solve these challenges. Consequently, different mathematical approaches are employed to address security and privacy problems. The goal of this Special Issue is to propose advanced techniques that: (i) minimize the implementation and execution overheads of the employed cryptographic mechanisms for network security and data privacy; (ii) provide mathematical proofs for the security and privacy claims; (iii) evaluate the security of certain cryptographic primitives; and (iv) yield efficient blockchain consensus protocols. Accordingly, this Special Issue is focused on a number of topics including, but not limited to, the following ones:

  • The design and analysis of advanced lightweight cryptographic techniques;
  • Advanced techniques for network security;
  • Advanced techniques for data privacy;
  • Blockchain technology-based approaches for network security and data privacy;
  • Advanced techniques for blockchain technology;
  • Machine learning-based approaches for network security;
  • Security and privacy in Internet of Things.

Prof. Dr. Miodrag Mihaljevic
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. 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

  • lightweight cryptography
  • network security
  • data privacy
  • blockchain technology
  • machine learning

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 (3 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

17 pages, 803 KiB  
Article
Effective Route Recommendation Leveraging Differentially Private Location Data
by Jongwook Kim
Mathematics 2024, 12(19), 2977; https://doi.org/10.3390/math12192977 - 25 Sep 2024
Viewed by 760
Abstract
The proliferation of GPS-enabled devices and advances in positioning technologies have greatly facilitated the collection of user location data, making them valuable across various domains. One of the most common and practical uses of these location datasets is to recommend the most probable [...] Read more.
The proliferation of GPS-enabled devices and advances in positioning technologies have greatly facilitated the collection of user location data, making them valuable across various domains. One of the most common and practical uses of these location datasets is to recommend the most probable route between two locations to users. Traditional algorithms for route recommendation rely on true trajectory data collected from users, which raises significant privacy concerns due to the personal information often contained in location data. Therefore, in this paper, we propose a novel framework for computing optimal routes using location data collected through differential privacy (DP)-based privacy-preserving methods. The proposed framework introduces a method for accurately extracting transitional probabilities from perturbed trajectory datasets, addressing the challenge of low data utility caused by DP-based methods. Specifically, to effectively compute transitional probabilities, we present a density-adjusted sampling method that enables the collection of representative data across all areas. In addition, we introduce an effective scheme to approximately estimate transitional probabilities based on sampled datasets. Experimental results on real-world data demonstrate the practical applicability and effectiveness of our framework in computing optimal routes while preserving user privacy. Full article
(This article belongs to the Special Issue New Advances in Applied Cryptography, Network Security and Data Privacy)
►▼ Show Figures

Figure 1

17 pages, 461 KiB  
Article
LMKCDEY Revisited: Speeding Up Blind Rotation with Signed Evaluation Keys
by Yongwoo Lee
Mathematics 2024, 12(18), 2909; https://doi.org/10.3390/math12182909 - 18 Sep 2024
Viewed by 890
Abstract
Recently, Lee et al. introduced a novel blind rotation technique utilizing ring automorphisms also known as LMKCDEY. Among known prominent blind rotation methods, LMKCDEY stands out because of its minimal key size and efficient runtime for arbitrary secret keys, although Chillotti et al.’s [...] Read more.
Recently, Lee et al. introduced a novel blind rotation technique utilizing ring automorphisms also known as LMKCDEY. Among known prominent blind rotation methods, LMKCDEY stands out because of its minimal key size and efficient runtime for arbitrary secret keys, although Chillotti et al.’s approach, commonly referred to as CGGI, offers faster runtime when using binary or ternary secrets. In this paper, we propose an enhancement to LMKCDEY’s runtime by incorporating auxiliary keys that encrypt the negated values of secret key elements. Our method not only achieves faster execution than LMKCDEY but also maintains a smaller key size compared to the ternary version of CGGI. Moreover, the proposed technique is compatible with LMKCDEY with only minimal adjustments. Experimental results with OpenFHE demonstrate that our approach can improve bootstrapping runtime by 5–28%, depending on the chosen parameters. Full article
(This article belongs to the Special Issue New Advances in Applied Cryptography, Network Security and Data Privacy)
►▼ Show Figures

Figure 1

25 pages, 5279 KiB  
Article
Reinforcing Network Security: Network Attack Detection Using Random Grove Blend in Weighted MLP Layers
by Adel Binbusayyis
Mathematics 2024, 12(11), 1720; https://doi.org/10.3390/math12111720 - 31 May 2024
Cited by 1 | Viewed by 1235
Abstract
In the modern world, the evolution of the internet supports the automation of several tasks, such as communication, education, sports, etc. Conversely, it is prone to several types of attacks that disturb data transfer in the network. Efficient attack detection is needed to [...] Read more.
In the modern world, the evolution of the internet supports the automation of several tasks, such as communication, education, sports, etc. Conversely, it is prone to several types of attacks that disturb data transfer in the network. Efficient attack detection is needed to avoid the consequences of an attack. Traditionally, manual attack detection is limited by human error, less efficiency, and a time-consuming mechanism. To address the problem, a large number of existing methods focus on several techniques for better efficacy in attack detection. However, improvement is needed in significant factors such as accuracy, handling larger data, over-fitting versus fitting, etc. To tackle this issue, the proposed system utilized a Random Grove Blend in Weighted MLP (Multi-Layer Perceptron) Layers to classify network attacks. The MLP is used for its advantages in solving complex non-linear problems, larger datasets, and high accuracy. Conversely, it is limited by computation and requirements for a great deal of labeled training data. To resolve the issue, a random info grove blend and weight weave layer are incorporated into the MLP mechanism. To attain this, the UNSW–NB15 dataset, which comprises nine types of network attack, is utilized to detect attacks. Moreover, the Scapy tool (2.4.3) is utilized to generate a real-time dataset for classifying types of attack. The efficiency of the presented mechanism is calculated with performance metrics. Furthermore, internal and external comparisons are processed in the respective research to reveal the system’s better efficiency. The proposed model utilizing the advantages of Random Grove Blend in Weighted MLP attained an accuracy of 98%. Correspondingly, the presented system is intended to contribute to the research associated with enhancing network security. Full article
(This article belongs to the Special Issue New Advances in Applied Cryptography, Network Security and Data Privacy)
►▼ 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-3
Back to TopTop