Paper 2025/2340 Original: eprint.iacr.org/2025/2340 ↗
OOPS: One-time Oblivious Polynomial Signatures
Abstract
We introduce one-time oblivious polynomial signatures (OOPS), a signature scheme based on polynomials over pairing-based elliptic curves that can securely produce signatures for up to a threshold of $n$ different messages. Signing more than $n$ messages allows anyone to forge signatures under the given parameters, making it necessary to reparameterize the scheme occasionally. We show that this property is not a severe limitation though by demonstrating how to build various efficient OOPS-based cryptographic protocols, including delegatable signatures, $1$-out-of-$n$ oblivious transfer, and partially oblivious PRFs.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2025-12-31: last updated
- 2025-12-31: published
- Short URL
- https://ia.cr/2025/2340
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2025/2340,
author = {Kobi Gurkan and Philipp Jovanovic and Andrija Novakovic},
title = {OOPS: One-time Oblivious Polynomial Signatures},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/2340},
year = {2025},
url = {https://eprint.iacr.org/2025/2340}
}