|
MoneroResearch.info |
 |
 |
 |
|
Leevik, A., Beliaev, V., Stasenko, B., Davydov, V., & Bezzateev, S. 2020, Review and Analysis of the Classical and Post-Quantum Ring Signature Algorithms. Paper presented at 2020 12th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT). Added by: Jack (18/01/2023, 01:04) Last edited by: Jack (20/01/2023, 18:12) |
 |
| Resource type: Proceedings Article DOI: 10.1109/ICUMT51630.2020.9222244 BibTeX citation key: Leevik2020 View all bibliographic details  |
Categories: Not Monero-focused Creators: Beliaev, Bezzateev, Davydov, Leevik, Stasenko Collection: 2020 12th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT) |
Views: 137/2334
|
Attachments
Review_and_Analysis_of_the_Classical_and_Post-Quantum_Ring_Signature_Algorithms.pdf  [8/442]
|
URLs https://ieeexplore ... t/document/9222244 |
| Abstract |
|
In this paper a review and analysis of ring signature algorithms based on discrete logarithm and code-based problems is made. The authors consider Linkable and Multilayer Linkable Spontaneous Anonymous Group Signatures which are based on the discrete logarithm problem. Taking into the account the fact that quantum computers have already been developed, we look at different variations of code-based signatures (linkable, multilayer linkable, traceable and threshold) and analyse the efficiency of their use. Finally, the analysis of these signatures is made and standard code-based algorithms are compared.
Added by: Jack Last edited by: Jack |
| Notes |
|
In this paper a review and analysis of ring signature algorithms based on discrete logarithm and code-based problems is made. The authors consider Linkable and Multilayer Linkable Spontaneous Anonymous Group Signatures which are based on the discrete logarithm problem. Taking into the account the fact that quantum computers have already been developed, we look at different variations of code-based signatures (linkable, multilayer linkable, traceable and threshold) and analyse the efficiency of their use. Finally, the analysis of these signatures is made and standard code-based algorithms are compared.
Added by: Jack |