Functional Encryption for Threshold Functions (or Fuzzy IBE) from Lattices
Functional Encryption for Threshold Functions (or Fuzzy IBE) from Lattices
复制标题
DOI：
10.1007/978-3-642-30057-8_17
复制
发表时间：
2012-05
期刊：
影响因子：
--
通讯作者：
Shweta Agrawal;Xavier Boyen;V. Vaikuntanathan;Panagiotis Voulgaris;H. Wee
中科院分区：
文献类型：
--
作者：
Shweta Agrawal;Xavier Boyen;V. Vaikuntanathan;Panagiotis Voulgaris;H. Wee
基于格问题难度的密码体制因其在平均情况和最坏情况下的等价性、对量子密码分析的猜想抵抗力、易于实现和日益增长的实用性，以及最近作为构造高级函数的平台的潜在潜力，得到了广泛的重视。我们注意到，对于我们的参数，假设潜在的格问题(如GapSVP或SIVP)对于运行在次指数时间内的对手很难在超指数因子内逼近。我们给CPA和CCA提供了我们的构造的安全变体，对于属性的小宇宙和大宇宙。在标准模型中，我们的所有构造都是安全的，不会受到选择性身份攻击。我们的构造是通过观察秘密共享方案为了对模糊IBE有用而需要满足的某些特殊性质来实现的。讨论了实现基于格的属性加密(ABE)的一些障碍。
Cryptosystems based on the hardness of lattice problems have recently acquired much importance due to their average-case to worst-case equivalence, their conjectured resistance to quantum cryptanalysis, their ease of implementation and increasing practicality, and, lately, their promising potential as a platform for constructing advanced functionalities.In this work, we construct “Fuzzy” Identity Based Encryption from the hardness of the Learning With Errors (LWE) problem. We note that for our parameters, the underlying lattice problems (such as gapSVP or SIVP) are assumed to be hard to approximate within supexponential factors for adversaries running in subexponential time. We give CPA and CCA secure variants of our construction, for small and large universes of attributes. All our constructions are secure against selective-identity attacks in the standard model. Our construction is made possible by observing certain special properties that secret sharing schemes need to satisfy in order to be useful for Fuzzy IBE. We also discuss some obstacles towards realizing lattice-based attribute-based encryption (ABE).