Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
From MaRDI portal
Recommendations
- Practical Round-Optimal Blind Signatures in the Standard Model
- Efficient round-optimal blind signatures in the standard model
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
- Round optimal blind signatures
- Compact Round-Optimal Partially-Blind Signatures
- Efficient Round Optimal Blind Signatures
- Round-Optimal Blind Signatures from Waters Signatures
- The blinding of weak signatures. (Extended abstract)
- Identity-based blind signature from lattices in standard model
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
Cites work
- A one round protocol for tripartite Diffie-Hellman
- A secure three-move blind signature scheme for polynomially many signatures
- Attack against a pairing based anonymous authentication protocol
- Beyond the limitation of prime-order bilinear groups, and round optimal blind signatures
- Bounded-concurrent secure two-party computation without setup assumptions
- Compact Round-Optimal Partially-Blind Signatures
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient Round Optimal Blind Signatures
- scientific article; zbMATH DE number 3825707 (Why is no real title available?)
- scientific article; zbMATH DE number 708798 (Why is no real title available?)
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
- On the impossibility of three-move blind signature schemes
- Optimal security proofs for PSS and other signature schemes
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- Pairing-Friendly Elliptic Curves of Prime Order
- Practical Round-Optimal Blind Signatures in the Standard Model
- Round optimal blind signatures
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
- Round-optimal privacy-preserving protocols with smooth projective hash functions
- Security arguments for digital signatures and blind signatures
- Security in Communication Networks
- Security of blind digital signatures. (Extended abstract)
- Security of blind signatures revisited
- Security of Blind Signatures under Aborts
- Short structure-preserving signatures
- Signatures on randomizable ciphertexts
- Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds
- Structure-preserving signatures and commitments to group elements
- Structure-preserving signatures from standard assumptions, revisited
- Structure-preserving signatures from type II pairings
- Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- Theory of Cryptography
- Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme
- Topics in Cryptology – CT-RSA 2006
- Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
- Waters signatures with optimal security reduction
Cited in
(29)- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
- Anonymous tokens with private metadata bit
- Short pairing-free blind signatures with exponential security
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- How to obtain fully structure-preserving (automorphic) signatures from structure-preserving ones
- Practical Round-Optimal Blind Signatures in the Standard Model
- Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes
- Round optimal blind signatures
- Practical Time Capsule Signatures in the Standard Model from Bilinear Maps
- Round-Optimal Blind Signatures from Waters Signatures
- Efficient round-optimal blind signatures in the standard model
- A short paper on blind signatures from knowledge assumptions
- Multi-theorem preprocessing NIZKs from lattices
- Boosting the Security of Blind Signature Schemes
- Anonymous tokens with public metadata and applications to private contact tracing
- Non-interactive blind signatures for random messages
- 1-out-of-n oblivious signatures: security revisited and a generic construction with an efficient communication cost
- Practical round-optimal blind signatures in the ROM from standard assumptions
- On proving equivalence class signatures secure from non-interactive assumptions
- Concurrently secure blind Schnorr signatures
- Pairing-free blind signatures from standard assumptions in the ROM
- Interactive threshold mercurial signatures and applications
- Non-interactive blind signatures: post-quantum and stronger security
- On security proofs of existing equivalence class signature schemes
- Tanuki: new frameworks for (concurrently secure) blind signatures from post-quantum group actions
- Post-quantum blind signature from standard group action assumptions and more
- Threshold blind signatures from CDH
- Round-optimal GUC-secure blind signatures from minimal computational and setup assumptions. From minimal computational and setup assumptions
- Round-optimal threshold blind signatures without random oracles
This page was built for publication: Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827730)