Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
6.9
2.4
Journals
Information
Special Issues
Editorial Board Members’ Collection Series: "Information Security and Privacy"
share announcement

Editorial Board Members’ Collection Series: "Information Security and Privacy"

A special issue of Information (ISSN 2078-2489). This special issue belongs to the section "Information Security and Privacy".

Deadline for manuscript submissions: closed (31 October 2024) | Viewed by 9226

Special Issue Editors

Prof. Dr. Jiguo Li

E-Mail Website
Guest Editor
College of Computer and Cyber Security, Fujian Normal University, Fuzhou 350117, China
Interests: information security and privacy
Dr. Maanak Gupta

E-Mail Website
Guest Editor
Department of Computer Science, Cybersecurity Education, Research & Outreach Center, Tennessee Technological University, Cookeville, TN 38505, USA
Interests: cybersecurity; cyber–physical systems; artificial intelligence; secure and trustworthy cyberspace
Special Issues, Collections and Topics in MDPI journals
Prof. Dr. Leandros Maglaras

E-Mail Website
Guest Editor
School of Computing, Edinburgh Napier University, Edinburgh EH10 5DT, UK
Interests: critical infrastructure protection; authentication methods; IDS
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

The Information Security and Privacy Science Collection series aims to publish original research and critical papers on all areas of security and privacy, including cloud storage security, access control, business security, searchable encryption, healthcare and social security, information security, communication security, and privacy. Other related fields include biometric-based security, cryptographic systems, digital signature, IoT security, embedded security, security and privacy data analysis, integrated security design solutions, monitoring, etc.

Specifically, the scope of the Editorial Board Member Essays series includes, but is not limited to, the following:

  • Secure communication;
  • Applied cryptography
  • Access control and identity management;
  • Encryption technology;
  • Blockchain;
  • Cloud storage security;
  • Formal methods for security and privacy;
  • Digital signature;
  • Threat intelligence;
  • Safe operation;
  • Virtualization security;
  • Internet of Things security;
  • Digital forensics;
  • Data privacy;
  • Database security;
  • Data mining security;
  • Big data security;
  • Risk management;
  • Application security;
  • Infrastructure security;
  • Searchable encryption;
  • Cloud security;
  • Network security.

Prof. Dr. Jiguo Li
Dr. Maanak Gupta
Prof. Dr. Leandros Maglaras
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. Information 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.

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 polices can be found here.

Published Papers (4 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, 511 KiB  
Article
Identity-Based Online/Offline Encryption Scheme from LWE
by Binger Zuo, Jiguo Li, Yichen Zhang and Jian Shen
Information 2024, 15(9), 539; https://doi.org/10.3390/info15090539 - 4 Sep 2024
Viewed by 587
Abstract
With quantum computers, the quantum resistance of cryptographic systems has gradually attracted attention. To overcome the shortcoming of existing identity-based encryption (IBE) schemes in resisting quantum attacks, we introduce an IBE scheme based on learning with errors (LWE). In addition, devices with limited [...] Read more.
With quantum computers, the quantum resistance of cryptographic systems has gradually attracted attention. To overcome the shortcoming of existing identity-based encryption (IBE) schemes in resisting quantum attacks, we introduce an IBE scheme based on learning with errors (LWE). In addition, devices with limited computing power are becoming increasingly common in practice, making it increasingly important to improve the efficiency of online computation of encryption algorithms. The classic solution is to directly improve the efficiency of the Gaussian sampling algorithm, thereby increasing the overall efficiency of the scheme. However, our scheme combines the efficient Gaussian sampling algorithm, G-trapdoor, with online/offline method to further improve the online encryption efficiency of the encryption algorithm. Our scheme completes partial computation before knowing the message and receiver’s identity, and once the message and receiver’s identity are obtained, the online part encryption can be efficiently completed. We construct an identity-based online/offline encryption (IBOOE) scheme from LWE with G-trapdoor, improve the efficiency of online encryption while achieving quantum resistant security. We prove the scheme’s security under the standard model for chosen-plaintext attack (CPA). By comparing with relevant schemes in terms of experiments and analysis, our scheme has improved efficiency by 65% to 80% compared to the classical LWE IBE scheme (increasing with LWE security parameters), and by 60% to 70% compared to the recent IBE scheme from LWE. This greatly improves the efficiency of online computing for low-power encryption devices while ensuring security. Full article
(This article belongs to the Special Issue Editorial Board Members’ Collection Series: "Information Security and Privacy")
►▼ Show Figures

Figure 1

20 pages, 6477 KiB  
Article
A New Time Series Dataset for Cyber-Threat Correlation, Regression and Neural-Network-Based Forecasting
by Fahim Sufi
Information 2024, 15(4), 199; https://doi.org/10.3390/info15040199 - 4 Apr 2024
Viewed by 3282
Abstract
In the face of escalating cyber threats that have contributed significantly to global economic losses, this study presents a comprehensive dataset capturing the multifaceted nature of cyber-attacks across 225 countries over a 14-month period from October 2022 to December 2023. The dataset, comprising [...] Read more.
In the face of escalating cyber threats that have contributed significantly to global economic losses, this study presents a comprehensive dataset capturing the multifaceted nature of cyber-attacks across 225 countries over a 14-month period from October 2022 to December 2023. The dataset, comprising 77,623 rows and 18 fields, provides a detailed chronology of cyber-attacks, categorized into eight critical dimensions: spam, ransomware, local infection, exploit, malicious mail, network attack, on-demand scan, and web threat. The dataset also includes ranking data, offering a comparative view of countries’ susceptibility to different cyber threats. The results reveal significant variations in the frequency and intensity of cyber-attacks across different countries and attack types. The data were meticulously compiled using modern AI-based data acquisition techniques, ensuring a high degree of accuracy and comprehensiveness. Correlation tests against the eight types of cyber-attacks resulted in the determination that on-demand scan and local infection are highly correlated, with a correlation coefficient of 0.93. Lastly, neural-network-based forecasting of these highly correlated factors (i.e., on-demand scan and local infection) reveals a similar pattern of prediction, with an MSE and an MAPE of 1.616 and 80.13, respectively. The study’s conclusions provide critical insights into the global landscape of cyber threats, highlighting the urgent need for robust cybersecurity measures. Full article
(This article belongs to the Special Issue Editorial Board Members’ Collection Series: "Information Security and Privacy")
►▼ Show Figures

Figure 1

16 pages, 275 KiB  
Article
A Traceable Universal Designated Verifier Transitive Signature Scheme
by Shaonan Hou, Chengjun Lin and Shaojun Yang
Information 2024, 15(1), 43; https://doi.org/10.3390/info15010043 - 12 Jan 2024
Cited by 3 | Viewed by 1380
Abstract
A transitive signature scheme enables anyone to obtain the signature on edge (i,k) by combining the signatures on edges (i,j) and (j,k), but it suffers from signature theft and signature [...] Read more.
A transitive signature scheme enables anyone to obtain the signature on edge (i,k) by combining the signatures on edges (i,j) and (j,k), but it suffers from signature theft and signature abuse. The existing work has solved these problems using a universal designated verifier transitive signature (UDVTS). However, the UDVTS scheme only enables the designated verifier to authenticate signatures, which provides a simple way for the signer to deny having signed some messages. The fact that the UDVTS is not publicly verifiable prevents the verifier from seeking help arbitrating the source of signatures. Based on this problem, this paper proposes a traceable universal designated verifier transitive signature (TUDVTS) and its security model. We introduce a tracer into the system who will trace the signature back to its true source after the verifier has submitted an application for arbitration. To show the feasibility of our primitive, we construct a concrete scheme from a bilinear group pair (G,GT) of prime order and prove that the scheme satisfies unforgeability, privacy, and traceability. Full article
(This article belongs to the Special Issue Editorial Board Members’ Collection Series: "Information Security and Privacy")
►▼ Show Figures

Figure 1

19 pages, 2162 KiB  
Article
Efficient Revocable Attribute-Based Encryption with Data Integrity and Key Escrow-Free
by Meijuan Huang, Yutian Liu, Bo Yang, Yanqi Zhao and Mingrui Zhang
Information 2024, 15(1), 32; https://doi.org/10.3390/info15010032 - 7 Jan 2024
Cited by 2 | Viewed by 2615
Abstract
Revocable attribute-based encryption (RABE) provides greater flexibility and fine-grained access control for data sharing. However, the revocation process for most RABE schemes today is performed by the cloud storage provider (CSP). Since the CSP is an honest and curious third party, there is [...] Read more.
Revocable attribute-based encryption (RABE) provides greater flexibility and fine-grained access control for data sharing. However, the revocation process for most RABE schemes today is performed by the cloud storage provider (CSP). Since the CSP is an honest and curious third party, there is no guarantee that the plaintext data corresponding to the new ciphertext after revocation is the same as the original plaintext data. In addition, most attribute-based encryption schemes suffer from issues related to key escrow. To overcome the aforementioned issues, we present an efficient RABE scheme that supports data integrity while also addressing the key escrow issue. We demonstrate the security for our system, which is reduced to the decisional q-parallel bilinear Diffie-Hellman exponent (q-PBDHE) assumption and discrete logarithm (DL) assumption. The performance analysis illustrates that our scheme is efficient. Full article
(This article belongs to the Special Issue Editorial Board Members’ Collection Series: "Information Security and 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-4
Back to TopTop