A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling

DOI10.1007/978-3-031-15979-4_11zbMath1514.94149OpenAlexW4312305646MaRDI QIDQ6104338

Shuichi Katsumata, Rafael del Pino

Publication date: 28 June 2023

Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-15979-4_11

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (4)

Rai-Choo! Evolving blind signatures to the next level ⋮ Lattice signature with efficient protocols, application to anonymous credentials ⋮ A framework for practical anonymous credentials from lattices ⋮ \textsf{CSI-Otter}: isogeny-based (partially) blind signatures from the class group action with a twist

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the concrete hardness of learning with errors
• Security arguments for digital signatures and blind signatures
• More efficient commitments from structured lattice assumptions
• Shorter lattice-based zero-knowledge proofs via one-time commitments
• Practical product proofs for lattice commitments
• Lattice-based blind signatures, revisited
• A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
• BlindOR: an efficient lattice-based blind signature scheme from OR-proofs
• Group signatures and more from isogenies and lattices: generic, simple, and efficient
• Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
• \textsf{BLAZE}: practical lattice-based blind signatures for privacy-preserving applications
• Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Lattice Signatures without Trapdoors
• Adaptive Proofs of Knowledge in the Random Oracle Model
• Lattice-Based Blind Signatures
• Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
• Bonsai Trees, or How to Delegate a Lattice Basis
• Efficient Lattice (H)IBE in the Standard Model
• Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
• Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
• Universal Electronic Cash
• Securing threshold cryptosystems against chosen ciphertext attack
• A practical secret voting scheme for large scale elections
• Round Optimal Blind Signatures
• An Improved Compression Technique for Signatures Based on Learning with Errors
• Round-Optimal Composable Blind Signatures in the Common Reference String Model
• Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
• Efficient lattice-based blind signatures via Gaussian one-time signatures

This page was built for publication: A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling