.png){kind=icon}
.png){kind=icon}
Return
An efficient multivariate threshold ring signature scheme
.png){kind=icon}
PRE
AI
DOI：10.1016/j.csi.2020.103489.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
At CRYPTO 2011, Sakumoto et al. introduced the first 3-pass identification protocol with security reduction to the MQ problem and impersonation probability 2/3. Petzoldt et al. (AAECC 2013) extended that protocol into a threshold ring signature scheme, which later was improved by Zhang and Zhao (NSS 2014). In 2015, Monteiro et al. (IEICE 2015) improved the 3-pass identification protocol of Sakumoto et al. to the one with impersonation probability 1/2. In this paper, we utilize the previous methods and the protocol by Monteiro et al. (2015)[20] to propose an efficient threshold ring signature. As a result, our scheme is more efficient than all previous multivariate threshold signature schemes in terms of both communication cost and signature length. In particular, the signature length of our scheme is 40% and 22% shorter than that of Petzoldt et al. and Zhang-Zhao respectively.
Keywords:
Post-quantum cryptography
Multivariate cryptography
Threshold ring signature
MQ problem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
3.1
Papers:
2.3K
Citations:
2.0K
View more organizations