You are looking at a specific version 20211015:082419 of this paper. See the latest version.

Paper 2021/1385

BlindOR: An Efficient Lattice-Based Blind Signature Scheme from OR-Proofs

Nabil Alkeilani Alkadri and Patrick Harasser and Christian Janson

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
Published elsewhere. Major revision. 20th International Conference on Cryptology and Network Security (CANS 2021)
Keywords
Blind signaturesOR-proofLattice-based cryptography
Contact author(s)
nabil alkadri @ tu-darmstadt de
patrick harasser @ tu-darmstadt de
christian janson @ tu-darmstadt de
History
2023-01-10: last of 2 revisions
2021-10-15: received
See all versions
Short URL
https://ia.cr/2021/1385
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.