The Local Forking Lemma and Its Application to Deterministic Encryption

Author(s):  
Mihir Bellare ◽  
Wei Dai ◽  
Lucy Li
Sensors ◽  
2019 ◽  
Vol 19 (19) ◽  
pp. 4239 ◽  
Author(s):  
Shu ◽  
Chen ◽  
Xie ◽  
Sun ◽  
Qi ◽  
...  

With the rapid development of the Internet of Things (IoT), it becomes challenging to ensure its security. Identity authentication and integrity verification can be achieved by secure hash functions and digital signature algorithms for IoT applications. In order to solve the issues of bandwidth limitation and computational efficiency of secure communication in IoT applications, an aggregate signature scheme based on multi- trapdoor hash function is proposed in this paper. Firstly, to prevent key exposition, based on the elliptic curve discrete logarithm problem (ECDLP), we constructed a double trapdoor hash function (DTH) and proved its reliability. Secondly, the multi-trapdoor hash function (MTH) based on DTH is presented. Finally, an MTH-based aggregate signature scheme (MTH-AS) with constant signature length is proposed. Based on the assumption of ECDLP, the proposed scheme is proven unforgeable against adaptive chosen message attacks with the Forking Lemma. Different from the most signature schemes with bilinear mapping, the proposed scheme has higher computational efficiency and shorter aggregate signature length. Moreover, it is independent of the number of signers. Security analysis and performance evaluation has revealed that the proposed scheme is an ideal solution for secure IoT applications with limited computing power, storage capacity, or limited bandwidth, such as wireless sensor networks, vehicular ad hoc networks, or healthcare sensor networks.


2020 ◽  
Vol 154 ◽  
pp. 105865
Author(s):  
Meijuan Huang ◽  
Bo Yang ◽  
Yi Zhao ◽  
Xin Wang ◽  
Yanwei Zhou ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document