Preview

Scientific and Technical Journal of Information Technologies, Mechanics and Optics

Advanced search

WaveVRF: post-quantum verifiable random function based on error-correcting codes

https://doi.org/10.17586/2226-1494-2025-25-1-174-177

Abstract

This paper introduces a novel Verifiable Random Function (VRF) based on the syndrome decoding problem and Wave signature, resistant to quantum computer attacks. The primary goal of this work is to present a new VRF scheme that demonstrates the applicability of the syndrome decoding problem for constructing cryptographically robust solutions. The paper describes the core VRF algorithms (KeyGen, VRFEval, VRFVerify) and highlights its essential properties: provability, uniqueness, and pseudo-randomness.

About the Author

Zh-M. N. Dakuo
ITMO University; Saint Petersburg State University of Aerospace Instrumentation; QApp
Russian Federation

Zhan-Mishel N. Dakuo — PhD Student; Assistant; Сryptographer Researcher

Saint Petersburg, 197101

Saint Petersburg, 190000

Moscow, 121205



References

1. Kiayias A., Russell A., David B., Oliynykov R. Ouroboros: A provably secure proof-of-stake blockchain protocol // Lecture Notes in Computer Science. 2017. V. 10401. P. 357–388. https://doi.org/10.1007/978-3-319-63688-7_12

2. Chagas V., Da-Costa G. WhatsApp and transparency: an analysis on the effects of digital platforms´ opacity in political communication research agendas in Brazil // Profesional de la información. 2023. V. 32. N 2. P. e320223. https://doi.org/10.3145/epi.2023.mar.23

3. Micali S., Rabin M., Vadhan S. Verifiable random functions // Proc. of the 40th Annual Symposium on Foundations of Computer Science (cat. No. 99CB37039). 1999. P. 1–11. https://doi.org/10.1109/SFFCS.1999.814584

4. Dodis Y., Yampolskiy A. A verifiable random function with short proofs and keys // Lecture Notes in Computer Science. 2005. V. 3386. P. 416–431. https://doi.org/10.1007/978-3-540-30580-4_28

5. Esgin M.F., Steinfeld R., Liu D., Ruj S. Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs // Lecture Notes in Computer Science. 2023. V. 14085. P. 484–517. https://doi.org/10.1007/978-3-031-38554-4_16

6. Leroux A. Verifiable random function from the Deuring correspondence and higher dimensional isogenies: Preprint // HAL science ouverte. 2023. https://hal.science/hal-04389904v1

7. Esgin M.F., Ersoy O., Kuchta V., Loss J., Sakzad A., Steinfeld R., Yang X., Zhao R.K., A new look at blockchain leader election: Simple, efficient, sustainable and post-quantum // Proc. of the ACM Asia Conference on Computer and Communications Security. 2023. P. 623–637. https://doi.org/10.1145/3579856.3595792

8. Gasparovic R.F., Apel J.R., Kasischke E.S. An overview of the SAR internal wave signature experiment // Journal of Geophysical Research: Oceans. 1988. V. 93. N C10. P. 12304–12316. https://doi.org/10.1029/jc093ic10p12304

9. Thomas Debris-Alazard. Post-Quantum Cryptography - Codes; Lecture 2: Random Codes [Электронный ресурс] URL: https:// tdalazard.io/lecture2.pdf (дата обращения: 28.10.2024).

10. Fischer J.B., Stern J. An efficient pseudo-random generator provably as secure as syndrome decoding // Lecture Notes in Computer Science. 1996. V. 1070. P. 245–255. https://doi.org/10.1007/3-540-68339-9_22

11. Kuznetsov A., Kiian A., Smirnov O., Cherep A., Kanabekova M., Chepurko I. Testing of code-based pseudorandom number generators for post-quantum application // Proc. of the 2020 IEEE 11th International conference on dependable systems, services and technologies (DESSERT). 2020. P. 172–177. https://doi.org/10.1109/dessert50317.2020.9125045


Review

For citations:


Dakuo Zh.N. WaveVRF: post-quantum verifiable random function based on error-correcting codes. Scientific and Technical Journal of Information Technologies, Mechanics and Optics. 2025;25(1):174-177. (In Russ.) https://doi.org/10.17586/2226-1494-2025-25-1-174-177

Views: 12


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.


ISSN 2226-1494 (Print)
ISSN 2500-0373 (Online)