Post-Quantum Digital Signature: Verkle-Based HORST
The security of commonly used cryptographic systems like RSA and ECC might be threatened by the future development of quantum computing. Verkle-based HORST decreases the size of signatures by 75% (from 12.8 KB to 3.2 KB) and enables O(1)-sized proofs by replacing Merkle trees with Verkle trees. Beca...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-05-01
|
| Series: | Journal of Cybersecurity and Privacy |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2624-800X/5/2/28 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1839653737201664000 |
|---|---|
| author | Maksim Iavich Tamari Kuchukhidze Razvan Bocu |
| author_facet | Maksim Iavich Tamari Kuchukhidze Razvan Bocu |
| author_sort | Maksim Iavich |
| collection | DOAJ |
| description | The security of commonly used cryptographic systems like RSA and ECC might be threatened by the future development of quantum computing. Verkle-based HORST decreases the size of signatures by 75% (from 12.8 KB to 3.2 KB) and enables O(1)-sized proofs by replacing Merkle trees with Verkle trees. Because verification shifts from O(log t) to constant time, it is ideal for blockchain and IoT applications that require short signatures and fast validation. In order to increase efficiency, this study introduces Verkle-based HORST, a hash-based signature method that uses Verkle trees. Our primary contributions are the following: a formal security analysis proving maintained protection levels under standard assumptions; a thorough performance evaluation demonstrating significant improvements in signature size and verification complexity in comparison to conventional Merkle tree approaches; and a novel signature construction employing polynomial commitments to achieve compact proofs. The proposed approach has a lot of benefits for real-world implementation, especially when dealing with situations that call for a large number of signatures or settings with limited resources. We offer comprehensive implementation instructions and parameter choices to promote uptake while preserving hash-based cryptography’s quantum-resistant security features. Our findings suggest that this method is a good fit for post-quantum cryptography systems’ standardization. |
| format | Article |
| id | doaj-art-c66e9d0352dc4b0bacb80bc6a74d0862 |
| institution | Matheson Library |
| issn | 2624-800X |
| language | English |
| publishDate | 2025-05-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Journal of Cybersecurity and Privacy |
| spelling | doaj-art-c66e9d0352dc4b0bacb80bc6a74d08622025-06-25T13:59:09ZengMDPI AGJournal of Cybersecurity and Privacy2624-800X2025-05-01522810.3390/jcp5020028Post-Quantum Digital Signature: Verkle-Based HORSTMaksim Iavich0Tamari Kuchukhidze1Razvan Bocu2Department of Computer Science, Caucasus University, 0102 Tbilisi, GeorgiaDepartment of Computer Science, Caucasus University, 0102 Tbilisi, GeorgiaDepartment of Mathematics and Computer Science, Transilvania University of Brasov, 500036 Brasov, RomaniaThe security of commonly used cryptographic systems like RSA and ECC might be threatened by the future development of quantum computing. Verkle-based HORST decreases the size of signatures by 75% (from 12.8 KB to 3.2 KB) and enables O(1)-sized proofs by replacing Merkle trees with Verkle trees. Because verification shifts from O(log t) to constant time, it is ideal for blockchain and IoT applications that require short signatures and fast validation. In order to increase efficiency, this study introduces Verkle-based HORST, a hash-based signature method that uses Verkle trees. Our primary contributions are the following: a formal security analysis proving maintained protection levels under standard assumptions; a thorough performance evaluation demonstrating significant improvements in signature size and verification complexity in comparison to conventional Merkle tree approaches; and a novel signature construction employing polynomial commitments to achieve compact proofs. The proposed approach has a lot of benefits for real-world implementation, especially when dealing with situations that call for a large number of signatures or settings with limited resources. We offer comprehensive implementation instructions and parameter choices to promote uptake while preserving hash-based cryptography’s quantum-resistant security features. Our findings suggest that this method is a good fit for post-quantum cryptography systems’ standardization.https://www.mdpi.com/2624-800X/5/2/28quantum cryptographyMerkle treeHORSHORSThash-based digital signaturesVerkle tree |
| spellingShingle | Maksim Iavich Tamari Kuchukhidze Razvan Bocu Post-Quantum Digital Signature: Verkle-Based HORST Journal of Cybersecurity and Privacy quantum cryptography Merkle tree HORS HORST hash-based digital signatures Verkle tree |
| title | Post-Quantum Digital Signature: Verkle-Based HORST |
| title_full | Post-Quantum Digital Signature: Verkle-Based HORST |
| title_fullStr | Post-Quantum Digital Signature: Verkle-Based HORST |
| title_full_unstemmed | Post-Quantum Digital Signature: Verkle-Based HORST |
| title_short | Post-Quantum Digital Signature: Verkle-Based HORST |
| title_sort | post quantum digital signature verkle based horst |
| topic | quantum cryptography Merkle tree HORS HORST hash-based digital signatures Verkle tree |
| url | https://www.mdpi.com/2624-800X/5/2/28 |
| work_keys_str_mv | AT maksimiavich postquantumdigitalsignatureverklebasedhorst AT tamarikuchukhidze postquantumdigitalsignatureverklebasedhorst AT razvanbocu postquantumdigitalsignatureverklebasedhorst |