Efficiency Improvement in Group Signature Scheme with Probabilistic Revocation
Efficiency Improvement in Group Signature Scheme with Probabilistic Revocation
复制标题
概率撤销群签名方案的效率提升
DOI：
--
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
T. Nakanishi
中科院分区：
文献类型：
--
作者：
Nasima Begum;T. Nakanishi
在群签名方案中，成员撤销问题是其中的一个重要问题，已有大量的可撤销方案被提出。最近，人们提出了一种概率撤销群签名方案(GSPR)。在GSPR中，通过使用概率撤销的新概念，虽然撤销检查的正确性具有一定的概率，但大大降低了撤销检查的计算代价。然而，在GSPR方案中，存在另一个问题：M个别名令牌被嵌入到成员的证书中。然后，在签名中，使用每个令牌，并且需要O(M)次指数来证明所使用的令牌被嵌入到证书中。当m很大时，包括O(M)指数在内的签名成本对于没有能力的移动设备来说成为一个大问题。本文提出了一种扩展的GSPR方案，该方案降低了签名代价，但撤销机制与原GSPR方案完全相同。我们的主要思想是利用一个高效的基于配对的乘法累加器来在证书中嵌入大量的别名令牌。因此，在所提出的方案中，签名开销仅减少到O(M)次，而不是O(M)次。
In group signature schemes, one of the important issues is the member revocation, and lots of revocable schemes have been proposed. Recently, a Group Signature scheme with Probabilistic Revocation (GSPR) is proposed. In GSPR, by employing a novel notion of probabilistic revocation, the computation cost of the revocation check is drastically reduced, although the correctness of the check is with a certain probability. However, in the GSPR scheme, there is another problem: m alias tokens are embedded into the certificate of a member. Then, in signing, each token is used, and O(m) exponentiations are needed to prove that the used token is embedded in the certificate. When m is large, this signing cost including O(m) exponentiations becomes a big problem for powerless mobile devices. In this paper, we propose an extended GSPR scheme where the signing cost is reduced, but the revocation mechanism is exactly the same as the original GSPR scheme. Our main idea is to utilize an efficient pairing-based accumulator with multiplications to embed lots of alias tokens in a certificate. Thus, in the proposed scheme, the signing cost is reduced to only O(m) multiplications instead of O(m) exponentiations.
影响因子：
3
作者：
Masayuki Abe;Georg Fuchsbauer;Jens Groth;Kristiyan Haralambiev;Miyako Ohkubo
通讯作者：
Masayuki Abe;Georg Fuchsbauer;Jens Groth;Kristiyan Haralambiev;Miyako Ohkubo