Provably secure attribute-based authenticated encryption with keyword search from ideal lattices  

作　　者：Lisha YAO Lin HOU Jian WENG Feixiang ZHAO 

机构地区：[1]College of Cyber Security,Jinan University,Guangzhou 510632,China

出　　处：《Science China(Information Sciences)》2024年第1期304-305,共2页中国科学（信息科学）（英文版）

基　　金：supported by National Key Research and Development Plan of China(Grant No.2020YFB1005600);Major Program of Guangdong Basic and Applied Research Project(Grant No.2019B030302008);National Natural Science Foundation of China(Grant No.61825203);Guangdong Provincial Science and Technology Project(Grant Nos.2017B010111005,2021A0505030033);National Joint Engineering Research Center of Network Security Detection and Protection Technology;Guangdong Key Laboratory of Data Security and Privacy Preserving。

摘　　要：A public-key authenticated encryption with keyword search(PAEKS)[1,2]system overcomes the problem of an inside adversary forging searchable ciphertexts and guessing the keyword information from the given token.This system allows the sender to encrypt and authenticate a keyword.However,traditional PAEKS schemes require the sender to specify the intended receiver in advance,losing much flexibility.

关 键 词：authentic OVERCOME TOKEN 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]