基于Petri网的谓词加密方案设计
A Predicate Encryption Scheme Based on Petri.net
DOI: 10.12677/ORF.2021.112021, PDF,   
作者: 谢天皓：贵州大学公共大数据国家重点实验室(计算机科学与技术学院)，贵州 贵阳；彭长根：贵州大学公共大数据国家重点实验室(计算机科学与技术学院)，贵州 贵阳；贵州大学密码学与数据安全研究所，贵州 贵阳
关键词: 谓词加密；双线性对；Petri网；Predicate Encryption； Bilinear Pair； Petri.net
摘要: 现有的谓词加密方案有谓词组合动态转换、参数重用和确定性有限自动机等方法，针对他们在解密时对于解密权限的判断都需要大量的开销而效率不足的问题，基于Petri网提出了一种新的谓词加密方案，对比原有的有限状态自动机方案，可利用Petri网的可达性预测特点对申请者的解密权限进行预测，从而节省开销，提升运算速率。首先形式化定义了该方案，给出了对解密许可的定义；其次利用双线性对实现了Petri网方案的具体构造；最后给出了本方案的分析与正确性证明，并与有限状态机方案做了效率分析对比。
Abstract: The existing predicate encryption schemes include predicate combination dynamic conversion, parameter reuse and deterministic finite automata. They need a lot of cost to determine the decryption authority when decrypting, which may lead to congestion when a large number of users apply for decryption. Based on Petri.net a new predicate encryption scheme is proposed. Firstly, the scheme is formally defined and the decryption permission is defined. Secondly, it is implemented by bilinear pairing based on Petri.net. Finally, the analysis and correctness of the scheme are given. Compared with the traditional predicate encryption scheme, this scheme can make use of Petri.net. In order to save the cost and improve the operation speed, the reachability prediction feature of the applicant is used to predict the decryption authority of the applicant.
文章引用：谢天皓, 彭长根. 基于Petri网的谓词加密方案设计[J]. 运筹与模糊学, 2021, 11(2): 168-176. https://doi.org/10.12677/ORF.2021.112021

参考文献

[1] Hellmanme, D. (1976) New Directions in Cryptography. IEEE Transactions on Information Theory, 86, 644-654. [Google Scholar] [CrossRef] 
[2] Sahai, A. and Waters, B. (2005) Fuzzy Identity-Based Encryption. Advances in Cryptology: EUROCRYPT 2005, 3494, 457-473. [Google Scholar] [CrossRef] 
[3] Katz, J. and Sahai, A. (2007) Brent Waters: Predicate Encryption Supporting Disjunctions. IACR Cryptology ePrint Archive, 404.
[4] Ling, S., Nguyen, K., Wang, H.X. and Zhang, J.Y. (2019) Server-Aided Revocable Predicate Encryption: Formalization and Lattice-Based Instantiation. The Computer Journal, 62, 1849-1862. [Google Scholar] [CrossRef] 
[5] Yoshino, M., Kunihiro, N., Naganuma, K. and Sato, H. (2012) Sym-metric Inner-Product Predicate Encryption Based on Three Groups. ProvSec 2012: Provable Security, 7496, 215-234. [Google Scholar] [CrossRef] 
[6] Datta, P., Dutta, R. and Mukhopadhyay, S. (2019) Succinct Predicate and Online-Offline Multi-Input Inner Product Encryptions under Standard Static Assumptions. Journal of In-formation Security and Applications, 48, Article ID: 102353. [Google Scholar] [CrossRef] 
[7] Gay, R., Méaux, P. and Wee, H. (2015) Predicate Encryption for Multi-Dimensional Range Queries from Lattices. Public Key Cryptography, 35, 752-776. [Google Scholar] [CrossRef] 
[8] Katz, J., Maffei, M., Malavolta, G. and Schröder, D. (2017) Subset Predicate Encryption and Its Applications. CANS 2017: Cryptology and Network Securi-ty, 11261, 115-134. [Google Scholar] [CrossRef] 
[9] Datta, P., Okamoto, T. and Takashima, K. (2018) Adaptively Simulation-Secure Attribute-Hiding Predicate Encryption. Advances in Cryptology: ASIACRYPT 2018, 11273, 640-672. [Google Scholar] [CrossRef] 
[10] Attrapadung, N. (2019) Unbounded Dynam-ic Predicate Compositions in Attribute-Based Encryption. Advances in Cryptology: EUROCRYPT 2019, 11476, 34-67. [Google Scholar] [CrossRef] 

为你推荐