基于Petri网的谓词加密方案设计

A Predicate Encryption Scheme Based on Petri.net

现有的谓词加密方案有谓词组合动态转换、参数重用和确定性有限自动机等方法,针对他们在解密时对于解密权限的判断都需要大量的开销而效率不足的问题,基于Petri网提出了一种新的谓词加密方案,对比原有的有限状态自动机方案,可利用Petri网的可达性预测特点对申请者的解密权限进行预测,从而节省开销,提升运算速率。首先形式化定义了该方案,给出了对解密许可的定义;其次利用双线性对实现了Petri网方案的具体构造;最后给出了本方案的分析与正确性证明,并与有限状态机方案做了效率分析对比。

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.