An Efficient Blacklistable Anonymous Credential System with Reputation Using Pairing-Based Accumulator
An Efficient Blacklistable Anonymous Credential System with Reputation Using Pairing-Based Accumulator
复制标题
DOI：
10.1109/trustcom/bigdatase.2018.00158
复制
发表时间：
2018-08
期刊：
影响因子：
--
通讯作者：
T. Nakanishi;Takeshi Kanatani
中科院分区：
文献类型：
--
作者：
T. Nakanishi;Takeshi Kanatani
为了在没有可信第三方的情况下实现增强隐私的认证，人们提出了黑名单匿名证书系统。在传统的可列入黑名单的匿名凭证系统中，在用户行为不端一次之后，用户被列入黑名单。由于它过于苛刻而无法实际应用，人们提出了基于信誉的扩展的可黑名单匿名证书系统。在基于声誉的系统中，用户的每个行为都被给予分数。服务提供商发布会话ID和分数之间的对应关系的信誉列表。在认证中，用户可以匿名地证明他自己的分数的总和。然而，先前提出的系统具有效率问题：认证数据大小为O（|L|）或O（K），其中|L|是信誉列表L的大小，K是后续窗口的大小。在窗口类型的系统中，认证基于具有用户的最近K次认证的窗口。当过去的身份验证超出窗口范围时，身份验证的错误行为将被原谅。因此，K应该尽可能大。因此，以前的系统遭受O（|L|）或O（K）大小的数据。此外，在以前的系统中，认证需要O（|L|）或O（K）指数，这是沉重的。本文提出了一种有效的具有信誉的可黑名单匿名证书系统。在我们的系统中，身份验证的数据大小不依赖于参数，例如|L|且K为O（1）。此外，虽然认证中的计算成本取决于一些参数，但与参数相关的成本只是乘法而不是幂。为了构建我们的系统，我们新引入了信誉累加器的概念，并展示了一个有效的基于配对的构建。利用累加器构造了一个高效的具有信誉的可黑名单匿名证书系统。
To achieve the privacy-enhancing authentications without any TTP (Trusted Third Party), blacklistable anonymous credential systems have been proposed. In conventional blacklistable anonymous credential systems, a user is blacklisted after the user misbehaves once. Since it is too harsh to be of practical use, extended blacklistable anonymous credential systems based on reputation have been proposed. In the reputation-based system, each behavior of a user is given a score. The service provider publishes a reputation list of correspondences between session ID and the score. In the authentication, a user can anonymously prove the total of his own scores. However, the previously proposed systems have the efficiency problem: The authentication data size is O(|L|) or O(K), where |L| is the size of the reputation list L, and K is the size of the following window. In the window type of systems, the authentication is based on a window with most recent K authentications of the user. When a past authentication becomes outside the window, the misbehaving of the authentication is forgiven. Thus, K should be as large as possible. Therefore, the previous systems suffer from O(|L|) or O(K)-size data in each authentication. In addition, in the previous systems, the authentication needs the computation of O(|L|) or O(K) exponentiations, which is heavy. In this paper, an efficient blacklistable anonymous credential system with reputation is proposed. In our system, the data size of the authentication does not depend on parameters such as |L| and K, and is O(1). Furthermore, although the computational costs in the authentication depend on some parameters, the parameter-related costs are only multiplications instead of exponentiations. For constructing our system, we newly introduce the concept of an accumulator for reputation, and show an efficient pairing-based construction. Using the accumulator, we construct the efficient blacklistable anonymous credential system with reputation.