Post-quantum hybrid security mechanism for MIMO systems

Qassim, Yousef; Magaña, Mario E.; Yavuz, Attila A.

doi:10.1109/iccnc.2017.7876212

Cited by 12 publications

(10 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some security functionalities such as primary authentication, access key management, identification, ciphering and generation of integrity protection keys should be reconsidered. These evaluation of these functionalities must also take into account the security of the air interface of cellular systems [29].…”

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

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

show abstract

“…[78] proposes a middle system to share sensitive industrial data; interestingly, it is compatible with the Inter-Planetary File System (IPFS) and Ethereum. [79]- [81] also propose independent postquantum schemes to secure existing blockchains in a postquantum era such as secure digital archiving. [63], [82] aim to secure decentralized commercial stores that have already deployed their main-nets such as Bitcoin [24].…”

Section: A: History Of Decentralized Storesmentioning

confidence: 99%

Origami Store: UC-Secure Foldable Datachains for the Quantum Era

Alupotha

Boyen

2021

IEEE Access

View full text Add to dashboard Cite

Traditional blockchains preserve everything, if verification is to avoid trusted third parties. The accumulation of outdated but undeletable data makes traditional blockchains non-scalable for practical applications. Stateless blockchains mitigate this problem via history deletion; however, existing stateless blockchains such as Mimblewimble are not quantum resistant as they rely on specific discrete-log-based cryptography to achieve history deletion. In this paper, we introduce the "Origami Store" (or O-store for short), as a general new approach to distributed data storage with a generic history deletion mechanism called "folding". O-store is built using a hash function and an arbitrary signature scheme. Since the signature scheme is decoupled from the framework, O-stores are compatible with any quantum-resistant signature scheme by design. More importantly, O-store only needs to preserve one signature and one verification key per account (or owner) for any number of transactions (or updates), thereby mitigating the inefficiency of large quantum-safe signatures and verification keys. We prove the security of the basic O-store using the framework of Universal Composability (UC); in particular, O-store's universal security is shown to hold for a generic consensus mechanism, to facilitate implementation from a wide range of decentralized consensus protocols. The Origami store is thus the first UC-secure efficient distributed data storage framework that supports plug-and-play consensus mechanisms for fully decentralized trustless operation. We demonstrate working implementations of Origami stores with three post-quantum signature libraries-qTESLA, Dilithium, and Picnic-to illustrate its scalability and practicality for real-world applications.

show abstract

“…One reason why the algorithms in [17] are sufficient for SPO334 is that the rows of G in (1) contain all 3 2 combinations of the three data symbols, where 3 2 represents the binomial coefficient 3 choose 2. With MPO468 however, r < 6 3 ; therefore, not all 6 3 combinations of the six data symbols appear in rows of G in (2). Thus a symbol permutation algorithm is required to provide these additional symbol combinations.…”

Section: A Symbol Permutationsmentioning

confidence: 99%

“…During this phase, it is desired for communication to begin; thus, a random seed is transmitted from BS to UE using a secret sharing method such as the post-quantum crosslayer key agreement scheme presented in [2]. Each entity performs modulo-2 addition, denoted by the ⊕ symbol in Fig.…”

Section: B Initializationmentioning

confidence: 99%

“…To better understand the message and cryptogram residue classes pertaining to STBC PLS schemes, we now examine these classes for the Alamouti STBC employing 16-QAM data symbols and only the STBCs from one of its two KRCs. For each message and cryptogram residue class, with k = 2 and M = 16, either u = 1 or u = 2 leading to n = [2] or n = [1 1], respectively; thus, for the Alamouti STBC, the repetition metric for all message and cryptogram residue classes is either f = 2 or f = 1. Note that 2 = k!…”

Section: F Residue Classes For the Alamouti Stbcmentioning

confidence: 99%

See 1 more Smart Citation

Physical Layer Security for Multiple-Input Multiple-Output Systems by Alternating Orthogonal Space-Time Block Codes

Romero

2020

IEEE Open J. Commun. Soc.

View full text Add to dashboard Cite

Algorithms are provided to build a large set of unique complex-valued orthogonal space-time block codes (STBCs) from a known or standard STBC. A physical layer security (PLS) scheme is proposed to take advantage of this set by alternating the STBC in use over a multiple-input single-output (MISO) or multiple-input multiple-output (MIMO) communications link between base station (BS) and user equipment (UE). A practical procedure is proposed and demonstrated to build individual STBCs from the set without use of a lookup table. The sufficient statistic is given and proven to allow for maximal ratio combining (MRC) by the intended receiver for all STBCs in the set. An algorithm is offered for the UE to update the MRC matrix in use as the STBC alternates. Definitions are provided for cryptograms, key residues (KRs), key residue classes (KRCs), and message and cryptogram residue classes pertaining to STBC PLS schemes. These definitions are used to present analysis of the information-theoretic security of the proposed PLS scheme to include message and key equivocation. Theoretical expected bit error rate (BER) for a passive eavesdropper is proven and plotted along with Monte Carlo simulations for confirmation. Discussion of different attack models is provided. Cost and attack complexity are compared between the proposed scheme and two related techniques from the literature.

show abstract

Post-quantum hybrid security mechanism for MIMO systems

Cited by 12 publications

References 12 publications

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

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

Origami Store: UC-Secure Foldable Datachains for the Quantum Era

Physical Layer Security for Multiple-Input Multiple-Output Systems by Alternating Orthogonal Space-Time Block Codes

Contact Info

Product

Resources

About