Cryptology ePrint Archive: Report 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.

Category / Keywords: cryptographic protocols / Blind signatures, OR-proof, Lattice-based cryptography

Original Publication (with major differences): 20th International Conference on Cryptology and Network Security (CANS 2021)

Date: received 13 Oct 2021

Contact author: nabil alkadri at tu-darmstadt de, patrick harasser at tu-darmstadt de, christian janson at tu-darmstadt de

Available format(s): PDF | BibTeX Citation

Version: 20211015:082419 (All versions of this report)

Short URL: ia.cr/2021/1385


[ Cryptology ePrint archive ]