This paper analyzes the formalizations of information-theoretic security for the fundamental primitives in cryptography: symmetric-key encryption and key agreement. Revisiting the previous results, we can formalize information-theoretic security using different methods, by extending Shannon's perfect secrecy, by information-theoretic analogues of indistinguishability and semantic security, and by the frameworks for composability of protocols. We show the relationships among the security formalizations and obtain the following results. First, in the case of encryption, there are significant gaps among the formalizations, and a certain type of relaxed perfect secrecy or a variant of information-theoretic indistinguishability is the strongest notion. Second, in the case of key agreement, there are significant gaps among the formalizations, and a certain type of relaxed perfect secrecy is the strongest notion. In particular, in both encryption and key agreement, the formalization of composable security is not stronger than any other formalizations. Furthermore, as an application of the relationships in encryption and key agreement, we simultaneously derive a family of lower bounds on the size of secret keys and security quantities required under the above formalizations, which also implies the importance and usefulness of the relationships.
13 August 2025 in IEEE Open Journal of the Communications Society
Integrated sensing and communication (ISAC) has become a crucial technology in the development of next-generation wireless communication systems. The integration of communication and sensing functionalities on a unified spectrum and infrastructure is expected to enable a variety of emerging use cases. The introduction of ISAC has led to various new challenges and opportunities related to the security of wireless communications, resulting in significant research focused on ISAC system design in relation to physical layer security (PLS). The shared spectrum usage poses a risk, exposing confidential messages embedded in probing ISAC signals to potentially malicious sensing targets. This situation creates a tradeoff between sensing performance and security performance. The sensing functionality of ISAC offers a unique opportunity for PLS by utilizing sensing information regarding potential eavesdroppers to design secure PLS schemes. This study examines PLS methodologies to tackle the specified security challenge associated with ISAC. The study begins with a brief overview of performance metrics related to PLS and sensing, as well as the optimization techniques commonly utilized in the existing literature. A thorough examination of existing literature on PLS for ISAC is subsequently presented, with the objective of emphasizing the current state of research. The study concludes by outlining potential avenues for future research pertaining to secure ISAC systems.
30 January 2023 in IEEE Internet of Things Journal
In the age of Internet of Things (IoT), exploitation of security vulnerabilities is increasing, including self-propagating IoT malware. As an answer, specific research on IoT malware is being developed. Many studies use Markov chain models of malware propagation to predict the behavior of epidemics qualitatively and quantitatively. However, most studies approximate random propagation as a simple multiplicative term and no exact derivation of the Markov chain for random propagation was done so far. Moreover, systems of malware mitigation operating at the network level are rare and the majority of proposals focus on local networks like wireless sensor networks. In this article, we present a simple derivation of the exact Markov chain for random propagation of malware. Our model assumes a binomial form, compatible with binomial distributions in stochastic studies. To validate this derivation we implemented a stochastic simulation for the simplest compartmental epidemic model, susceptible–infected–susceptible (SIS). Predictions of the proposed Markov chain match simulation results with less than 0.2% error, well within stochastic variability and much smaller than the error of literature models. To complement our model of propagation, we developed and derived the Markov chain of a new system of malware mitigation, based on grouping random devices with identified infections during malware cleaning. Our mitigation system works at the network level and counteracts the vulnerability of mass deployment of IoT devices with aggressive but calculated mass disconnection. The system is able to artificially reduce $R_{0}$ (the basic reproduction number) below 1 and prevent malware taking over the network—all without changing the rate of detection.
This letter considers a data-driven approach to a secret key rate analysis of physical layer secret key generation based on mutual information neural estimator (MINE), which achieves the state-of-the-art estimation accuracy. Since MINE does not require any statistical knowledge of randomness sources, the proposed approach is applicable to any source model and even real data which cannot be fully expressed by a simple model. We first demonstrate by simulations that the proposed estimation provides good approximations to the theoretical secret key rate for a simple model, and then show that the achievable secret key rate highly depends on sources of randomness and employed channel estimation schemes for a realistic wireless channel model. As an application of our analysis, we present a method to train quantization through backpropagation that maximizes the estimated secret key rate.
The field of quantum technologies has garnered considerable interest and witnessed noteworthy progress in recent years. It is also anticipated that these technologies will continue to flourish and exert a considerable influence on society, i.e., a plethora of real-world problems that cannot be solved by classical algorithms are believed to benefit from the implementation of quantum algorithms. Meanwhile, as an alternative to cryptographic methods, physical layer security (PLS) has been extensively studied as a means to realize secure wireless communication that is resistant to attacks by both classical and quantum computers, i.e., quantum-safe. While the prevailing approach to PLS has been based on classical algorithms, this could potentially be accelerated by the application of quantum algorithms. This paper examines the potential applications of various quantum algorithms, including quantum annealing, hybrid quantum-classical algorithms, and quantum search algorithms, to the the PLS problems. In particular, we begin with a concise overview of their applications to physical layer techniques and then proceed to discuss their use in addressing the challenges of secret message transmission and secret key generation from wireless channels.
This paper considers the problem of balancing traceability and anonymity in designated verifier signatures (DVS), which are a kind of group-oriented signatures. That is, we propose claimable designated verifier signatures (CDVS), where a signer is able to claim that he/she indeed created a signature later. Ordinal DVS does not provide any traceability, which could indicate too strong anonymity. Thus, adding claimability, which can be seen as a sort of traceability, moderates anonymity. We demonstrate two generic constructions of CDVS from (i) ring signatures, (non-ring) signatures, pseudorandom function, and commitment scheme, and (ii) claimable ring signatures (by Park and Sealfon, CRYPTO’19).