Paper Info
Title
Related-key secure key encapsulation from extended computational bilinear Diffie-Hellman.
Abstract
As a special type of fault injection attacks, Related-Key Attacks (RKAs) allow an adversary to manipulate a cryptographic key and subsequently observe the outcomes of the cryptographic scheme under these modified keys. In the real life, related-key attacks are already practical enough to be implemented on cryptographic devices. To avoid cryptographic devices suffering from related-key attacks, it is necessary to design a cryptographic scheme that resists against such attacks. This paper proposes an efficient RKA-secure Key Encapsulation Mechanism (KEM), in which the adversary can modify the secret key sk to any value f(sk), as long as, f is a polynomial function of a bounded degree d. Especially, the polynomial-RKA security can be reduced to a hard search problem, namely d-extended computational Bilinear Diffie-Hellman (BDH) problem, in the standard model. Our construction essentially refines the security of Haralambiev etal.s BDH-based KEM scheme from chosen-ciphertext security to related-key security. The main technique applied in our scheme is the re-computation of the public key in the decryption algorithm so that any (non-trivial) modification to the secret key can be detected.
Year
DOI
Venue
2017
10.1016/j.ins.2017.04.018
Inf. Sci.
Keywords
Field
DocType
Key-encapsulation mechanism,Related-key attacks,BDH
Key exchange,Cryptographic protocol,Computer security,Theoretical computer science,Artificial intelligence,Public-key cryptography,Cryptographic key types,Key distribution,Key management,Key encapsulation,Cryptographic primitive,Machine learning,Mathematics
Journal
Volume
Issue
ISSN
406
C
0020-0255
Citations 
PageRank 
References 
0
0.34
24
Authors
5
Name
Order
Citations
PageRank
Baodong Qin119019.40
Shengli Liu2916.98
Shifeng Sun35915.53
R.H Deng44423362.82
Dawu Gu5644103.50