Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

A New Isogeny-based Lossy Identification Protocol for a Tightly Secure Digital Signature

Federico Pintore

Published Jan 1, 2021• 0 citations
OpenAlex

Related papers

A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies

Youngho Yoo, Reza Azarderakhsh, Amir Jalali +2 more

Lecture notes in computer science•Jan 1, 2017•100 citations

Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange

Kristian Gjøsteen, Tibor Jager

Lecture notes in computer science•Jan 1, 2018•91 citations

An Efficient MQ-based Signature with Tight Security Proof

Hiroki Furue, Dung Hoang Duong, Tsuyoshi Takagi

At PKC 2018, Chen et al. proposed SOFIA, the first MQ-based digital signature scheme having tight security in the quantum random oracle model (QROM). SOFIA is constructed by applying an extended version of the Unruh transform (EUROCRYPT 2015) to the mathcal MQ-based 5-pass identification scheme (IDS) proposed by Sakumoto et al. (CRYPTO 2011). In this paper, we propose an MQ-based 3-pass IDS with impersonation probability of 1/2 and apply the original version of the Unruh transform to it to obtain a more efficient MQ-based digital signature scheme tightly secure in the QROM. The signature size of our digital signature scheme decreases by about 35% compared with SOFIA in the level I of NIST PQC security category, and is supposed to be the shortest among that of MQ-based signatures tightly secure in the QROM.

International Journal of Networking and Computing•Jan 1, 2020•3 citations

A survey on isogeny-based cryptographic protocols

Sweta Mishra, Bhaskar Mondal, Rishi Kumar Jha

Wireless Networks•Feb 25, 2025•8 citations

Tightly Secure Identity-Based Signature from Cryptographic Group Actions

Xuan Thanh Khuc, Willy Susilo, Dung Hoang Duong +3 more

Lecture notes in computer science•Jan 1, 2025•0 citations

A Post-Quantum Zero-Knowledge Identification Scheme

Maryam Rezaei Kashi, Mojtaba Bahramian

‎In this paper‎, ‎we introduce a zero-knowledge identification protocol designed for authentication within the supersingular isogeny Diffie-Hellman (SIDH) key exchange framework‎. ‎The protocol allows both parties to participate as either the prover or the verifier‎, ‎with the goal of proving that they know their private information‎. ‎We show the completeness and soundness of the protocol by showing that the privacy of both the prover and the verifier depends on the difficulty of solving the extended isogeny logarithm problem‎. ‎A new authentication protocol for SIDH is presented in this paper‎, ‎that is secure against attacks from eavesdroppers‎.

•Dec 1, 2025•0 citations
At PKC 2018, Chen et al. proposed SOFIA, the first MQ-based digital signature scheme having tight security in the quantum random oracle model (QROM). SOFIA is constructed by applying an extended version of the Unruh transform (EUROCRYPT 2015) to the mathcal MQ-based 5-pass identification scheme (IDS) proposed by Sakumoto et al. (CRYPTO 2011). In this paper, we propose an MQ-based 3-pass IDS with impersonation probability of 1/2 and apply the original version of the Unruh transform to it to obtain a more efficient MQ-based digital signature scheme tightly secure in the QROM. The signature size of our digital signature scheme decreases by about 35% compared with SOFIA in the level I of NIST PQC security category, and is supposed to be the shortest among that of MQ-based signatures tightly secure in the QROM.
‎In this paper‎, ‎we introduce a zero-knowledge identification protocol designed for authentication within the supersingular isogeny Diffie-Hellman (SIDH) key exchange framework‎. ‎The protocol allows both parties to participate as either the prover or the verifier‎, ‎with the goal of proving that they know their private information‎. ‎We show the completeness and soundness of the protocol by showing that the privacy of both the prover and the verifier depends on the difficulty of solving the extended isogeny logarithm problem‎. ‎A new authentication protocol for SIDH is presented in this paper‎, ‎that is secure against attacks from eavesdroppers‎.