This study constructs a function-private inner-product predicate encryption(FP-IPPE)and achieves standard enhanced function privacy.The enhanced function privacy guarantees that a predicate secret key skf reveals noth...This study constructs a function-private inner-product predicate encryption(FP-IPPE)and achieves standard enhanced function privacy.The enhanced function privacy guarantees that a predicate secret key skf reveals nothing about the predicate f,as long as f is drawn from an evasive distribution with sufficient entropy.The proposed scheme extends the group-based public-key function-private predicate encryption(FP-PE)for“small superset predicates”proposed by Bartusek et al.(Asiacrypt 19),to the setting of inner-product predicates.This is the first construction of public-key FP-PE with enhanced function privacy security beyond the equality predicates,which is previously proposed by Boneh et al.(CRYPTO 13).The proposed construction relies on bilinear groups,and the security is proved in the generic bilinear group model.展开更多
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...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.展开更多
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...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.展开更多
Wildcard searchable encryption allows the server to efficiently perform wildcard-based keyword searches over encrypted data while maintaining data privacy.A promising solution to achieve wildcard SSE is to extract the...Wildcard searchable encryption allows the server to efficiently perform wildcard-based keyword searches over encrypted data while maintaining data privacy.A promising solution to achieve wildcard SSE is to extract the characteristics of the queried keyword and check the existence based on a membership test structure.However,existing schemes have false positives of character order,that is,the server cannot identify the order between the first and the last wildcard character.Besides,the schemes also suffer from characteristic matching pattern leakage due to the one-by-one membership testing.In this paper,we present the first efficient wildcard SSE scheme to eliminate the false positives of character order and characteristic matching pattern leakage.To this end,we design a novel characteristic extraction technique that enables the client to exact the characteristics of the queried keyword maintaining the order between the first and the last wildcard character.Then,we utilize the primitive of Symmetric Subset Predicate Encryption,which supports checking if one set is a subset of another in one shot to reduce the characteristic matching pattern leakage.Finally,by performing a formal security analysis and implementing the scheme on a real-world database,we demonstrate that the desired security properties are achieved with high performance.展开更多
基金National Key Research and Development Program of China(2021YFB3101402)National Natural Science Foundation of China(62202294)。
文摘This study constructs a function-private inner-product predicate encryption(FP-IPPE)and achieves standard enhanced function privacy.The enhanced function privacy guarantees that a predicate secret key skf reveals nothing about the predicate f,as long as f is drawn from an evasive distribution with sufficient entropy.The proposed scheme extends the group-based public-key function-private predicate encryption(FP-PE)for“small superset predicates”proposed by Bartusek et al.(Asiacrypt 19),to the setting of inner-product predicates.This is the first construction of public-key FP-PE with enhanced function privacy security beyond the equality predicates,which is previously proposed by Boneh et al.(CRYPTO 13).The proposed construction relies on bilinear groups,and the security is proved in the generic bilinear group model.
基金This work was supported in part by National Natural Science Foundation of China(No.61632020,61472416,61772520)National key research and development program of China(No.2017YFB0802705)+1 种基金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.
基金supported in part by National Natural Science Foundation of China(No.61632020,61472416,61772520)National key research and development program of China(No.2017YFB0802705)+1 种基金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.
基金supported by the National Cryptologic Science Fund of China(2025NCSF02025)National Natural Science Foundation of China(U24B20149,62272385,U23A20302,62311540156 and 62102313)+1 种基金the Key Research and Development Program of Shaanxi(2024GX-ZDCYL-01-09,2022KWZ-01)Major Program of Shandong Provincial Natural Science Foundation for the Fundamental Research(ZR2022ZD03).
文摘Wildcard searchable encryption allows the server to efficiently perform wildcard-based keyword searches over encrypted data while maintaining data privacy.A promising solution to achieve wildcard SSE is to extract the characteristics of the queried keyword and check the existence based on a membership test structure.However,existing schemes have false positives of character order,that is,the server cannot identify the order between the first and the last wildcard character.Besides,the schemes also suffer from characteristic matching pattern leakage due to the one-by-one membership testing.In this paper,we present the first efficient wildcard SSE scheme to eliminate the false positives of character order and characteristic matching pattern leakage.To this end,we design a novel characteristic extraction technique that enables the client to exact the characteristics of the queried keyword maintaining the order between the first and the last wildcard character.Then,we utilize the primitive of Symmetric Subset Predicate Encryption,which supports checking if one set is a subset of another in one shot to reduce the characteristic matching pattern leakage.Finally,by performing a formal security analysis and implementing the scheme on a real-world database,we demonstrate that the desired security properties are achieved with high performance.
