Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
4.9
2.1
Journals
Entropy
Special Issues
Information-Theoretic Cryptography and Security
entropy-logo
Submit to Special Issue Submit Abstract to Special Issue Review for Entropy Propose a Special Issue

Journal Menu

► Journal Menu

Journal Browser

► Journal Browser
share announcement

Information-Theoretic Cryptography and Security

A special issue of Entropy (ISSN 1099-4300). This special issue belongs to the section "Information Theory, Probability and Statistics".

Deadline for manuscript submissions: 18 April 2025 | Viewed by 2741

Special Issue Editor

Dr. Linning Peng

E-Mail Website
Guest Editor
School of Information Science & Engineering, Southeast University, Nanjing 210096, China
Interests: physical layer security; communication security; multimedia security

Special Issue Information

Dear Colleagues,

Claude Shannon proposed the concept of perfect secrecy in his work in 1949. With the development of quantum computing technology, traditional mathematical complexity-based cryptographic key distribution methods face challenges. Emerging technologies such as quantum key distribution and physical layer key distribution provide conditions for realizing Shannon's concept of perfect secrecy. How to achieve the security of information-theoretic cryptography will be a problem of significant significance and challenge. This Special Issue aims to bring together recent research efforts that apply information theory to characterize and study the fundamental limits of cryptography and security. Possible topics include, but are not limited to, the following:

  • Post-quantum cryptography including lattice-based cryptography, multivariate cryptography, hash-based cryptography, code-based cryptography, isogeny-based cryptography, and symmetric key quantum resistance, among others.
  • Secure computation including secret sharing, secure multi-party computation, information-theoretic proof systems, randomness extraction and privacy amplification, differential privacy, and zero-knowledge proof, among others.
  • Quantum technology including quantum information processing, quantum key distribution, and secret key agreement in quantum technology, among others.
  • Physical layer security including secret key generation, physical layer authentication, secure communication, covert and stealthy communication, and secrecy capacity of communications channels, among others.

Dr. Linning Peng
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. Entropy 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 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

  • post-quantum cryptography
  • secure computation
  • secure communication
  • quantum key distribution
  • physical layer security
  • secret key generation
  • secrecy capacity

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

16 pages, 755 KiB  
Article
An MLWE-Based Cut-and-Choose Oblivious Transfer Protocol
by Yongli Tang, Menghao Guo, Yachao Huo, Zongqu Zhao, Jinxia Yu and Baodong Qin
Entropy 2024, 26(9), 793; https://doi.org/10.3390/e26090793 - 16 Sep 2024
Viewed by 795
Abstract
The existing lattice-based cut-and-choose oblivious transfer protocol is constructed based on the learning-with-errors (LWE) problem, which generally has the problem of inefficiency. An efficient cut-and-choose oblivious transfer protocol is proposed based on the difficult module-learning-with-errors (MLWE) problem. Compression and decompression techniques are introduced [...] Read more.
The existing lattice-based cut-and-choose oblivious transfer protocol is constructed based on the learning-with-errors (LWE) problem, which generally has the problem of inefficiency. An efficient cut-and-choose oblivious transfer protocol is proposed based on the difficult module-learning-with-errors (MLWE) problem. Compression and decompression techniques are introduced in the LWE-based dual-mode encryption system to improve it to an MLWE-based dual-mode encryption framework, which is applied to the protocol as an intermediate scheme. Subsequently, the security and efficiency of the protocol are analysed, and the security of the protocol can be reduced to the shortest independent vector problem (SIVP) on the lattice, which is resistant to quantum attacks. Since the whole protocol relies on the polynomial ring of elements to perform operations, the efficiency of polynomial modulo multiplication can be improved by using fast Fourier transform (FFT). Finally, this paper compares the protocol with an LWE-based protocol in terms of computational and communication complexities. The analysis results show that the protocol reduces the computation and communication overheads by at least a factor of n while maintaining the optimal number of communication rounds under malicious adversary attacks. Full article
(This article belongs to the Special Issue Information-Theoretic Cryptography and Security)
►▼ Show Figures

Figure 1

18 pages, 579 KiB  
Article
Minimizing Computation and Communication Costs of Two-Sided Secure Distributed Matrix Multiplication under Arbitrary Collusion Pattern
by Jin Li, Nan Liu and Wei Kang
Entropy 2024, 26(5), 407; https://doi.org/10.3390/e26050407 - 8 May 2024
Viewed by 950
Abstract
This paper studies the problem of minimizing the total cost, including computation cost and communication cost, in the system of two-sided secure distributed matrix multiplication (SDMM) under an arbitrary collusion pattern. In order to perform SDMM, the two input matrices are split into [...] Read more.
This paper studies the problem of minimizing the total cost, including computation cost and communication cost, in the system of two-sided secure distributed matrix multiplication (SDMM) under an arbitrary collusion pattern. In order to perform SDMM, the two input matrices are split into some blocks, blocks of random matrices are appended to protect the security of the two input matrices, and encoded copies of the blocks are distributed to all computing nodes for matrix multiplication calculation. Our aim is to minimize the total cost, overall matrix splitting factors, number of appended random matrices, and distribution vector, while satisfying the security constraint of the two input matrices, the decodability constraint of the desired result of the multiplication, the storage capacity of the computing nodes, and the delay constraint. First, a strategy of appending zeros to the input matrices is proposed to overcome the divisibility problem of matrix splitting. Next, the optimization problem is divided into two subproblems with the aid of alternating optimization (AO), where a feasible solution can be obtained. In addition, some necessary conditions for the problem to be feasible are provided. Simulation results demonstrate the superiority of our proposed scheme compared to the scheme without appending zeros and the scheme with no alternating optimization. Full article
(This article belongs to the Special Issue Information-Theoretic Cryptography and Security)
►▼ 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-2
Back to TopTop