PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more

DOI10.1007/978-3-031-15982-4_1MaRDI QIDQ6108972zbMATH OpenFDO

Authors Rutchathon Chairattana-Apirom, Lucjan Hanzlik, Julian Loss, Anna Lysyanskaya, Benedikt Wagner

Publication date 30 June 2023

Published in Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)

zbMATH Keywords

random oracle modelblind signaturescut-and-choosestandard assumptions

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Compact Round-Optimal Partially-Blind Signatures
• Efficient Partially Blind Signatures with Provable Security
• Theory of Cryptography
• Progress in Cryptology - INDOCRYPT 2003
• Efficient Partially Blind Signature Scheme with Provable Security
• Efficient Provably Secure Restrictive Partially Blind Signatures from Bilinear Pairings
• Round-Optimal Composable Blind Signatures in the Common Reference String Model
• Topics in Cryptology – CT-RSA 2005

Cites work

• 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 708798 (Why is no real title available?)
• scientific article; zbMATH DE number 1088232 (Why is no real title available?)
• scientific article; zbMATH DE number 2081084 (Why is no real title available?)
• A modular treatment of blind signatures from identification schemes
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• Boosting the Security of Blind Signature Schemes
• Efficient Round Optimal Blind Signatures
• Efficient noninteractive certification of RSA moduli and beyond
• Efficient round-optimal blind signatures in the standard model
• How to use indistinguishability obfuscation
• Lattice-based blind signatures, revisited
• On the (in)security of ROS
• Practical Round-Optimal Blind Signatures in the Standard Model
• Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
• Round optimal blind signatures
• Round-Optimal Composable Blind Signatures in the Common Reference String Model
• Security arguments for digital signatures and blind signatures
• Short pairing-free blind signatures with exponential security
• The algebraic group model and its applications
• 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
• Universal Electronic Cash

Cited in

(12)

• Boosting the Security of Blind Signature Schemes
• Non-interactive blind signatures for random messages
• Practical round-optimal blind signatures in the ROM from standard assumptions
• Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions
• Rai-Choo! Evolving blind signatures to the next level
• Concurrently secure blind Schnorr signatures
• Toothpicks: more efficient fork-free two-round multi-signatures
• Twinkle: threshold signatures from DDH with full adaptive security
• M\&M's: mix and match attacks on Schnorr-type blind signatures with repetition
• Pairing-free blind signatures from CDH assumptions
• Pairing-free blind signatures from standard assumptions in the ROM
• Oblivious issuance of proofs

This page was built for publication: PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more

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