Open AccessLeakage‐resilient message authentication code scheme based on hidden identity weak hash proof system
Author(s) -
Wang Bin
Publication year - 2016
Publication title -
iet information security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 34
eISSN - 1751-8717
pISSN - 1751-8709
DOI - 10.1049/iet-ifs.2014.0579
Subject(s) - computer science , hash function , message authentication code , modular exponentiation , leakage (economics) , merkle tree , hash chain , modular design , public key cryptography , theoretical computer science , distributed computing , computer network , cryptography , computer security , operating system , encryption , economics , macroeconomics
Hazay et al . initiated the formal study of leakage‐resilient message authentication code (MAC) and presented a MAC scheme that is both leakage resilient and unforgeable against chosen message and no verification query attack (uf‐cm‐nvq). As the communication overhead of their construction is linear with the parameters that control the leakage bound, their scheme sacrifices efficiency in exchange for leakage resilience. In this study, the authors study the problem of designing leakage‐resilient MACs in the public‐key setting with acceptable communication efficiency. In particular, a notion called ‘hidden identity weak hash proof system’(HID‐wHPS) is introduced. Then a generic MAC construction is presented under the abstraction framework of HID‐wHPS. Security properties guaranteed by HID‐wHPS enable us to prove the author's construction to be both leakage resilient and uf‐cm‐nvq in a modular way. Finally, performance analysis shows that their MAC construction yields improved tagging‐key size, tag size as well as computation overhead under the given leakage bound.