Skip to main content

A Novel Post-quantum Piekert’s Reconciliation-Based Forward Secure Authentication Key Agreement for Mobile Devices

  • Conference paper
  • First Online:
Communication and Intelligent Systems (ICCIS 2022)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 686))

Included in the following conference series:

  • 299 Accesses

Abstract

Lattice-based cryptography plays a very important role in authentication and key exchanges that protects against the threat of quantum attacks. However, it is not easy to design quantum resistant password-based protocol due to the high demand for security requirements and the limited resources nature of mobile devices. In this article, we have proposed a novel post-quantum key exchange based on a variant of lattice assumption, the ring learning errors. This protocol uses better unbiased Piekert’s reconciliation with respect to even q, but reconciliation in Ding’s protocol is biased. This protocol ensures both authentication and key agreement. This protocol needs just two messages in exchange for authentication and key agreement. This protocol ensures both security against quantum attacks and efficiency due to simple algebraic operations that are polynomial addition and multiplications.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ajtai M (1996) Generating hard instances of lattice problems. In: Proceedings of the twenty-eighth annual ACM symposium on theory of computing. ACM, pp 99–108

    Google Scholar 

  2. Ajtai M (1999) Generating hard instances of the short basis problem. In: International colloquium on automata, languages, and programming. Springer, Berlin, pp 1–9

    Google Scholar 

  3. Ajtai M, Dwork C (1997) A public-key cryptosystem with worst-case/average-case equivalence. In: Proceedings of the twenty-ninth annual ACM symposium on theory of computing. ACM, pp 284–293

    Google Scholar 

  4. Dabra V, Bala A, Kumari S (2020) LBA-PAKE: lattice-based anonymous password authenticated key exchange for mobile devices. IEEE Syst J 15(4):5067–5077

    Google Scholar 

  5. Dharminder D, Prabhu Chandran K (2020) LWESM: learning with error based secure communication in mobile devices using fuzzy extractor. J Ambient Intell Humanized Comput 11(10):4089–4100

    Google Scholar 

  6. Ding J, Alsayigh S, Lancrenon J, Saraswathy RV, Snook M (2017) Provably secure password authenticated key exchange based on RLWE for the post-quantum world. In: Cryptographers’ track at the RSA conference. Springer, Berlin, pp 183–204

    Google Scholar 

  7. Ding J, Alsayigh S, Saraswathy RV, Fluhrer S, Lin X (2017) Leakage of signal function with reused keys in RLWE key exchange. In: 2017 IEEE international conference on communications (ICC). IEEE, pp 1–6

    Google Scholar 

  8. Ding J, Fluhrer S, Rv S (2018) Complete attack on RLWE key exchange with reused keys, without signal leakage. In: Australasian conference on information security and privacy. Springer, Berlin, pp 467–486

    Google Scholar 

  9. Feng Q, He D, Zeadally S, Kumar N, Liang K (2018) Ideal lattice-based anonymous authentication protocol for mobile devices. IEEE Syst J 13(3):2775–2785

    Google Scholar 

  10. Fluhrer S (2016) Cryptanalysis of ring-LWE based key exchange with key share reuse. Cryptology ePrint Archive

    Google Scholar 

  11. Kirkwood D, Lackey BC, McVey J, Motley M, Solinas JA, Tuller D (2015) Failure is not an option: standardization issues for post-quantum key agreement. In: Workshop on cybersecurity in a post-quantum world, p 21

    Google Scholar 

  12. Kitaev AY (1995) Quantum measurements and the abelian stabilizer problem. arXiv preprint quant-ph/9511026

    Google Scholar 

  13. Lyubashevsky V, Peikert C, Regev O (2010) On ideal lattices and learning with errors over rings. In: Annual international conference on the theory and applications of cryptographic techniques. Springer, Berlin, pp 1–23

    Google Scholar 

  14. Peikert C (2014) Lattice cryptography for the internet. In: International workshop on post-quantum cryptography. Springer, Berlin, pp 197–219

    Google Scholar 

  15. Proos J, Zalka C (2003) Shor’s discrete logarithm quantum algorithm for elliptic curves. arXiv preprint quant-ph/0301141

    Google Scholar 

  16. Regev O (2006) Lattice-based cryptography. In: Annual international cryptology conference. Springer, Berlin, pp 131–141

    Google Scholar 

  17. Shor PW (1999) Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev 41(2):303–332

    Google Scholar 

  18. Wang Q, Wang D, Cheng C, He D (2021) Quantum2fa: efficient quantum-resistant two-factor authentication scheme for mobile devices. IEEE Trans Dependable Secure Comput

    Google Scholar 

  19. Zhang J, Zhang Z, Ding J, Snook M, Dagdelen Ö (2015) Authenticated key exchange from ideal lattices. In: Annual international conference on the theory and applications of cryptographic techniques. Springer, Berlin, pp 719–751

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chaudhary Dharminder .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dharminder, C., Anushaa, S.S., Naundhini, S., Durgarao, M.S.P. (2023). A Novel Post-quantum Piekert’s Reconciliation-Based Forward Secure Authentication Key Agreement for Mobile Devices. In: Sharma, H., Shrivastava, V., Bharti, K.K., Wang, L. (eds) Communication and Intelligent Systems. ICCIS 2022. Lecture Notes in Networks and Systems, vol 686. Springer, Singapore. https://doi.org/10.1007/978-981-99-2100-3_9

Download citation

Publish with us

Policies and ethics