Round-optimal blind signatures in the plain model from classical and quantum standard assumptions

DOI10.1007/978-3-030-77870-5_15zbMath1479.94326OpenAlexW3159307892MaRDI QIDQ2056693

Shuichi Katsumata, Takashi Yamakawa, Shota Yamada, Ryo Nishimaki

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-77870-5_15

blind-signature-conforming zero-knowledge

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (3)

Short pairing-free blind signatures with exponential security ⋮ Non-interactive blind signatures for random messages ⋮ The Abe-Okamoto partially blind signature scheme revisited

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Structure-preserving signatures and commitments to group elements
Smooth projective hashing and two-message oblivious transfer
Definitions and properties of zero-knowledge proof systems
A framework for universally composable non-committing blind signatures
Non-interactive non-malleability from quantum supremacy
Lower bounds and impossibility results for concurrent self composition
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
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
Signatures on Randomizable Ciphertexts
On Constructing 1-1 One-Way Functions
Practical Round-Optimal Blind Signatures in the Standard Model
Lattice problems in NP ∩ coNP
On the Impossibility of Three-Move Blind Signature Schemes
Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions
A Framework for Efficient and Composable Oblivious Transfer
Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
A practical secret voting scheme for large scale elections
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
Zaps and Their Applications
Efficient Non-interactive Proof Systems for Bilinear Groups
Round-Optimal Composable Blind Signatures in the Common Reference String Model
Efficient Round-Optimal Blind Signatures in the Standard Model
On lattices, learning with errors, random linear codes, and cryptography
On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Round-optimal blind signatures in the plain model from classical and quantum standard assumptions