Efficient blacklistable anonymous credential system with reputation using a pairing-based accumulator
Efficient blacklistable anonymous credential system with reputation using a pairing-based accumulator
复制标题
DOI：
10.1049/iet-ifs.2018.5505
复制
发表时间：
2020-03
期刊：
影响因子：
--
通讯作者：
Toru Nakanishi;Takeshi Kanatani
中科院分区：
文献类型：
--
作者：
Toru Nakanishi;Takeshi Kanatani
作为一种不需要可信第三方（TTP）的隐私增强认证，人们提出了具有信誉的可列入黑名单的匿名证书系统。然而，以前的系统存在效率问题：认证数据大小为O（L）或O（K），其中L是信誉列表，K是指示用户最近K次认证的窗口的大小。因此，以前的系统在每次认证中遭受O（L）或O（K）大小的数据。此外，认证需要O（L）或O（K）的幂运算。本文提出了一种有效的具有信誉的可黑名单匿名证书系统。在我们的系统中，认证的数据大小是O（1）。此外，虽然认证中的计算成本取决于一些参数，但与参数相关的成本只是乘法而不是幂。与以前提出的具有恒定计算和通信成本的黑名单系统FARB相比，我们的系统具有的优点是，清除/赎回协议只需要在每个间隔而不是每个会话中执行。为了构建我们的系统，我们新引入了信誉累加器的概念，并提出了一个有效的建设。
: As privacy-enhancing authentications without any TTP (Trusted Third Party), blacklistable anonymous credential systems with reputation have been proposed. However, the previous systems have the efficiency problem: The authentication data size is O ( L ) or O ( K ) , where L is the reputation list, and K is the size of a window indicating the most recent K authentications of the user. Therefore, the previous systems suffer from O ( L ) or O ( K ) -size data in each authentication. In addition, the authentication needs the computation of O ( L ) or O ( K ) exponentiations. In this paper, an efficient blacklistable anonymous credential system with reputation is proposed. In our system, the data size of the authentication 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. Compared to the previously proposed blacklistable system FARB with the constant computational and communication costs, our system has the advantage that the clear/redeem protocol only has to be executed every interval instead of every session. For constructing our system, we newly introduce the concept of an accumulator for reputation, and propose an efficient construction.