Paper 2024/1225 Original: eprint.iacr.org/2024/1225 ↗
SIGNITC: Supersingular Isogeny Graph Non-Interactive Timed Commitments
Abstract
Non-Interactive Timed Commitment schemes (NITC) allow to open any commitment after a specified delay. This is useful for sealed bid auctions and as primitive for more complex protocols. We present the first NITC without repeated squaring or black box algorithms like generic NIZK proofs or generic one-way functions. It has fast verification, almost arbitrary delay and satisfies IND-CCA hiding and perfect binding. Our protocol is based on isogenies between supersingular elliptic curves making it presumably quantum secure. It needs no trusted setup and can use a wide variety of primes. We also have a SageMath implementation.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2025-10-16: last updated
- 2024-07-31: published
- Short URL
- https://ia.cr/2024/1225
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2024/1225,
author = {Knud Ahrens},
title = {SIGNITC: Supersingular Isogeny Graph Non-Interactive Timed Commitments},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1225},
year = {2024},
url = {https://eprint.iacr.org/2024/1225}
}