Physical Protection of Lattice-Based Cryptography

Khalid, Ayesha; Oder, Tobias; Valencia, F.A.; Neill, Maire O'; Güneysu, Tim; Regazzoni, Francesco

doi:10.1145/3194554.3194616

Cited by 14 publications

(10 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…PKI is fundamentally constructed based on modern algebraic number theory approaches, and their hardness of security assumptions has relied on computational security approaches. For instance, the hardness of the RSA algorithm is constructed based on an integer factorization problem, in which the cost and time of breaking it exceed the value and useful lifetime of encrypted data [17,18]. However, the recent advancement of quantum computing exploits the quantum mechanics theory to tackle mathematical problems traditionally intractable to solve by modern computers.…”

Section: Quantum-resistant Attribute-based Encryption Characteristics...mentioning

confidence: 99%

Attribute-Based Encryption in Securing Big Data from Post-Quantum Perspective: A Survey

2022

View full text Add to dashboard Cite

Attribute-based encryption (ABE) cryptography is widely known for its potential to solve the scalability issue of recent public key infrastructure (PKI). It provides a fine-grained access control system with high flexibility and efficiency by labeling the secret key and ciphertext with distinctive attributes. Due to its fine-grained features, the ABE scheme is a protection layer in securing users’ data and privacy in big data processing and analytics. However, quantum computing, new technology on the horizon that will transform the security and privacy environment, has begun to appear. Like the conventional ABE schemes, present cryptography is not excluded from the impacts of quantum technology as they are not made to be quantum-resistant. While most recent surveys generally touched on the generic features of attribute-based encryption schemes such as user revocation, scalability, flexibility, data confidentiality, and scope in pairing-based ABE schemes, this survey investigated quantum-resistant ABE schemes in securing big data. This survey reviews the challenges faced by the recent ABE cryptography in the post-quantum era and highlights its differences from the conventional pairing-based ABE schemes. Subsequently, we defined the criteria of an ideal quantum-resistant ABE scheme. Additionally, existing works on quantum-resistant ABE schemes are reviewed based on their algorithms design, security and functionalities. Lastly, we summarized quantum-resistant ABE schemes’ ongoing challenges and future works.

show abstract

Section: Quantum-resistant Attribute-based Encryption Characteristics...mentioning

confidence: 99%

Attribute-Based Encryption in Securing Big Data from Post-Quantum Perspective: A Survey

2022

View full text Add to dashboard Cite

show abstract

“…• Side channel analysis attacks for LBC are understudied: LBC constructions are relatively new and a comprehensive analysis of their resistance against physical attacks is of utmost importance before their widespread deployment [22]. There is a wealth of useful techniques to learn from traditional physical attack-resistant cryptographic designs used today but as new lattice-based designs emerge and the volume of their deployment increases, further new attacks will most likely surface and this will continue to be an important area of research going forward.…”

Section: Challenges -Looking Forwardmentioning

confidence: 99%

Lattice-based Cryptography for IoT in A Quantum World: Are We Ready?

Khalid

McCarthy

O’Neill

et al. 2019

2019 IEEE 8th International Workshop on Advances in Sensors and Interfaces (IWASI)

Self Cite

View full text Add to dashboard Cite

The impending realization of scalable quantum computers has led to active research in Post Quantum Cryptography (PQC). The challenge is harder for embedded IoT (edge) devices, due to their pervasive diffusion in today's world as well as their stricter resources (tight area and energy budgets). Amongst various classes of quantum-resistant cryptography schemes, Latticebased Cryptography (LBC) is emerging as one of the most viable, almost half of the 'survivors' of second round of the NIST's PQC competition are lattice-based in construction. This paper surveys the practicality of deployment of these schemes. In this context, the state-of-the-art LBC implementations on the constrained devices (including low-power FPGAs and embedded microprocessors), leading in terms of low-power footprint, small area, compact bandwidth requirements and high performance is fairly evaluated and bench-marked. The work concludes by identifying a suite of some favorite LBC schemes in terms of various IoT critical performance benchmarks .

show abstract

“…The lattice-based cryptography (LBC) schemes are resistant against the threat of quantum computers since the lattice based hard problems cannot be solved by a quantum algorithm till date [1]. Although LBC problems have proved to be mathematically secure, their naive implementations are studied to to be vulnerable against the side channel analysis (SCA) attacks due to their data dependent power/EM leakages [2]. Since the simple power analysis (SPA) attacks rely on the visual inspection of a single/few leakage traces and is far too simplistic to cater for noisy traces, more powerful attacks like differential power analysis (DPA), and correlation power analysis (CPA) are often used.…”

Section: Introductionmentioning

confidence: 99%

A Novel Combined Correlation Power Analysis (CPA) Attack on Schoolbook Polynomial Multiplication in Lattice-based Cryptosystems

Cui

Khalid

et al. 2022

2022 IEEE 35th International System-on-Chip Conference (SOCC)

Self Cite

View full text Add to dashboard Cite

The lattice-based cryptography problems are known to be secure against the quantum computing attacks, till date no known quantum algorithm is able to solve these hard problems in lattices. Their naive implementations on embedded devices are, however, vulnerable to side-channel analysis (SCA) attacks with full key recovery possible via power/EM leakage analysis. This work analyses and attacks the power side channel leakage in the baseline hardware architecture of schoolbook polynomial multiplication, that is an essential component of most of the lattice based cryptography implementations. We first undertake a horizontal correlation power analysis (HCPA) method, optimized to work independent of the precise attack location specification in the schoolbook polynomial multiplier power leakage profile. Inspite of the inherent difficulties in HCPA, the attack is extremely efficient; with an 99.90% accuracy of recovering any one sub secret-key using only a single trace. Next we undertake the vertical correlation power analysis (VCPA) attack on the schoolbook polynomial multiplier power leakage profile, that requires larger number of power traces to analyze the correlation. Finally, we propose a novel combined correlation power analysis (CCPA) method that combines the strengths of both the VCPA and the HCPA to further improve the attacking capability of HCPA. We report a complete secret key recovery with a 100% accuracy by using only 4 power traces.

show abstract

Physical Protection of Lattice-Based Cryptography

Cited by 14 publications

References 39 publications

Attribute-Based Encryption in Securing Big Data from Post-Quantum Perspective: A Survey

Attribute-Based Encryption in Securing Big Data from Post-Quantum Perspective: A Survey

Lattice-based Cryptography for IoT in A Quantum World: Are We Ready?

A Novel Combined Correlation Power Analysis (CPA) Attack on Schoolbook Polynomial Multiplication in Lattice-based Cryptosystems

Contact Info

Product

Resources

About