.png){kind=icon}
返回
An Efficient Predicate Encryption with Constant Pairing Computations and Minimum Costs
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2016.2526000.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Predicate encryption is a public-key encryption that supports attribute-hiding as well as payload-hiding and achieves high flexibility in terms of access control. Since Katz, Sahai, and Waters first proposed the predicate encryption scheme in 2008, several predicate encryption schemes have been published. Unfortunately these are impractical as they require O(n) pairing computations for decryption with considerably large sized public parameters, secret key, and ciphertext, where n is the dimension of the attribute/predicate vectors. In this paper, we propose a very efficient predicate encryption scheme that requires only n exponentiation plus three pairing computations for decryption with shorter sized public parameters, secret key, and ciphertext. The proposed scheme is proven selective attribute-secure against chosen-plaintext attacks in the standard model under the Asymmetric Decisional Bilinear Diffie-Hellman assumptions.
Keyword:
Predicate encryption
inner product encryption
payload
hiding
attribute-hiding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏
查看更多内容