4.4 Article

Proving knowledge of isogenies: a survey

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Proceedings Paper Computer Science, Information Systems

SIDH Proof of Knowledge

Luca De Feo et al.

Summary: This paper identifies an invalid assumption in the soundness proof of the De Feo-Jao-Pl<^>ut identification scheme, which is the basis for SIDH signatures. The authors provide a counterexample for this assumption and propose two sigma protocols to address the issue. The paper also avoids the soundness issue raised by Ghantous, Pintore, and Veroni in the SIDH identification scheme.

ADVANCES IN CRYPTOLOGY- ASIACRYPT 2022, PT II (2022)

Proceedings Paper Computer Science, Theory & Methods

The supersingular isogeny path and endomorphism ring problems are equivalent

Benjamin Wesolowski

Summary: The paper proved that the path-finding problem in isogeny graphs and the endomorphism ring problem for supersingular elliptic curves are equivalent under reductions of polynomial expected time, assuming the generalised Riemann hypothesis. The algorithm developed for the quaternion analog of the path-finding problem is a powerful cryptanalytic tool and building-block for cryptosystems.

2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021) (2022)

Proceedings Paper Computer Science, Interdisciplinary Applications

Verifiable Isogeny Walks: Towards an Isogeny-Based Postquantum VDF

Jorge Chavez-Saab et al.

Summary: This paper investigates the problem of constructing postquantum-secure verifiable delay functions (VDFs) based on supersingular isogenies. It proposes a different approach using succinct non-interactive arguments (SNARGs) tailored to the arithmetic structure of the isogeny setting to achieve good asymptotic efficiency. As a result, an isogeny-based VDF construction with postquantum security, quasi-logarithmic verification, and requiring no trusted setup is obtained. Additionally, non-interactive arguments for isogeny walks in the supersingular graph over F-p2 are constructed, which may have independent interest.

SELECTED AREAS IN CRYPTOGRAPHY (2022)

Proceedings Paper Computer Science, Information Systems

A New Adaptive Attack on SIDH

Tako Boris Fouotsa et al.

Summary: The SIDH key exchange scheme is vulnerable to various attacks, such as adaptive attacks and passive attacks, which exploit torsion point information to recover secret isogenies.

TOPICS IN CRYPTOLOGY, CT-RSA 2022 (2022)

Article Computer Science, Theory & Methods

Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems

Steven D. Galbraith et al.

JOURNAL OF CRYPTOLOGY (2020)

Proceedings Paper Computer Science, Information Systems

CSIDH on the Surface

Wouter Castryck et al.

POST-QUANTUM CRYPTOGRAPHY, PQCRYPTO 2020 (2020)

Proceedings Paper Computer Science, Artificial Intelligence

CSI-FiSh: Efficient Isogeny Based Signatures Through Class Group Computations

Ward Beullens et al.

ADVANCES IN CRYPTOLOGY - ASIACRYPT 2019, PT I (2019)

Proceedings Paper Computer Science, Information Systems

Aurora: Transparent Succinct Arguments for R1CS

Eli Ben-Sasson et al.

ADVANCES IN CRYPTOLOGY - EUROCRYPT 2019, PT I (2019)

Proceedings Paper Computer Science, Information Systems

SeaSign: Compact Isogeny Signatures from Class Group Actions

Luca De Feo et al.

ADVANCES IN CRYPTOLOGY - EUROCRYPT 2019, PT III (2019)

Proceedings Paper Computer Science, Information Systems

Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model

Dominique Unruh

ADVANCES IN CRYPTOLOGY - EUROCRYPT 2015, PT II (2015)

Article Mathematics, Applied

On the quaternion l-isogeny path problem

David Kohel et al.

LMS JOURNAL OF COMPUTATION AND MATHEMATICS (2014)

Article Computer Science, Theory & Methods

Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies

Luca De Feo et al.

JOURNAL OF MATHEMATICAL CRYPTOLOGY (2014)

Proceedings Paper Computer Science, Theory & Methods

Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies

David Jao et al.

POST-QUANTUM CRYPTOGRAPHY (2011)

Article Computer Science, Theory & Methods

Computationally sound proofs

S Micali

SIAM JOURNAL ON COMPUTING (2000)