Rai-Choo! Evolving blind signatures to the next level

DOI10.1007/978-3-031-30589-4_26zbMath1528.94099OpenAlexW4365934469MaRDI QIDQ6083687

Julian Loss, Benedikt Wagner, Lucjan Hanzlik

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_26

zbMATH Keywords

random oracle modelblind signaturescut-and-chooseround complexitycomputation complexitystandard assumptions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparing two pairing-based aggregate signature schemes
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• Security arguments for digital signatures and blind signatures
• The algebraic group model and its applications
• Security and composition of multiparty cryptographic protocols
• Lattice-based blind signatures, revisited
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• Batch-OT with optimal rate
• Short pairing-free blind signatures with exponential security
• A modular treatment of blind signatures from identification schemes
• On the Security of One-Witness Blind Signature Schemes
• Practical Round-Optimal Blind Signatures in the Standard Model
• On the Impossibility of Three-Move Blind Signature Schemes
• Universal Electronic Cash
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• Round Optimal Blind Signatures
• Efficient Round Optimal Blind Signatures
• Limits of provable security from standard assumptions
• Advances in Cryptology - CRYPTO 2003
• Round-Optimal Composable Blind Signatures in the Common Reference String Model
• Efficient Round-Optimal Blind Signatures in the Standard Model
• Theory of Cryptography
• On the (in)security of ROS
• 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

This page was built for publication: Rai-Choo! Evolving blind signatures to the next level