Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Colleges, School and Institutes
- University of Auckland
- Universitat Pompeu Fabra, Barcelona
We provide a new identification protocol and new signature schemes based on isogeny problems. Our identification protocol relies on the hardness of the endomorphism ring computation problem, arguably the hardest of all problems in this area, whereas the only previous scheme based on isogenies (due to De Feo, Jao and Plut) relied on potentially easier problems. The protocol makesnovel use of an algorithm of Kohel-Lauter-Petit-Tignol for the quaternion version of the l -isogeny problem, for which we provide a more complete description and analysis. Our new signature schemes are derived from the identification protocols using the Fiat-Shamir (respectively, Unruh) transforms for classical (respectively, post-quantum) security. We study their efficiency, highlighting very small key sizes and reasonably efficient signing and verification algorithms.
Winner of the Best Paper Award of ASIACRYPT 2017 conference.
|Title of host publication||ASIACRYPT 2017|
|Subtitle of host publication||Proceedings of the 23rd International Conference on the Theory and Applications of Cryptology and Information Security (ASIACRYPT 2017)|
|Publication status||Published - 7 Dec 2017|
|Event||23rd Annual International Conference on the Theory and Applications of Cryptology and Information Security (ASIACRYPT 2017) - Hong Kong|
Duration: 3 Dec 2017 → 7 Dec 2017
|Conference||23rd Annual International Conference on the Theory and Applications of Cryptology and Information Security (ASIACRYPT 2017)|
|Period||3/12/17 → 7/12/17|