A New Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

来源 :中国密码学会2014年密码算法学术会议 | 被引量 : 0次 | 上传用户:bkln81
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  Predicate encryption allows flexible fine-grained control over access to encrypted data and achieves attribute hiding.KSW [1] supporting inner product is the most expressive predicate encryption scheme currently with large amount of pre-process and huge expenses of storage.In our scheme,we propose a new predicate encryption which prepares the ciphertext C for each attribute values one by one,and later transforms to the ciphertexts C’ corresponding to different predicates.It can greatly reduce the pre-processing time and the storage from O(2n ) to O(n ) compared to KSW [1],where n is the total number of attribute values in one record of a table (In the enterprise development database,n is dozens or even hundreds).The security of our scheme is against chosen-plaintext attacks in the standard model.
其他文献
随着集成电路工艺尺寸下降到纳米级,负偏置温度不稳定性(NBTI)成为影响电路可靠性的首要老化效应.精确的老化预测模型是节省防护开销的重要前提.针对传统的反应扩散机制下阈
不精确的广义门电路可靠性映射到门级或高层应用时误差容易因规模效应等而被过度放大导致结果不可靠.本文选择了在门级电路可靠性精确评估中得到有效验证的PTM模型用以精确计
作为软件测试领域的一个基本问题和热点问题,面向路径的测试用例自动生成有着特殊的重要意义.面向路径的测试用例生成本质上是一个约束满足问题,并通过搜索算法求解.着眼于提升搜索算法的效率,本文提出了一种新的智能算法,将分支限界和爬山法进行了有机的整合,分支限界作为全局搜索算法,而爬山法作为局部搜索算法,发挥各自的优势来对测试用例的解空间进行搜索.
  Fully homomorphic encryption is faced with two problems now.One is candidate fully homomorphic encryption scheme is few.Another is that the efficiency of fu
会议
弱密钥泄漏攻击是由Akavia和Goldwasser于2009年在TCC上提出来的,它可以被认为是一种非自适应性的密钥泄漏攻击.由于在现实中大部分的密钥泄漏攻击都可以认为是弱密钥泄漏攻
  chosen ciphertext attack (CCA) security on the standard model is widely accepted as the standard security notion for the public key cryptosystem.The existin
  Mobile e-Health Network (MHN) is an emerging network across the entire range of functions involved in e-Health.It is important to establish secure channels
在基于LSSS(Linear Secret-Sharing Schemes)共享矩阵的属性密码方案中,为了获得相对较高的解密效率,需要剔除授权集合中冗余参与方在解密时的计算.为达到这一目的,现有方案
本文研究基于规则单向函数的伪随机产生器,并提出了以下构造:(1)在任意已知规则度的(输入长度为n比特的)ε困难的单向函数基础上,为众所周知的伪随机产生器构造给出了一个简
Trivium算法是欧洲序列密码工程eSTREAM的最终三个面向硬件的流密码算法之一。本文利用时空折衷的思想对Dinur和Shamir提出的Cube攻击进行改进,将改进方法应用于对初始化拍数