Tiny keys hold big secrets: On efficiency of Pairing-Based Cryptography in IoT

被引:0
作者
Perazzo, Pericle [1 ]
Vallati, Carlo [1 ]
机构
[1] Univ Pisa, Dept Informat Engn, Largo Lucio Lazzarino 1, I-56122 Pisa, Italy
关键词
Pairing-based cryptography; Internet of things; Short signature; Identity-based encryption; Attribute-based encryption; Zolertia RE-mote; ATTRIBUTE-BASED ENCRYPTION; PERFORMANCE EVALUATION;
D O I
10.1016/j.iot.2025.101489
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Pairing-Based Cryptography (PBC) is a sub-field of elliptic curve cryptography that has been used to design ingenious security protocols including Short Signatures (SS), Identity-Based Encryption (IBE), and Attribute-Based Encryption (ABE). These protocols have extremely promising applications in diverse scenarios, including Internet of Things (IoT), which usually involves computing devices with limited processing, memory, and energy capabilities. Many studies the literature evaluated the performance of PBC on typical IoT devices, giving promising results, and showing that a large class of constrained devices can run PBC schemes. However, in the last years, new advancements in Number Field Sieve algorithms threatened the security of PBC, that all protocols must be re-parametrized with larger keys to maintain the same security level as before. Therefore, past literature reporting PBC performance on IoT devices must be redone because optimistic, and it is not clear whether present IoT devices will bear PBC. In this paper we evaluate the performance of some prominent PBC schemes on a very constrained device, namely the Zolertia RE-Mote platform, which is equipped with an ARM Cortex-M3 processor. From our experiments, the usage of IBE and SS schemes is still possible on IoT devices, but the security level is limited to 80 or 100 bits. Reaching greater security levels leads to higher execution times, which might not be compatible with many IoT applications. The usage ABE is efficient only with IoT-oriented schemes, which offer good performance at the cost of limited policy expressiveness.
引用
收藏
页数:19
相关论文
共 36 条
  • [1] ON THE FEASIBILITY OF ATTRIBUTE-BASED ENCRYPTION ON INTERNET OF THINGS DEVICES
    Ambrosin, Moreno
    Anzanpour, Arman
    Conti, Mauro
    Dargahi, Tooska
    Moosavi, Sanaz Rahimi
    Rahmani, Amir M.
    Liljeberg, Pasi
    [J]. IEEE MICRO, 2016, 36 (06) : 25 - 35
  • [2] [Anonymous], 2024, MQTT wikipedia page
  • [3] [Anonymous], 2010, Tech. Rep.
  • [4] [Anonymous], 2024, Zolertia RE-Mote platform
  • [5] Aranha D.F., RELIC is an Efficient LIbrary for Cryptography
  • [6] Barbulescu R., 2020, A taxonomy of pairings, their security, their complexity
  • [7] Updating Key Size Estimations for Pairings
    Barbulescu, Razvan
    Duquesne, Sylvain
    [J]. JOURNAL OF CRYPTOLOGY, 2019, 32 (04) : 1298 - 1336
  • [8] Barker E., 2020, Nist special publication 800-57 part 1 revision 5- recommendation for key management., DOI DOI 10.6028/NIST.SP.800-57PT1R5
  • [9] Barreto PSLM, 2006, LECT NOTES COMPUT SC, V3897, P319
  • [10] Barreto PSLM, 2003, LECT NOTES COMPUT SC, V2576, P257