Capybara and Tsubaki: Verifiable Random Functions from Group Actions and Isogenies
Authors
Yi-Fu Lai
Yi-Fu Lai
Ruhr University Bochum, Bochum, Germany
yi-fu dot lai at rub dot de
yi-fu dot lai at rub dot de
Abstract
In this work, we introduce two post-quantum Verifiable Random Function (VRF) constructions based on abelian group actions and isogeny group actions with a twist. The former relies on the standard group action Decisional Diffie-Hellman (GA-DDH) assumption. VRFs serve as cryptographic tools allowing users to generate pseudorandom outputs along with publicly verifiable proofs. Moreover, the residual pseudorandomness of VRFs ensures the pseudorandomness of unrevealed inputs, even when multiple outputs and proofs are disclosed. Our work aims at addressing the growing demand for post-quantum VRFs, as existing constructions based on elliptic curve cryptography (ECC) or classical DDH-type assumptions are vulnerable to quantum threats.
In our contributions, our two VRF constructions, rooted in number-theoretic pseudorandom functions, are both simple and secure over the random oracle model. We introduce a new proof system for the factorization of group actions and set elements, serving as the proofs for our VRFs. The first proposal is based on the standard GA-DDH problem, and for its security proof, we introduce the (group action) master Decisional Diffie-Hellman problem over group actions, proving its equivalence to the standard GA-DDH problem. In the second construction, we leverage quadratic twists to enhance efficiency, reducing the key size and the proof sizes, expanding input size. The scheme is based on the square GA-DDH problem.
Moreover, we employ advanced techniques from the isogeny literature to optimize the proof size to 39KB and 34KB using CSIDH-512 without compromising VRF notions. The schemes feature fast evaluations but exhibit slower proof generation. To the best of our knowledge, these constructions represent the first two provably secure VRFs based on isogenies.
References
[ACF14]
Michel Abdalla, Dario Catalano, and Dario Fiore. Verifiable Random Functions: Relations to Identity-Based Key Encapsulation and New Constructions. Journal of Cryptology, 27(3):544–593, July 2014. DOI: 10.1007/s00145-013-9153-x
[ADMP20]
Navid Alamati, Luca De Feo, Hart Montgomery, and Sikhar Patranabis. Cryptographic Group Actions and Applications. In Shiho Moriai and Huaxiong Wang, editors, ASIACRYPT 2020, Part II, volume 12492 of LNCS, pages 411–439. December 2020. Springer, Cham. DOI: 10.1007/978-3-030-64834-3_14
[AEK+22]
Michel Abdalla, Thorsten Eisenhofer, Eike Kiltz, Sabrina Kunzweiler, and Doreen Riepel. Password-Authenticated Key Exchange from Group Actions. In Yevgeniy Dodis and Thomas Shrimpton, editors, CRYPTO 2022, Part II, volume 13508 of LNCS, pages 699–728. August 2022. Springer, Cham. DOI: 10.1007/978-3-031-15979-4_24
[BBD+24]
Jeremy Booher, Ross Bowden, Javad Doliskani, Tako Boris Fouotsa, Steven D Galbraith, Sabrina Kunzweiler, Simon-Philipp Merz, Christophe Petit, Benjamin Smith, Katherine E Stange, Yan Bo Ti, Christelle Vincent, José Felipe Voloch, Charlotte Weitkämper, and Lukas Zobernig. Failing to Hash Into Supersingular Isogeny Graphs. The Computer Journal, 67(8):2702-2719, May 2024. DOI: 10.1093/comjnl/bxae038
[BCC+23]
Andrea Basso, Giulio Codogni, Deirdre Connolly, Luca De Feo, Tako Boris Fouotsa, Guido Maria Lido, Travis Morrison, Lorenz Panny, Sikhar Patranabis, and Benjamin Wesolowski. Supersingular Curves You Can Trust. In Carmit Hazay and Martijn Stam, editors, EUROCRYPT 2023, Part II, volume 14005 of LNCS, pages 405–437. April 2023. Springer, Cham. DOI: 10.1007/978-3-031-30617-4_14
[BDE+22]
Maxime Buser, Rafael Dowsley, Muhammed F. Esgin, Shabnam Kasra Kermanshahi, Veronika Kuchta, Joseph K. Liu, Raphaël C.-W. Phan, and Zhenfei Zhang. Post-Quantum Verifiable Random Function from Symmetric Primitives in PoS Blockchain. In Vijayalakshmi Atluri, Roberto Di Pietro, Christian Damsgaard Jensen, and Weizhi Meng, editors, ESORICS 2022, Part I, volume 13554 of LNCS, pages 25–45. September 2022. Springer, Cham. DOI: 10.1007/978-3-031-17140-6_2
[BDK+22]
Ward Beullens, Samuel Dobson, Shuichi Katsumata, Yi-Fu Lai, and Federico Pintore. Group Signatures and More from Isogenies and Lattices: Generic, Simple, and Efficient. In Orr Dunkelman and Stefan Dziembowski, editors, EUROCRYPT 2022, Part II, volume 13276 of LNCS, pages 95–126. 2022. Springer, Cham. DOI: 10.1007/978-3-031-07085-3_4
[BGLS03]
Dan Boneh, Craig Gentry, Ben Lynn, and Hovav Shacham. Aggregate and Verifiably Encrypted Signatures from Bilinear Maps. In Eli Biham, editor, EUROCRYPT 2003, volume 2656 of LNCS, pages 416–432. May 2003. Springer, Berlin, Heidelberg. DOI: 10.1007/3-540-39200-9_26
[BKM+21]
Andrea Basso, Péter Kutas, Simon-Philipp Merz, Christophe Petit, and Antonio Sanso. Cryptanalysis of an Oblivious PRF from Supersingular Isogenies. In Mehdi Tibouchi and Huaxiong Wang, editors, ASIACRYPT 2021, Part I, volume 13090 of LNCS, pages 160–184. December 2021. Springer, Cham. DOI: 10.1007/978-3-030-92062-3_6
[BKP20]
Ward Beullens, Shuichi Katsumata, and Federico Pintore. Calamari and Falafl: Logarithmic (Linkable) Ring Signatures from Isogenies and Lattices. In Shiho Moriai and Huaxiong Wang, editors, ASIACRYPT 2020, Part II, volume 12492 of LNCS, pages 464–492. December 2020. Springer, Cham. DOI: 10.1007/978-3-030-64834-3_16
[BKV19]
Ward Beullens, Thorsten Kleinjung, and Frederik Vercauteren. CSI-FiSh: Efficient Isogeny Based Signatures Through Class Group Computations. In Steven D. Galbraith and Shiho Moriai, editors, ASIACRYPT 2019, Part I, volume 11921 of LNCS, pages 227–247. December 2019. Springer, Cham. DOI: 10.1007/978-3-030-34578-5_9
[BKW20]
Dan Boneh, Dmitry Kogan, and Katharine Woo. Oblivious Pseudorandom Functions from Isogenies. In Shiho Moriai and Huaxiong Wang, editors, ASIACRYPT 2020, Part II, volume 12492 of LNCS, pages 520–550. December 2020. Springer, Cham. DOI: 10.1007/978-3-030-64834-3_18
[BLMW07]
Emmanuel Bresson, Yassine Lakhnech, Laurent Mazaré, and Bogdan Warinschi. A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness. In Alfred Menezes, editor, CRYPTO 2007, volume 4622 of LNCS, pages 482–499. August 2007. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-540-74143-5_27
[BLS01]
Dan Boneh, Ben Lynn, and Hovav Shacham. Short Signatures from the Weil Pairing. In Colin Boyd, editor, ASIACRYPT 2001, volume 2248 of LNCS, pages 514–532. December 2001. Springer, Berlin, Heidelberg. DOI: 10.1007/3-540-45682-1_30
[BMM+23]
Saikrishna Badrinarayanan, Daniel Masny, Pratyay Mukherjee, Sikhar Patranabis, Srinivasan Raghuraman, and Pratik Sarkar. Round-Optimal Oblivious Transfer and MPC from Computational CSIDH. In Alexandra Boldyreva and Vladimir Kolesnikov, editors, PKC 2023, Part I, volume 13940 of LNCS, pages 376–405. May 2023. Springer, Cham. DOI: 10.1007/978-3-031-31368-4_14
[BMR10]
Dan Boneh, Hart William Montgomery, and Ananth Raghunathan. Algebraic pseudorandom functions with improved efficiency from the augmented cascade. In Ehab Al-Shaer, Angelos D. Keromytis, and Vitaly Shmatikov, editors, ACM CCS 2010, pages 131–140. October 2010. ACM Press. DOI: 10.1145/1866307.1866323
[Boy08]
Xavier Boyen. The Uber-Assumption Family (Invited Talk). In Steven D. Galbraith and Kenneth G. Paterson, editors, PAIRING 2008, volume 5209 of LNCS, pages 39–56. September 2008. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-540-85538-5_3
[BS20]
Xavier Bonnetain and André Schrottenloher. Quantum Security Analysis of CSIDH. In Anne Canteaut and Yuval Ishai, editors, EUROCRYPT 2020, Part II, volume 12106 of LNCS, pages 493–522. May 2020. Springer, Cham. DOI: 10.1007/978-3-030-45724-2_17
[CD23]
Wouter Castryck and Thomas Decru. An Efficient Key Recovery Attack on SIDH. In Carmit Hazay and Martijn Stam, editors, EUROCRYPT 2023, Part V, volume 14008 of LNCS, pages 423–447. April 2023. Springer, Cham. DOI: 10.1007/978-3-031-30589-4_15
[CLG09]
Denis Xavier Charles, Kristin E. Lauter, and Eyal Z. Goren. Cryptographic Hash Functions from Expander Graphs. Journal of Cryptology, 22(1):93–113, January 2009. DOI: 10.1007/s00145-007-9002-x
[CLM+18]
Wouter Castryck, Tanja Lange, Chloe Martindale, Lorenz Panny, and Joost Renes. CSIDH: An Efficient Post-Quantum Commutative Group Action. In Thomas Peyrin and Steven Galbraith, editors, ASIACRYPT 2018, Part III, volume 11274 of LNCS, pages 395–427. December 2018. Springer, Cham. DOI: 10.1007/978-3-030-03332-3_15
[CLP24]
Mingjie Chen, Antonin Leroux, and Lorenz Panny. SCALLOP-HD: Group Action from 2-Dimensional Isogenies. In Qiang Tang and Vanessa Teague, editors, Public-Key Cryptography – PKC 2024, pages 190–216, Cham. 2024. Springer Nature Switzerland. DOI: 10.1007/978-3-031-57725-3_7
[CSCJR22]
Jorge Chávez-Saab, Jesús-Javier Chi-Domínguez, Samuel Jaques, and Francisco Rodríguez-Henríquez. The SQALE of CSIDH: sublinear Vélu quantum-resistant isogeny action with low exponents. Journal of Cryptographic Engineering, 12(3):349–368, September 2022. DOI: 10.1007/s13389-021-00271-w
[CSV20]
Wouter Castryck, Jana Sotáková, and Frederik Vercauteren. Breaking the Decisional Diffie-Hellman Problem for Class Group Actions Using Genus Theory. In Daniele Micciancio and Thomas Ristenpart, editors, CRYPTO 2020, Part II, volume 12171 of LNCS, pages 92–120. August 2020. Springer, Cham. DOI: 10.1007/978-3-030-56880-1_4
[DDF+21]
Luca De Feo, Cyprien Delpech de Saint Guilhem, Tako Boris Fouotsa, Péter Kutas, Antonin Leroux, Christophe Petit, Javier Silva, and Benjamin Wesolowski. Séta: Supersingular Encryption from Torsion Attacks. In Mehdi Tibouchi and Huaxiong Wang, editors, ASIACRYPT 2021, Part IV, volume 13093 of LNCS, pages 249–278. December 2021. Springer, Cham. DOI: 10.1007/978-3-030-92068-5_9
[DF19]
Luca De Feo. SeaSign: Compact Isogeny Signatures from Class Group Actions. Talk at Eurocrypt 2019. 2019.
[DFK+23]
Luca De Feo, Tako Boris Fouotsa, Péter Kutas, Antonin Leroux, Simon-Philipp Merz, Lorenz Panny, and Benjamin Wesolowski. SCALLOP: Scaling the CSI-FiSh. In Alexandra Boldyreva and Vladimir Kolesnikov, editors, PKC 2023, Part I, volume 13940 of LNCS, pages 345–375. May 2023. Springer, Cham. DOI: 10.1007/978-3-031-31368-4_13
[DG19]
Luca De Feo and Steven D. Galbraith. SeaSign: Compact Isogeny Signatures from Class Group Actions. In Yuval Ishai and Vincent Rijmen, editors, EUROCRYPT 2019, Part III, volume 11478 of LNCS, pages 759–789. May 2019. Springer, Cham. DOI: 10.1007/978-3-030-17659-4_26
[DGKR18]
Bernardo David, Peter Gazi, Aggelos Kiayias, and Alexander Russell. Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain. In Jesper Buus Nielsen and Vincent Rijmen, editors, EUROCRYPT 2018, Part II, volume 10821 of LNCS, pages 66–98. 2018. Springer, Cham. DOI: 10.1007/978-3-319-78375-8_3
[DHK+23]
Julien Duman, Dominik Hartmann, Eike Kiltz, Sabrina Kunzweiler, Jonas Lehmann, and Doreen Riepel. Generic Models for Group Actions. In Alexandra Boldyreva and Vladimir Kolesnikov, editors, PKC 2023, Part I, volume 13940 of LNCS, pages 406–435. May 2023. Springer, Cham. DOI: 10.1007/978-3-031-31368-4_15
[DKL+20]
Luca De Feo, David Kohel, Antonin Leroux, Christophe Petit, and Benjamin Wesolowski. SQISign: Compact Post-quantum Signatures from Quaternions and Isogenies. In Shiho Moriai and Huaxiong Wang, editors, ASIACRYPT 2020, Part I, volume 12491 of LNCS, pages 64–93. December 2020. Springer, Cham. DOI: 10.1007/978-3-030-64837-4_3
[DM20]
Luca De Feo and Michael Meyer. Threshold Schemes from Isogeny Assumptions. In Aggelos Kiayias, Markulf Kohlweiss, Petros Wallden, and Vassilis Zikas, editors, PKC 2020, Part II, volume 12111 of LNCS, pages 187–212. May 2020. Springer, Cham. DOI: 10.1007/978-3-030-45388-6_7
[DMPS19]
Luca De Feo, Simon Masson, Christophe Petit, and Antonio Sanso. Verifiable Delay Functions from Supersingular Isogenies and Pairings. In Steven D. Galbraith and Shiho Moriai, editors, ASIACRYPT 2019, Part I, volume 11921 of LNCS, pages 248–277. December 2019. Springer, Cham. DOI: 10.1007/978-3-030-34578-5_10
[DPV19]
Thomas Decru, Lorenz Panny, and Frederik Vercauteren. Faster SeaSign Signatures Through Improved Rejection Sampling. In Jintai Ding and Rainer Steinwandt, editors, Post-Quantum Cryptography - 10th International Conference, PQCrypto 2019, pages 271–285. 2019. Springer, Cham. DOI: 10.1007/978-3-030-25510-7_15
[EEK+23]
Muhammed F. Esgin, Oguzhan Ersoy, Veronika Kuchta, Julian Loss, Amin Sakzad, Ron Steinfeld, Xiangwen Yang, and Raymond K. Zhao. A New Look at Blockchain Leader Election: Simple, Efficient, Sustainable and Post-Quantum. In Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security, pages 623–637, New York, NY, USA. 2023. Association for Computing Machinery. DOI: 10.1145/3579856.3595792
[EKP20]
Ali El Kaafarani, Shuichi Katsumata, and Federico Pintore. Lossy CSI-FiSh: Efficient Signature Scheme with Tight Reduction to Decisional CSIDH-512. In Aggelos Kiayias, Markulf Kohlweiss, Petros Wallden, and Vassilis Zikas, editors, PKC 2020, Part II, volume 12111 of LNCS, pages 157–186. May 2020. Springer, Cham. DOI: 10.1007/978-3-030-45388-6_6
[EKS+21]
Muhammed F. Esgin, Veronika Kuchta, Amin Sakzad, Ron Steinfeld, Zhenfei Zhang, Shifeng Sun, and Shumo Chu. Practical Post-quantum Few-Time Verifiable Random Function with Applications to Algorand. In Nikita Borisov and Claudia Diaz, editors, FC 2021, Virtual Event, March 1-5, 2021, Revised Selected Papers, Part II, volume 12675 of Lecture Notes in Computer Science, pages 560–578. 2021. Springer. DOI: 10.1007/978-3-662-64331-0_29
[ESLR23]
Muhammed F. Esgin, Ron Steinfeld, Dongxi Liu, and Sushmita Ruj. Efficient Hybrid Exact/Relaxed Lattice Proofs and Applications to Rounding and VRFs. In Helena Handschuh and Anna Lysyanskaya, editors, CRYPTO 2023, Part V, volume 14085 of LNCS, pages 484–517. August 2023. Springer, Cham. DOI: 10.1007/978-3-031-38554-4_16
[GHM+17]
Yossi Gilad, Rotem Hemo, Silvio Micali, Georgios Vlachos, and Nickolai Zeldovich. Algorand: Scaling Byzantine Agreements for Cryptocurrencies. In Proceedings of the 26th Symposium on Operating Systems Principles, Shanghai, China, October 28-31, 2017, pages 51–68. 2017. ACM. DOI: 10.1145/3132747.3132757
[GNP+15]
Sharon Goldberg, Moni Naor, Dimitrios Papadopoulos, Leonid Reyzin, Sachin Vasant, and Asaf Ziv. NSEC5: Provably Preventing DNSSEC Zone Enumeration. In NDSS 2015. February 2015. The Internet Society. DOI: 10.14722/ndss.2015.23211
[GPSV21]
Steven Galbraith, Lorenz Panny, Benjamin Smith, and Frederik Vercauteren. Quantum Equivalence of the DLP and CDHP for Group Actions. Mathematical Cryptology, 1(1):40–44, Jun. 2021.
[HMW18]
Timo Hanke, Mahnush Movahedi, and Dominic Williams. DFINITY Technology Overview Series, Consensus System. CoRR, abs/1805.04548, 2018.
[Jag15]
Tibor Jager. Verifiable Random Functions from Weaker Assumptions. In Yevgeniy Dodis and Jesper Buus Nielsen, editors, TCC 2015, Part II, volume 9015 of LNCS, pages 121–143. March 2015. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-662-46497-7_5
[JF11]
David Jao and Luca De Feo. Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies. In Bo-Yin Yang, editor, Post-Quantum Cryptography - 4th International Workshop, PQCrypto 2011, Taipei, Taiwan, November 29 - December 2, 2011. Proceedings, volume 7071 of Lecture Notes in Computer Science, pages 19–34. 2011. Springer. DOI: 10.1007/978-3-642-25405-5_2
[KLLQ23]
Shuichi Katsumata, Yi-Fu Lai, Jason T. LeGrow, and Ling Qin. CSI-Otter: Isogeny-Based (Partially) Blind Signatures from the Class Group Action with a Twist. In Helena Handschuh and Anna Lysyanskaya, editors, CRYPTO 2023, Part III, volume 14083 of LNCS, pages 729–761. August 2023. Springer, Cham. DOI: 10.1007/978-3-031-38548-3_24
[Kup05]
Greg Kuperberg. A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem. SIAM Journal on Computing, 35(1):170-188, 2005. DOI: 10.1137/S0097539703436345
[Kup13]
Greg Kuperberg. Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem. In Simone Severini and Fernando Brandao, editors, 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013), volume 22 of Leibniz International Proceedings in Informatics (LIPIcs), pages 20–34, Dagstuhl, Germany. 2013. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. DOI: 10.4230/LIPIcs.TQC.2013.20
[Lai23]
Yi-Fu Lai. Advanced Isogeny-based Cryptosystems. PhD thesis, The University of Auckland, 2023.
[Ler23]
Antonin Leroux. Verifiable random function from the Deuring correspondence and higher dimensional isogenies. Cryptology ePrint Archive, Paper 2023/1251. 2023.
[LGD21]
Yi-Fu Lai, Steven D. Galbraith, and Cyprien Delpech de Saint Guilhem. Compact, Efficient and UC-Secure Isogeny-Based Oblivious Transfer. In Anne Canteaut and François-Xavier Standaert, editors, EUROCRYPT 2021, Part I, volume 12696 of LNCS, pages 213–241. October 2021. Springer, Cham. DOI: 10.1007/978-3-030-77870-5_8
[Lyu09]
Vadim Lyubashevsky. Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures. In Mitsuru Matsui, editor, ASIACRYPT 2009, volume 5912 of LNCS, pages 598–616. December 2009. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-642-10366-7_35
[MMP22]
Marzio Mula, Nadir Murru, and Federico Pintore. Random sampling of supersingular elliptic curves. Cryptology ePrint Archive, Report 2022/528. 2022.
[MMP+23]
Luciano Maino, Chloe Martindale, Lorenz Panny, Giacomo Pope, and Benjamin Wesolowski. A Direct Key Recovery Attack on SIDH. In Carmit Hazay and Martijn Stam, editors, EUROCRYPT 2023, Part V, volume 14008 of LNCS, pages 448–471. April 2023. Springer, Cham. DOI: 10.1007/978-3-031-30589-4_16
[MOT20]
Tomoki Moriya, Hiroshi Onuki, and Tsuyoshi Takagi. SiGamal: A Supersingular Isogeny-Based PKE and Its Application to a PRF. In Shiho Moriai and Huaxiong Wang, editors, ASIACRYPT 2020, Part II, volume 12492 of LNCS, pages 551–580. December 2020. Springer, Cham. DOI: 10.1007/978-3-030-64834-3_19
[MRV99]
Silvio Micali, Michael O. Rabin, and Salil P. Vadhan. Verifiable Random Functions. In 40th FOCS, pages 120–130. October 1999. IEEE Computer Society Press. DOI: 10.1109/SFFCS.1999.814584
[MZ22]
Hart Montgomery and Mark Zhandry. Full Quantum Equivalence of Group Action DLog and CDH, and More. In Shweta Agrawal and Dongdai Lin, editors, ASIACRYPT 2022, Part I, volume 13791 of LNCS, pages 3–32. December 2022. Springer, Cham. DOI: 10.1007/978-3-031-22963-3_1
[Pan23]
Lorenz Panny. CSI‑FiSh really isn't polynomial-time. https://yx7.cc/blah/ 2023-04-14.html. 2023.
[Pas03]
Rafael Pass. On Deniability in the Common Reference String and Random Oracle Model. In Dan Boneh, editor, CRYPTO 2003, volume 2729 of LNCS, pages 316–337. August 2003. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-540-45146-4_19
[Pei20]
Chris Peikert. He Gives C-Sieves on the CSIDH. In Anne Canteaut and Yuval Ishai, editors, EUROCRYPT 2020, Part II, volume 12106 of LNCS, pages 463–492. May 2020. Springer, Cham. DOI: 10.1007/978-3-030-45724-2_16
[PR23]
Aurel Page and Damien Robert. Introducing Clapoti(s): Evaluating the isogeny class group action in polynomial time. https://eprint.iacr.org/2023/1766. Cryptology ePrint Archive, Paper 2023/1766. 2023.
[PWH+17]
Dimitrios Papadopoulos, Duane Wessels, Shumon Huque, Moni Naor, Jan Včelák, Leonid Reyzin, and Sharon Goldberg. Making NSEC5 Practical for DNSSEC. Cryptology ePrint Archive, Report 2017/099. 2017.
[Reg04]
Oded Regev. A subexponential time algorithm for the dihedral hidden subgroup problem with polynomial space. arXiv preprint quant-ph/0406151, 2004.
[Rob23]
Damien Robert. Breaking SIDH in Polynomial Time. In Carmit Hazay and Martijn Stam, editors, EUROCRYPT 2023, Part V, volume 14008 of LNCS, pages 472–503. April 2023. Springer, Cham. DOI: 10.1007/978-3-031-30589-4_17
[Sho99]
Peter W. Shor. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM Review, 41(2):303-332, 1999. DOI: 10.1137/S0036144598347011
[Unr15]
Dominique Unruh. Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model. In Elisabeth Oswald and Marc Fischlin, editors, EUROCRYPT 2015, Part II, volume 9057 of LNCS, pages 755–784. April 2015. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-662-46803-6_25
[YAJ+17]
Youngho Yoo, Reza Azarderakhsh, Amir Jalali, David Jao, and Vladimir Soukharev. A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies. In Aggelos Kiayias, editor, FC 2017, volume 10322 of LNCS, pages 163–181. April 2017. Springer, Cham. DOI: 10.1007/978-3-319-70972-7_9
PDF
History
Submitted: 2024-01-07
Accepted: 2024-06-04
Published: 2024-10-07
Accepted: 2024-06-04
Published: 2024-10-07
How to cite
Yi-Fu Lai, Capybara and Tsubaki: Verifiable Random Functions from Group Actions and Isogenies. IACR Communications in Cryptology, vol. 1, no. 3, Oct 07, 2024, doi: 10.62056/avr-11zn4.
Citations
There are at least 3 citations.
License
Copyright is held by the author(s)
This work is licensed under a Creative Commons Attribution (CC BY) license.