Pairing-free blind signatures from CDH assumptions

DOI10.1007/978-3-031-68376-3_6MaRDI QIDQ6648192

Stefano Tessaro, Chenzhi Zhu, Rutchathon Chairattana-Apirom

Publication date: 4 December 2024

zbMATH Keywords

concurrently-secure blind signaturespairing-free group

Mathematics Subject Classification ID

Cryptography (94A60) 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?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient signature generation by smart cards
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• Security arguments for digital signatures and blind signatures
• Tightly-secure signatures from five-move identification protocols
• Short signatures from the Weil pairing
• The algebraic group model and its applications
• 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
• Post-quantum security of Fiat-Shamir
• Random Oracles in a Quantum World
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• 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
• An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
• Round-Optimal Composable Blind Signatures in the Common Reference String Model
• On the (in)security of ROS
• Boosting the Security of Blind Signature Schemes
• Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions
• Rai-Choo! Evolving blind signatures to the next level
• 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
• Fully adaptive Schnorr threshold signatures
• Snowblind: a threshold blind signature in pairing-free groups
• Practical round-optimal blind signatures in the ROM from standard assumptions
• Twinkle: threshold signatures from DDH with full adaptive security
• Toothpicks: more efficient fork-free two-round multi-signatures
• Concurrently secure blind Schnorr signatures
• Pairing-free blind signatures from standard assumptions in the ROM

This page was built for publication: Pairing-free blind signatures from CDH assumptions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648192)