Practical round-optimal blind signatures in the ROM from standard assumptions
From MaRDI portal
Publication:6562573
Recommendations
- Practical Round-Optimal Blind Signatures in the Standard Model
- Pairing-free blind signatures from standard assumptions in the ROM
- Efficient Round Optimal Blind Signatures
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
Cites work
- 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
- Adaptive proofs of knowledge in the random oracle model
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Boosting the Security of Blind Signature Schemes
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Digital Signatures
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient lattice (H)IBE in the standard model
- Equipping public-key cryptographic primitives with watermarking (or: a hole is to watermark)
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- Fiat-Shamir transformation of multi-round interactive proofs
- Fuzzy Identity-Based Encryption
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1722673 (Why is no real title available?)
- scientific article; zbMATH DE number 3825707 (Why is no real title available?)
- scientific article; zbMATH DE number 1303137 (Why is no real title available?)
- scientific article; zbMATH DE number 1024065 (Why is no real title available?)
- scientific article; zbMATH DE number 1088232 (Why is no real title available?)
- scientific article; zbMATH DE number 1952905 (Why is no real title available?)
- Improved (almost) tightly-secure simulation-sound QA-NIZK with applications
- Improved structure preserving signatures under standard bilinear assumptions
- Improving the exact security of digital signature schemes
- Limits of provable security from standard assumptions
- Lower bounds and impossibility results for concurrent self composition
- New techniques for noninteractive zero-knowledge
- On the impossibility of three-move blind signature schemes
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more
- Practical Round-Optimal Blind Signatures in the Standard Model
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
- Quantum proofs of knowledge
- Quasi-adaptive NIZK for linear subspaces revisited
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
- Securing threshold cryptosystems against chosen ciphertext attack
- Security arguments for digital signatures and blind signatures
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Structure-preserving signatures from standard assumptions, revisited
- Structure-preserving signatures on equivalence classes from standard assumptions
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Universal Electronic Cash
Cited in
(11)- Breaking parallel ROS: implication for isogeny and lattice-based blind signatures
- Pairing-free blind signatures from CDH assumptions
- Pairing-free blind signatures from standard assumptions in the ROM
- Blind signatures from proofs of inequality
- Intermundium-DL: assessing the resilience of current schemes to discrete-log-computation attacks on public parameters
- Practical blind signatures in pairing-free groups
- Tightly-secure blind signatures in pairing-free groups
- On the limits of non-interactive blind signatures
- Security amplification of threshold signatures in the standard model
- On non-interactive blind signatures in the plain model using complexity leveraging
- Threshold blind signatures from CDH
This page was built for publication: Practical round-optimal blind signatures in the ROM from standard assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562573)
