Post-Quantum Security for Ultra-Reliable Low-Latency Heterogeneous Networks

D’Oliveira, Rafael G. L.; Cohen, Alejandro; Robinson, John; Stahlbuhk, Thomas; Médard, Muriel

doi:10.1109/milcom52596.2021.9653013

Cited by 12 publications

(5 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We detail those in Appendix A, and Sections V and VI, respectively. We note that the individual IND-CCA1 security proof can be readily applied to the settings in [2], [6]. We now provide a high level description of our proposed scheme.…”

Section: Joint Secure-reliable Coding Cryptosystem (Main Results)mentioning

confidence: 99%

“…Remark 1. The security guarantee in Theorem 2 can be readily applied to noise-less HUNCC in order to obtain individual IND-CCA1 security for the settings in [2], [6], for example.…”

Section: Joint Secure-reliable Coding Cryptosystem (Main Results)mentioning

confidence: 99%

“…The proposed cryptosystem is secure against a strong eavesdropper under a new security notion we introduce of Individual IND-CCA1. This notion of security can be readily applied to other HUNCC solutions offered in the literature with partial encryption [2], [6]. Finally, we present a joint decryption-decoding scheme that combines error correction using GRAND with decryption in an intermediate stage.…”

Section: Discussionmentioning

confidence: 97%

“…Second, against a strong Eve, we introduce a new stronger notion of security than the individual computational security proposed in [2], which we call individual indistinguishability under chosen ciphertext attack (Individual IND-CCA1). This stronger notion can also be readily applied to the settings in [2], [6]. Third, we provide a novel joint decryption-decoding scheme that combine error correction using an efficient Guessing Random Additive Noise Decoding (GRAND) [7], with decryption in an intermediate stage of GRAND decoding algorithm as illustrated in Figure 2.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Partial Encryption after Encoding for Security and Reliability in Data Systems

Cohen¹,

D’Oliveira²,

Duffy³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

We consider the problem of secure and reliable communication over a noisy multipath network. Previous work considering a noiseless version of our problem proposed a hybrid universal network coding cryptosystem (HUNCC). By combining an information-theoretically secure encoder together with partial encryption, HUNCC is able to obtain security guarantees, even in the presence of an all-observing eavesdropper. In this paper, we propose a version of HUNCC for noisy channels (N-HUNCC). This modification requires four main novelties. First, we present a network coding construction which is jointly, individually secure and error-correcting. Second, we introduce a new security definition which is a computational analogue of individual security, which we call individual indistinguishability under chosen ciphertext attack (individual IND-CCA1), and show that N-HUNCC satisfies it. Third, we present a noise based decoder for N-HUNCC, which permits the decoding of the encoded-thenencrypted data. Finally, we discuss how to select parameters for N-HUNCC and its error-correcting capabilities.

show abstract

Section: Joint Secure-reliable Coding Cryptosystem (Main Results)mentioning

confidence: 99%

“…Remark 1. The security guarantee in Theorem 2 can be readily applied to noise-less HUNCC in order to obtain individual IND-CCA1 security for the settings in [2], [6], for example.…”

Section: Joint Secure-reliable Coding Cryptosystem (Main Results)mentioning

confidence: 99%

Section: Discussionmentioning

confidence: 97%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Partial Encryption after Encoding for Security and Reliability in Data Systems

Cohen¹,

D’Oliveira²,

Duffy³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…that are evaluated based on the network use case. Use cases may involve the satellite networks, 5G communication systems or heterogeneous deployment scenarios [10]. A detailed functionality study with well reasoned choices such as the processor subsystem, Field-Programmable Gate Array (FPGA) model, power supply, possible operating system (OS) type, etc.…”

Section: -) Communicationmentioning

confidence: 99%

Recent Advances in Post-Quantum Cryptography for Networks: A Survey

Zeydan

Türk

Aksoy

et al. 2022

2022 Seventh International Conference on Mobile and Secure Services (MobiSecServ)

View full text Add to dashboard Cite

The development of quantum computers poses a new security threat to network infrastructures and services, as they will be powerful enough to break the most common forms of digital encryption. Existing encryption services based on Rivest-Shamir-Adleman (RSA), Diffie-Hellman (DH), Elliptic Curve Cryptography (ECC) and so on are vulnerable to attacks by quantum computers. Although the gap between today's quantum computers and the threats they pose to current public-key cryptography is large, the telecommunications landscape should begin planning for the transition to the post-quantum era as early as possible. In this paper, we examine recent advances in Post Quantum Cryptography (PQC) algorithms from the perspective of the networking and telecommunications industries. The efforts are categorized at three levels, namely communication, computation (consisting of design, implementation and Public Key System (PKS)), and network. Some of the existing challenges and future recommendations for securing communication networks in the post-quantum era are also listed at the end of the paper.

show abstract