On non-interactive blind signatures in the plain model using complexity leveraging

DOI10.1007/978-3-032-07035-7_19MaRDI QIDQ7289784zbMATH OpenFDO

Authors Kazuki Yamamura, Tetsuya Okuda, Eiichiro Fujisaki

Publication date 3 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-07035-7_19

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites work

• A generic approach to constructing and proving verifiable random functions
• A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling
• Adaptive Security of Constrained PRFs
• Advances in Cryptology - CRYPTO 2003
• Blind Signature System
• Defeating Malicious Servers in a Blind Signatures Based Voting System
• Definitions and properties of zero-knowledge proof systems
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Efficient Round Optimal Blind Signatures
• scientific article; zbMATH DE number 3825707 (Why is no real title available?)
• scientific article; zbMATH DE number 2009954 (Why is no real title available?)
• Limits of provable security from standard assumptions
• Non-interactive blind signatures for random messages
• Non-interactive blind signatures from RSA assumption and more
• Non-interactive blind signatures: post-quantum and stronger security
• Non-interactive non-malleability from quantum supremacy
• Non-interactive Zaps and New Techniques for NIZK
• On the impossibility of three-move blind signature schemes
• On the Security of One-Witness Blind Signature Schemes
• Practical round-optimal blind signatures in the ROM from standard assumptions
• Rai-Choo! Evolving blind signatures to the next level
• Ring signatures: logarithmic-size, no setup -- from standard assumptions
• Round optimal blind signatures
• Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
• Round-Optimal Composable Blind Signatures in the Common Reference String Model
• Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
• The round complexity of quantum zero-knowledge
• ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
• Zaps and their applications

This page was built for publication: On non-interactive blind signatures in the plain model using complexity leveraging

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