Paper 2021/1385 Original: eprint.iacr.org/2021/1385 ↗
BlindOR: An Efficient Lattice-Based Blind Signature Scheme from OR-Proofs
Abstract
An OR-proof is a protocol that enables a user to prove the possession of a witness for one of two (or more) statements, without revealing which one. Abe and Okamoto (CRYPTO 2000) used this technique to build a partially blind signature scheme whose security is based on the hardness of the discrete logarithm problem. Inspired by their approach, we present BlindOR, an efficient blind signature scheme from OR-proofs based on lattices over modules. Using OR-proofs allows us to reduce the security of our scheme from the MLWE and MSIS problems, yielding a much more efficient solution compared to previous works.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2023-01-10: last updated
- 2021-10-15: published
- Short URL
- https://ia.cr/2021/1385
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2021/1385,
author = {Nabil Alkeilani Alkadri and Patrick Harasser and Christian Janson},
title = {BlindOR: An Efficient Lattice-Based Blind Signature Scheme from OR-Proofs},
howpublished = {Cryptology {ePrint} Archive, Paper 2021/1385},
year = {2021},
url = {https://eprint.iacr.org/2021/1385}
}