Light the Signal: Optimization of Signal Leakage Attacks Against LWE-Based Key Exchange

Qin, Yue; Ding, Ruoyu; Bindel, Nina; Pan, Yanbin; Ding, Jíntai

doi:10.1007/978-3-031-17140-6_33

Cited by 3 publications

(4 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The reusable key feature can make the constructed protocols vulnerable to SLA ( Bindel, Stebila & Veitch, 2021 ). An SLA can occur with the reuse of the keys in protocols that use an additional information-based reconciliation mechanism since the shared key and additional information can leak information about the secret key ( Qin et al, 2022 ).…”

Section: Preliminariesmentioning

confidence: 99%

“… Note 1 Note that it was stated that if a BiGISIS problem-based key-sharing idea uses a reconciliation solution without sending additional information, SLA cannot be applicable to the constructed scheme. For detailed security proofs, we refer to Bindel, Stebila & Veitch (2021) , Qin et al (2022) .…”

Section: Security Analysismentioning

confidence: 99%

“… Notes. *Total number of passes for all stages, ×, Multiplication; +, Addition; −, Subtraction; − −,No computation; − , Number of arithmetic operations used in key component calculation; ROM, Random Oracle Model) + : According to Bindel, Stebila & Veitch (2021) and Qin et al. (2022) , because of the used reconciliation, SLA is possible.…”

Section: Comparisonmentioning

confidence: 99%

“…In this approach, the idea of sending additional information about the key component was used to generate the shared key. In Bindel, Stebila & Veitch (2021) , Qin et al (2022) , it was stated that schemes that utilize additional information-based reconciliation will be vulnerable against SLA. Therefore, due to the selected structures, BiGISIS.PAKE is the first lattice-based PAKE resistant to SLA attacks with the anonymity and reusable key in the literature.…”

Section: Comparisonmentioning

confidence: 99%

See 3 more Smart Citations

A new lattice-based password authenticated key exchange scheme with anonymity and reusable key

Seyhan,

Akleylek

2024

PeerJ Computer Science

View full text Add to dashboard Cite

In this article, we propose a novel bilateral generalization inhomogenous short integer solution (BiGISIS)-based password-authenticated key exchange (PAKE) scheme for post-quantum era security. The hardness assumption of the constructed PAKE is based on newly proposed hard lattice problem, BiGISIS. The main aim of this article is to provide a solution for the post-quantum secure PAKE scheme, which is one of the open problems in the literature. The proposed PAKE is the first BiGISIS-based PAKE that satisfies anonymity and reusable key features. The bilateral-pasteurization (BiP) approach is used to obtain the reusable key, and anonymity is achieved thanks to the additional identity components and hash functions. The reusable key structure reduces the time in the key generation, and anonymity prevents illegal user login attempts. The security analysis is done by following the real-or-random (RoR) model assumptions. As a result of security examinations, perfect forward secrecy (PFS) and integrity are satisfied, and the resistance against eavesdropping, manipulation-based attack (MBA), hash function simulation, impersonation, signal leakage attack (SLA), man-in-the-middle (MitM), known-key security (KKS), and offline password dictionary attack (PDA) is captured. According to the comparison analysis, the proposed PAKE is the first SLA-resistant lattice-based PAKE with reusable key and anonymity properties.

show abstract

Section: Preliminariesmentioning

confidence: 99%