Non-interactive blind signatures for random messages
From MaRDI portal
Publication:6083686
DOI10.1007/978-3-031-30589-4_25zbMath1528.94098OpenAlexW4365935172MaRDI QIDQ6083686
Publication date: 8 December 2023
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-30589-4_25
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Security arguments for digital signatures and blind signatures
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
- Lattice-based blind signatures, revisited
- An airdrop that preserves recipient privacy
- A modular treatment of blind signatures from identification schemes
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
- Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
- Practical Round-Optimal Blind Signatures in the Standard Model
- Defeating Malicious Servers in a Blind Signatures Based Voting System
- On the Impossibility of Three-Move Blind Signature Schemes
- Practical Compact E-Cash
- Security of Blind Signatures under Aborts
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Compact E-Cash
- Efficient Round Optimal Blind Signatures
- Limits of provable security from standard assumptions
- Pairing-Friendly Elliptic Curves of Prime Order
- Simulatable Adaptive Oblivious Transfer
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
- PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more
This page was built for publication: Non-interactive blind signatures for random messages
