Policy-based Signatures for Predicates
Policy-based Signatures for Predicates
复制标题
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Fei Tang;You-sheng Zhou
中科院分区：
文献类型：
--
作者：
Fei Tang;You-sheng Zhou
Bellare和Fuchsbauer引入的基于策略的签名（policy -based Signatures， PBS）使签名者能够签署符合某些策略的消息，同时保持策略的隐私性。Bellare等人用任何NP语言定义了该策略。在NP语言的PBS方案中，策略检查和签名算法应该有一个有效的见证。在这项工作中，我们考虑了P语言的PBS情况，这是NP语言的一种特殊情况。在P语言的PBS方案中，可以在没有证人的情况下直接运行策略检查和签名算法。我们将策略设置为一些布尔谓词，并为谓词及其安全性定义PBS的概念。接下来，对于一类被描述为（一维）范围的重要策略谓词（即前缀谓词），我们设计了一种基于树签名的PBS方案，并分析了其在一些实际场景中的应用。此外，基于多线性映射，我们设计了三种更复杂的PBS方案，分别是位固定谓词、左/右谓词和电路谓词。
Policy-based Signatures (PBS), which were introduced by Bellare and Fuchsbauer, enable signers to sign messages that conform to some policy, yet privacy of the policy is maintained. Bellare et al. defined the policy in any NP language. In PBS schemes for NP language, one should have a valid witness for the policy checking and signing algorithms. In this work, we consider the case of PBS for P language which is a special case of NP language. In PBS schemes for P language, one can directly run the policy checking and signing algorithms without witness. We set policies as some boolean predicates and define the notion of PBS for predicates and its security. Next, for an important class of policy predicates described as (1-dimensional) ranges (i.e., prefix predicate), we design a PBS scheme for such predicate based on tree-based signatures and analyze its application in some real-world scenarios. In addition, based on multilinear maps, we design three PBS schemes for more complex predicates, bit-fixing predicate, left/right predicate, and circuits predicate, respectively.