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 or , 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 or -size data in each authentication. In addition, the authentication needs the computation of or exponentiations. In this paper, an efficient blacklistable anonymous credential system with reputation is proposed. In our system, the data size of the authentication is . 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.

中文翻译：

---

使用基于配对的累加器，具有信誉的高效可列入黑名单的匿名凭证系统

作为没有任何TTP（受信任的第三方）的增强隐私的身份验证，已经提出了具有信誉的可列入黑名单的匿名证书系统。但是，以前的系统存在效率问题：身份验证数据大小为 要么 ，在哪里 大号 是信誉列表，并且 ķ 是指示最近的窗口的大小 ķ用户的认证。因此，先前的系统遭受 要么 每次身份验证中的数据大小。另外，认证需要计算 要么 取幂。本文提出了一种具有声誉的有效的可列入黑名单的匿名证书系统。在我们的系统中，身份验证的数据大小为 。此外，尽管认证中的计算成本取决于某些参数，但是与参数相关的成本仅是乘法而不是幂。与先前提出的具有恒定计算和通信成本的可列入黑名单的系统FARB相比，我们的系统具有以下优点：清除/兑现协议仅在每个间隔而不是每个会话中都必须执行。为了构建我们的系统，我们新引入了信誉累加器的概念，并提出了有效的构建方法。