Lattice-based blind signatures, revisited
From MaRDI portal
Publication:2096538
DOI10.1007/978-3-030-56880-1_18zbMath1504.94213OpenAlexW3038068666MaRDI QIDQ2096538
Julian Loss, Eike Kiltz, Ngoc Khanh Nguyen, Eduard Hauck
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_18
Related Items
Post-quantum key-blinding for authentication in anonymity networks ⋮ A correction to a code-based blind signature scheme ⋮ Boosting the Security of Blind Signature Schemes ⋮ Security analysis of RSA-BSSA ⋮ Threshold and multi-signature schemes from linear hash functions ⋮ Non-interactive blind signatures for random messages ⋮ Rai-Choo! Evolving blind signatures to the next level ⋮ A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling ⋮ PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more ⋮ On pairing-free blind signature schemes in the algebraic group model ⋮ Efficient lattice-based blind signatures via Gaussian one-time signatures ⋮ \textsf{CSI-Otter}: isogeny-based (partially) blind signatures from the class group action with a twist ⋮ The Abe-Okamoto partially blind signature scheme revisited ⋮ On the (in)security of ROS ⋮ On the (in)security of ROS ⋮ Lattice-based blind signatures, revisited
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient signature generation by smart cards
- Security arguments for digital signatures and blind signatures
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- A lattice-based identity-based proxy blind signature scheme in the standard model
- On lattice-based interactive protocols: an approach with less or no aborts
- Lattice-based blind signatures, revisited
- On the non-existence of short vectors in random module lattices
- \textsf{BLAZE}: practical lattice-based blind signatures for privacy-preserving applications
- A modular treatment of blind signatures from identification schemes
- Worst-case to average-case reductions for module lattices
- Security of blind signatures revisited
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities
- On the Security of One-Witness Blind Signature Schemes
- Security Proofs for Signature Schemes
- Formalizing Human Ignorance
- Lattice Signatures without Trapdoors
- Identity-Based Blind Signature from Lattices in Standard Model
- Impossibility of Blind Signatures from One-Way Permutations
- Lattice-Based Blind Signatures
- BKZ 2.0: Better Lattice Security Estimates
- Randomizable Proofs and Delegatable Anonymous Credentials
- Practical Round-Optimal Blind Signatures in the Standard Model
- On the Impossibility of Three-Move Blind Signature Schemes
- Generalized Compact Knapsacks Are Collision Resistant
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Security of Blind Signatures under Aborts
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- Universal Electronic Cash
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Identity-based blind signature from lattices
- Round Optimal Blind Signatures
- Compact E-Cash
- Efficient Round Optimal Blind Signatures
- Simulatable Adaptive Oblivious Transfer
- Predicting Lattice Reduction
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: Lattice-based blind signatures, revisited
