Semantically-Secure Functional Encryption: Possibility Results, Impossibility Results and the Quest for a General Definition
IACR Cryptology ePrint Archive(2013)
摘要
This paper explains that SS1-secure functional encryption (FE) as defined by Boneh, Sahai and Waters implicitly incorporates security under key-revealing selective opening attacks (SOA-K). This connection helps intuitively explain their impossibility results and also allows us to prove stronger ones. To fill this gap and move us closer to the (laudable) goal of a general and achievable notion of FE security, we seek and provide two \"sans SOA-K\" definitions of FE security that we call SS2 and SS3. We prove various possibility results about these definitions. We view our work as a first step towards the challenging goal of a general, meaningful and achievable notion of FE security.
更多查看译文
关键词
Random Oracle, Impossibility Result, Random Oracle Model, Auxiliary Input, Cryptology ePrint Archive
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络