Skip to main content
Search
Get published
Explore Journals
Books
About
My account
Search all SpringerOpen articles
Search
Cybersecurity
About
Articles
Submission Guidelines
Table 2 Comparison of the expect complexity of Merkle trees used in (
Ling et al. 2017
) and our work
From:
An efficient full dynamic group signature scheme over ring
Indicators
The update complexity
The space complexity
Schemes
(
Ling et al. 2017
)
O
(log
N
)
O
(2
N
−1)
Our work
\(O(\log \frac {N}{2})\)
\(O(\frac {4}{3}\cdot N-1)\)
Back to article page