Preview

Territory Development

Advanced search

A Hybrid Zero-Knowledge Proof Protocol for Post-Quantum Cryptography

EDN: ZCCFEM

Abstract

The paper presents a hybrid zero-knowledge proof protocol, QZKP-Hybrid, designed to protect information from quantum and classical attacks. The protocol combines two approaches: quantum-resistant lattice cryptography (LWE) and quantum methods using special quantum states ∣ϕx⟩ and SWAP testing. The protocol solves the classical zero-knowledge proof problem (ZKP) in a post-quantum context and finds application in authentication, digital signatures, and blockchain. The protocol is non-interactive due to the Fiat-Shamir transformation. A prohibition on cloning quantum states is also used, physically protecting secret information from forgery. The security of QZKP-Hybrid is proven in the UC security model using a sequence of hybrid games. It is proven that no adversary, even with a quantum computer, can break the protocol. The protocol can be implemented using existing technologies. For example, fiber-optic channels can be used to transmit quantum states, allowing the protocol to be implemented in real-world systems. QZKP-Hybrid can be used in post-quantum systems. It is suitable for tasks where data must be hidden while still being verified. The protocol has demonstrated a good balance between security and performance. With a parameter size of n = 512, it operates quickly and requires little memory. This allows it to be used in mobile devices and IoT systems. Future research plans include studying the impact of decoherence and noise on protocol accuracy and extending the model to multiple participants.

About the Author

S. B. Kuznetsov
University “Sirius”, Federal Territory “Sirius”
Russian Federation

Sergey B. Kuznetsov — Candidate of Sciences (Physics and Mathematics), Associate Professor, Leading Research Engineer, Scientific Center for Information Technology and Artificial Intelligence

Sochi



References

1. Bos J.W., Ducas L., Kiltz E. et al. Crystals-Dilithium: A Lattice-Based Digital Signature Scheme. Available at: https://pq-crystals.org/dilithium/ (accessed: 09.05.2025).

2. Alkim E., Ducas L., Pöppelmann T., Schwabe P. Post-Quantum Key Exchange – a New Hope. Available at: https://eprint.iacr.org/2015/1092 (accessed: 07.05.2025).

3. Kaplan M., Leurent G., Leverrier A., Naya-Plasencia M. Breaking Symmetric Cryptosystems Using Quantum Period Finding, Advances in Cryptology – CRYPTO 2016 : Annual International Cryptology Conference. Berlin ; Heidelberg : Springer, 2016, pp. 207–237 (Lecture Notes in Computer Science, vol. 9815). DOI: 10.1007/978-3-662-53008-5_8

4. Canetti R. Universally Composable Security. IACR Cryptology ePrint Archive. 2005. Available at: https://eprint.iacr.org/2000/067 (accessed: 11.05.2025).

5. Canetti R., Goldreich O., Goldwasser S., Micali S. Resettable Zero-Knowledge (extended abstract), Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21–23, 2000, New York, USA, 2000, pp. 235–244. Available at: https://dl.acm.org/doi/10.1145/335305.335334 (accessed: 12.05.2025).

6. Benhamouda F., Camenisch J., Krenn S., Lyubashevsky V., Neven G. Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings, Computer Security – ESORICS 2015 : 20th European Symposium on Research in Computer Security. Vienna, Austria, September 21–25, 2015, Proceedings, Part I. Cham: Springer, 2015, pp. 305–325. (Lecture Notes in Computer Science, vol. 9326). Available at: https://link.springer.com/chapter/10.1007/978-3-319-24174-6_16 (accessed: 12.05.2025).

7. Ambainnis A., Rosmanis A., Unruh D. Quantum Attacks on Classical Proof Systems: The Hardness of Quantum Rewinding and More, IACR Cryptology ePrint Archive. Report 2020/100. 2020. Available at: https://eprint.iacr.org/2014/296 (accessed: 11.05.2025).

8. Unruh D. Universally Composable Quantum Oblivious Transfer, ICALP 2013 : conf. proc. / ed. by F. Fomin, R. Freivalds, M. Kwiatkowska. Berlin ; Heidelberg : Springer, 2013, pp. 561–572 (Lecture Notes in Computer Science, vol. 7966). Available at: https://doi.org/10.1007/978-3-642-13190-5_25

9. Bitansky N., Shmueli O. Post-Quantum Zero Knowledge in Constant Rounds, Symposium on Foundations of Computer Science (FOCS) : proc. IEEE, 2020, pp. 219–230. Available at: https://eprint.iacr.org/2019/1279.

10. Regev O. On Lattices, Learning with Errors, Random Linear Codes, and Cryptography, Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing – STOC ’05. New York, USA, 2005, pp. 84–93. Available at: https://dl.acm.org/doi/10.1145/1060590.1060603 (accessed: 15.06.2025).

11. Wooters W.K., Zurek W.H. A Single Quantum Cannot be Cloned, Nature, 1982, vol. 299, no. 5886, pp. 802–803. DOI: 10.1038/299802a0

12. Shor P.W. Scheme for Reducing Decoherence in Quantum Computer Memory, Physical Review A. 1995, vol. 52, no. 4, pp. R2493–R2496. DOI: 10.1103/PhysRevA.52.R2493

13. Steane A.M. Error Correcting Codes in Quantum Theory, Physical Review Letters, 1996, vol. 77, iss. 5, pp. 793–797. DOI: 10.1103/PhysRevLett.77.793

14. Gottesman D. An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation, Proceedings of Symposia in Applied Mathematics, 2010, vol. 68, pp. 13–58. Available at: https://doi.org/10.48550/arXiv.0904.2557

15. Buttler W.T, Lamoreaux S.K., Torgerson J.R. et al. Fast, Efficient error Reconciliation for Quantum Key Distribution, Physical Review A, 2003, vol. 67, no. 2. Art. 022301. Available at: https://doi.org/10.1103/PhysRevA.67.052303

16. Cirq: A Python Framework for Creating Quantum Circuits. Google Quantum AI. Available at: https://quantumai.google/cirq (accessed: 15.06.2025).

17. Qiskit: Open-source Framework for Quantum Computing. IBM Research. Available at: https://qiskit.org (accessed: 15.06.2025).


Review

For citations:


Kuznetsov S.B. A Hybrid Zero-Knowledge Proof Protocol for Post-Quantum Cryptography. Territory Development. 2026;(1 (43)):77-88. (In Russ.) EDN: ZCCFEM

Views: 77

JATS XML


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


ISSN 2412-8945 (Print)