Predicate encryption against master-key tampering attacks  

作　　者：Yuejun Liu Rui Zhang Yongbin Zhou 

机构地区：[1]State Key Laboratory of Information Security,Institute of Information Engineering,Chinese Academy of Sciences,Beijing 100093,China [2]School of Cyber Security,University of Chinese Academy of Sciences,Beijing 100049,China

出　　处：《Cybersecurity》2018年第1期632-651,共20页网络空间安全科学与技术（英文）

基　　金：supported in part by National Natural Science Foundation of China(No.61632020,61472416,61772520);National key research and development program of China(No.2017YFB0802705);Key Research Project of Zhejiang Province(No.2017C01062);Fundamental Theory and Cutting-edge Technology Research Program of Institute of Information Engineering,CAS(No.Y7Z0321102).

摘　　要：Many real world attacks often target the implementation of a cryptographic scheme,rather than the algorithm itself,and a system designer has to consider new models that can capture these attacks.For example,if the key can be tampered by physical attacks on the device,the security of the scheme becomes totally unclear.In this work,we investigate predicate encryption(PE),a powerful encryption primitive,in the setting of tampering attacks.First,we show that many existing frameworks to construct PE are vulnerable to tampering attacks.Then we present a new security notion to capture such attacks.Finally,we take Attrapadung’s framework in Eurocrypt’14 as an example to show how to“compile"these frameworks to tampering resilient ones.Moreover,our method is compatible with the original pair encoding schemes without introducing any redundancy.

关 键 词：Tampering resilience Predicate encryption Pair encoding Dual system encryption 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]