Proceedings of the 3rd International Conference on Future Networks and Distributed Systems 2019
DOI: 10.1145/3341325.3342010
|View full text |Cite
|
Sign up to set email alerts
|

Cryptanalysis and Improvement of Identity-Based Multisignature Scheme

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…According to the actual calculation results in literatures [11]- [13], we give the notations and descriptions of various time complexity in Table 2. In Table 3, we describe the performance comparison between MPKC-CLBMSS and previous broadcast multisignature schemes [12], [13], [23], [24]. In Table 3, t denotes the number of signers, {0,1} n denotes n bits, |G q | denotes the size of the element of cyclic group G of prime order q, |K n | denotes the size of the element of the n degree extension finite of K , NO-KEI denotes that the scheme can avoid the key escrow issue, NO-CMP denotes that the scheme can avoid the certificate management problem and RQCA denotes that the scheme can resist quantum computing attacks.…”
Section: Performance Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…According to the actual calculation results in literatures [11]- [13], we give the notations and descriptions of various time complexity in Table 2. In Table 3, we describe the performance comparison between MPKC-CLBMSS and previous broadcast multisignature schemes [12], [13], [23], [24]. In Table 3, t denotes the number of signers, {0,1} n denotes n bits, |G q | denotes the size of the element of cyclic group G of prime order q, |K n | denotes the size of the element of the n degree extension finite of K , NO-KEI denotes that the scheme can avoid the key escrow issue, NO-CMP denotes that the scheme can avoid the certificate management problem and RQCA denotes that the scheme can resist quantum computing attacks.…”
Section: Performance Analysismentioning
confidence: 99%
“…As shown in Table 3, we know that MPKC-CLBMSS does not include the bilinear pairing operations and modular exponentiation. Obviously, MPKC-CLBMSS has the advantages of small signature cost and low verification cost compared with literatures [12], [13], [23] and [24]. In addition, the signature length of MPKC-CLBMSS is shorter.…”
Section: Performance Analysismentioning
confidence: 99%