Pairing-free blind signatures from standard assumptions in the ROM
From MaRDI portal
Publication:6648193
DOI10.1007/978-3-031-68376-3_7MaRDI QIDQ6648193
Michael Reichle, Julia Kastner, Ky T. Nguyen
Publication date: 4 December 2024
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Structure-preserving signatures and commitments to group elements
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- Security arguments for digital signatures and blind signatures
- Improved (almost) tightly-secure simulation-sound QA-NIZK with applications
- Subversion-zero-knowledge SNARKs
- Equipping public-key cryptographic primitives with watermarking (or: a hole is to watermark)
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- Short pairing-free blind signatures with exponential security
- A modular treatment of blind signatures from identification schemes
- Lower bounds and impossibility results for concurrent self composition
- Acyclicity programming for sigma-protocols
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
- Beyond the Limitation of Prime-Order Bilinear Groups, and Round Optimal Blind Signatures
- Compact Round-Optimal Partially-Blind Signatures
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
- Signatures on Randomizable Ciphertexts
- Practical Round-Optimal Blind Signatures in the Standard Model
- On the Impossibility of Three-Move Blind Signature Schemes
- Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions
- A Framework for Universally Composable Non-committing Blind Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The number of primes in a short interval.
- Universal Electronic Cash
- A practical secret voting scheme for large scale elections
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- The Cramer-Shoup Strong-RSA Signature Scheme Revisited
- The Differences Between Consecutive Primes, V
- Round Optimal Blind Signatures
- Efficient Round Optimal Blind Signatures
- Limits of provable security from standard assumptions
- Advances in Cryptology - CRYPTO 2003
- Removing the Strong RSA Assumption from Arguments over the Integers
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
- Efficient Round-Optimal Blind Signatures in the Standard Model
- On the (in)security of ROS
- On the difference between consecutive primes
- Boosting the Security of Blind Signature Schemes
- A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling
- PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more
- On pairing-free blind signature schemes in the algebraic group model
- \textsf{CSI-Otter}: isogeny-based (partially) blind signatures from the class group action with a twist
- Fiat-Shamir transformation of multi-round interactive proofs
- The Abe-Okamoto partially blind signature scheme revisited
- Snowblind: a threshold blind signature in pairing-free groups
Related Items (1)
This page was built for publication: Pairing-free blind signatures from standard assumptions in the ROM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648193)
