Round-optimal threshold blind signatures without random oracles
From MaRDI portal
Cites work
- A classification of computational assumptions in the algebraic group model
- A complete characterization of one-more assumptions in the algebraic group model
- A modular treatment of blind signatures from identification schemes
- A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling
- A practical secret voting scheme for large scale elections
- A signature scheme with efficient protocols
- Adaptively secure BLS threshold signatures from DDH and co-CDH
- Adaptively secure threshold blind BLS signatures and threshold oblivious PRF
- Advances in Cryptology - EUROCRYPT 2004
- An efficient system for non-transferable anonymous credentials with optional anonymity revocation
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Compact E-Cash and Simulatable VRFs Revisited
- Efficient Round Optimal Blind Signatures
- scientific article; zbMATH DE number 3825707 (Why is no real title available?)
- Improved (almost) tightly-secure simulation-sound QA-NIZK with applications
- On security proofs of existing equivalence class signature schemes
- On the impossibility of three-move blind signature schemes
- Practical round-optimal blind signatures in the ROM from standard assumptions
- Practical Round-Optimal Blind Signatures in the Standard Model
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Rai-Choo! Evolving blind signatures to the next level
- Revisiting BBS signatures
- Round optimal blind signatures
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
- Security Analysis of the Strong Diffie-Hellman Problem
- Short group signatures
- Short randomizable signatures
- Short signatures from the Weil pairing
- Signature schemes and anonymous credentials from bilinear maps
- Snowblind: a threshold blind signature in pairing-free groups
- Stronger security for threshold blind signatures
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- The algebraic group model and its applications
- The One-More Discrete Logarithm Assumption in the Generic Group Model
- Threshold blind signatures from CDH
- Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme
- Transferable e-cash: a cleaner model and the first practical instantiation
- Universal electronic cash
- Untraceable off-line cash in wallet with observers. (Extended abstract)
This page was built for publication: Round-optimal threshold blind signatures without random oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7446219)