学习函数加密的奠基论文[1]——Functional Encryption: Definitions and Challenges。
摘要:本文对函数加密形式化的研究,开始于刻画其概念和安全性的精确定义。简单来说,函数加密支持一个受限的密钥(使得密钥持有者仅可以学习加密数据的一个特定函数),而不了解关于数据的任何其他信息。例如,给一个加密的程序,密钥可以使密钥持有者学习程序一个特定输入的输出,而不可以学习这个程序的任何信息。
我们所展示的函数加密的安全性定义是很有用的。首先,我们表明对一些函数加密来说,基于游戏的安全定义是不充分的,接着我们呈现了一个基于模拟的定义并说明在标准模型下该定义不能被满足,但是在随机谕言机模型下可以被满足。我们介绍了如何将许多现有的概念映射到函数加密的形式化概念,最后总结了这个新兴领域的一系列有意思的开放问题。
Abstract.We initiate the formal study of functional encryption by giving precise definitions of the concept and its security. Roughly speaking,functional encryp- tion supports restricted secret keys that enable a key holder to learn a specific function of encrypted databut learn nothing else about the data.For example. given an encrypted program the secret key may enable the key holder to learn the output of the program on a specific input without learning anything else about the program.
We show that defining security for functional encryption is non-trivial.First. we show that a natural game-based definition is inadequate for some function- alities. We then present a natural simulation-based definition and show that it (provably) cannot be satished in the standard model, but can be satished in the random oracle model.We show how to map many existing concepts to our for- malization of functional encryption and conclude with several interesting open problems in this young area.
1 引言
数学联邦政治世界观提示您:看后求收藏(同人小说网http://tongren.me),接着再看更方便。