Efficient blacklistable anonymous credential system with reputation using a pairing-based accumulator

扫码查看

原文链接

NETL
NSTL
Inst Engineering Technology-Iet

外文摘要：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(vertical bar L vertical bar) or O(K)-size data in each authentication. In addition, the authentication needs the computation of O(vertical bar L vertical bar) 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.

外文关键词：

cryptographic protocolsK authenticationsefficient blacklistable anonymous credential systemblacklistable system FARBprivacy-enhancing authenticationsauthentication data sizeexponentiationsclear-redeem protocol

作者：

Nakanishi, Toru、Kanatani, Takeshi

展开 >

作者单位：

Hiroshima Univ, Grad Sch Engn, Dept Informat Engn, 1-4-1 Kagamiyama, Higashihiroshima 7398527, Japan

出版年：

2020

DOI：

10.1049/iet-ifs.2018.5505

IET information security

ISSN：1751-8709

年,卷(期)：2020.14(6)

被引量3
参考文献量17