POLKA: Towards Leakage-Resistant Post-quantum CCA-Secure Public Key Encryption

Hoffmann, Clément; Libert, Benôıt; Momin, Charles; Peters, Thomas; Standaert, François‐Xavier

doi:10.1007/978-3-031-31368-4_5

Cited by 4 publications

(1 citation statement)

References 52 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…it raises a question whether "it is possible to design lattice-based schemes that are inherently resistant to SCA". While there is some initial work in this direction [146], there is still a lot of scope for improvement, in terms of performance for practical applications, and performing detailed SCA evaluation of these newer schemes.…”

Section: Chosen-ciphertext Attacks Using Valid Ciphertexts On Lattice...mentioning

confidence: 99%

Implementation attacks on post-quantum lattice-based cryptography

Ravi¹

View full text Add to dashboard Cite

His valuable insights has allowed me to grow both professionally as well as in my personal life. I would like to take this opportunity and thank him for the constant motivation and guidance, and the wonderful PhD journey! I would also like to express my sincere and heartfelt gratitude towards my co-supervisor Dr. Shivam Bhasin, Technological University, Singapore, who has been a pillar of support and more than just a supervisor throughout my entire PhD journey. I am eternally grateful to both of you, for having trusted me and providing me this opportunity to pursue my PhD with the fullest support, guidance and at the same time, with so much freedom.I would also like to specially thank Dr. Sujoy Sinha Roy, IAIK, TU Graz, Austria for all the guidance you have provided me throughout my PhD journey. My sincere thanks to the members of Thesis Advisory Committee for always providing me valuable suggestions. I would also like to thank all the co-authors of all the publications listed in this thesis, for their valuable contribution.And of course, I would like to thank my family (Amma, Appa, Aunty, Uncle) and especially my wife Shenbaga for being there for me. A special word of gratitude to my friends, Dhivya, Rachel, Salow and Bala for their support. P.S. Thank you GVM... Prasanna Ravi, May 2023 xi "In a way, these things are like gold nuggets that God left in the forest. If I'm walking along in the forest and I stubbed my toe on it, who's to say I deserve credit for

show abstract

Section: Chosen-ciphertext Attacks Using Valid Ciphertexts On Lattice...mentioning

confidence: 99%

Implementation attacks on post-quantum lattice-based cryptography

Ravi¹

View full text Add to dashboard Cite

show abstract

POLKA: Towards Leakage-Resistant Post-quantum CCA-Secure Public Key Encryption

Hoffmann

Libert

Momin

et al. 2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Learning with Physical Rounding for Linear and Quadratic Leakage Functions

Hoffmann

Méaux

Momin

et al. 2023

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Fresh re-keying is a countermeasure against side-channel analysis where an ephemeral key is derived from a long-term key using a public random value. Popular instances of such schemes rely on keyhomomorphic primitives, so that the re-keying process is easy to mask and the rest of the (e.g., block cipher) computations can run with cheaper countermeasures. The main requirement for these schemes to be secure is that the leakages of the ephemeral keys do not allow recovering the long-term key. The Learning with Physical Rounding (LWPR) problem formalizes this security in a practically-relevant model where the adversary can observe noise-free leakages. It can be viewed as a physical version of the Learning With Rounding (LWR) problem, where the rounding is performed by a leakage function and therefore does not have to be computed explicitly. In this paper, we first consolidate the intuition that LWPR cannot be secure in a serial implementation context without additional countermeasures (like shuffling), due to attacks exploiting worst-case leakages that can be mounted with practical data complexity. We then extend the understanding of LWPR in a parallel implementation setting. On the one hand, we generalize its robustness against cryptanalysis taking advantage of any (i.e., not only worst-case) leakage. A previous work claimed security in the specific context of a Hamming weight leakage function. We clarify necessary conditions to maintain this guarantee, based on the degree of the leakage function and the accuracy of its coefficients. On the other hand, we show that parallelism inherently provides good security against attacks exploiting worst-case leakages. We finally confirm the practical relevance of these findings by validating our assumptions experimentally for an exemplary implementation.

show abstract

POLKA: Towards Leakage-Resistant Post-quantum CCA-Secure Public Key Encryption

Cited by 4 publications

References 52 publications

Implementation attacks on post-quantum lattice-based cryptography

Implementation attacks on post-quantum lattice-based cryptography

POLKA: Towards Leakage-Resistant Post-quantum CCA-Secure Public Key Encryption

Learning with Physical Rounding for Linear and Quadratic Leakage Functions

Contact Info

Product

Resources

About