Quantum-Safe HIBE: Does It Cost a Latte?

被引:0
|
作者
Zhao, Raymond K. [1 ,2 ]
Mccarthy, Sarah [3 ]
Steinfeld, Ron [1 ]
Sakzad, Amin [1 ]
O'Neill, Maire [4 ]
机构
[1] Monash Univ, Fac Informat Technol, Clayton, Vic 3800, Australia
[2] CSIROs, Data61, Marsfield, NSW 2122, Australia
[3] Univ Waterloo, Inst Quantum Comp, Waterloo, ON N2L 3G1, Canada
[4] Queens Univ Belfast, Ctr Secure Informat Technol, Belfast BT3 9DT, North Ireland
基金
澳大利亚研究理事会;
关键词
Lattices; Cryptography; Standards; Matrix decomposition; Encryption; Quantum computing; Public key; Lattice-based cryptography; hierarchical identity-based encryption; advanced primitives; software design; post-quantum; IDENTITY-BASED ENCRYPTION; BONSAI TREES; DELEGATE;
D O I
10.1109/TIFS.2023.3347880
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The United Kingdom (UK) government is considering advanced primitives such as identity-based encryption (IBE) for adoption as they transition their public-safety communications network from TETRA to an LTE-based service. However, the current LTE standard relies on elliptic-curve-based IBE, which will be vulnerable to quantum computing attacks, expected within the next 20-30 years. Lattices can provide quantum-safe alternatives for IBE. These schemes have shown promising results in terms of practicality. To date, several IBE schemes over lattices have been proposed, but there has been little in the way of practical evaluation. This paper provides the first complete optimised practical implementation and benchmarking of Latte, a promising Hierarchical IBE (HIBE) scheme proposed by the UK National Cyber Security Centre (NCSC) in 2017 and endorsed by European Telecommunications Standards Institute (ETSI). We propose optimisations for the KeyGen, Delegate, Extract and Gaussian sampling components of Latte, to increase attack costs, reduce decryption key lengths by 2x-3x, ciphertext sizes by up to 33%, and improve speed. In addition, we conduct a precision analysis, bounding the Renyi divergence of the distribution of the real Gaussian sampling procedures from the ideal distribution in corroboration of our claimed security levels. Our resulting implementation of the Delegate function takes 0.4 seconds at 80-bit security level on a desktop machine at 4.2GHz, significantly faster than the order of minutes estimated in the ETSI technical report. Furthermore, our optimised Latte Encrypt/Decrypt implementation reaches speeds up to 9.7x faster than the ETSI implementation.
引用
收藏
页码:2680 / 2695
页数:16
相关论文
共 50 条
  • [1] The Quantum-Safe Revolution
    Faugere, Jean-Charles
    Perret, Ludovic
    INFORMATION SECURITY APPLICATIONS, WISA 2016, 2017, 10144 : 258 - 266
  • [2] Quantum-safe encryption
    Floeter, Rouven
    ABB Review, 2018, (03): : 62 - 63
  • [3] Quantum-Safe Internet of Things
    Chattopadhyay, Anupam
    Bhasin, Shivam
    Gueneysu, Tim
    Bhunia, Swarup
    IEEE DESIGN & TEST, 2024, 41 (05) : 36 - 45
  • [4] Quantum-safe Trust for Vehicles
    Gardiner, Michael
    Truskovsky, Alexander
    Neville-Neil, George
    Mashatan, Atefeh
    Queue, 2021, 19 (02): : 93 - 115
  • [5] Realizing quantum-safe information sharing: Implementation and adoption challenges and policy recommendations for quantum-safe transitions
    Kong, Ini
    Janssen, Marijn
    Bharosa, Nitesh
    GOVERNMENT INFORMATION QUARTERLY, 2024, 41 (01)
  • [6] QSOR: Quantum-safe Onion Routing
    Tujner, Zsolt
    Rooijakkers, Thomas
    van Heesch, Maran
    Onen, Melek
    PROCEEDINGS OF THE 17TH INTERNATIONAL JOINT CONFERENCE ON E-BUSINESS AND TELECOMMUNICATIONS (SECRYPT), VOL 1, 2020, : 618 - 624
  • [7] Quantum-Safe Account Recovery for WebAuthn
    Stebila, Douglas
    Wilson, Spencer
    PROCEEDINGS OF THE 19TH ACM ASIA CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, ACM ASIACCS 2024, 2024, : 1814 - 1830
  • [8] Quantum-safe global encryption policy
    Zornetta, Alessia
    INTERNATIONAL JOURNAL OF LAW AND INFORMATION TECHNOLOGY, 2024, 32 (01):
  • [10] Quantum-Safe Blockchain in Hyperledger Fabric
    Abbas, Shahroz
    Sultana, Ajmery
    Kaddoum, Georges
    IEEE Networking Letters, 2025, 7 (01): : 61 - 65