BlindOR: an efficient lattice-based blind signature scheme from OR-proofs
From MaRDI portal
Publication:2149816
DOI10.1007/978-3-030-92548-2_6zbMath1493.94047OpenAlexW3206919059MaRDI QIDQ2149816
Christian Janson, Nabil Alkeilani Alkadri, Patrick Harasser
Publication date: 29 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-92548-2_6
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Computer security (68M25)
Related Items (2)
A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling ⋮ The Abe-Okamoto partially blind signature scheme revisited
Uses Software
Cites Work
- Security arguments for digital signatures and blind signatures
- On lattice-based interactive protocols: an approach with less or no aborts
- \textsf{BLAZE}: practical lattice-based blind signatures for privacy-preserving applications
- A modular treatment of blind signatures from identification schemes
- Security of blind signatures revisited
- Lattice Signatures without Trapdoors
- Lattice-Based Blind Signatures
- Security of Blind Signatures under Aborts
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- Round Optimal Blind Signatures
- Simulatable Adaptive Oblivious Transfer
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: BlindOR: an efficient lattice-based blind signature scheme from OR-proofs
