基于直接匿名证明的k次属性认证方案

摘要

At present, the main drawbacks of existing k-times attribute-based authentication (abbreviated to k-TABA) schemes and related attribute-based authentication schemes are that the computation cost of the authentication process depends on the size of the access formula and none of these schemes considers the problems of member revocation and attribute update. A new k-TABA scheme was constructed based on the building blocks of direct anonymous attestation, set membership proof and ciphertext-policy attribute-based encryption. Moreover, in order to reduce user's calculation as much as possible, the underlying attribute-based encryption scheme was modified, and then the main decryption operations were outsourced by using the key binding technique of Green et al. The new scheme can be deployed on a trusted platform and support expressive authentication policies. In addition, it also satisfies several ideal properties, such as registration process verifiability, member revocation, attribute update, and so on. The significant performance advantage of the new scheme is that the computation overhead of the user in the authentication phase is constant.%当前,已有k次属性认证(简称k-TABA)方案以及相关属性认证方案的主要缺点是认证子协议的运算复杂度依赖于属性认证策略的规模,而且并未考虑成员废除和属性更新问题.基于直接匿名证明、集合成员身份证明和密文策略属性加密技术构造了新的k-TABA方案.为了进一步优化用户端运算效率,首先对底层属性加密方案进行修改,然后利用Green等的密钥绑定技术对解密过程进行外包.该方案不但可部署于可信平台,而且支持可表述性认证策略.此外,该方案满足多个理想性质,诸如注册过程可验证性、成员废除和属性更新等.该方案最显著的性能优势是用户在认证阶段的运算开销为常数.