Round-Optimal Composable Blind Signatures in the Common Reference String Model
From MaRDI portal
Publication:5756654
DOI10.1007/11818175_4zbMath1161.94441OpenAlexW1536662568MaRDI QIDQ5756654
Publication date: 4 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11818175_4
Related Items (32)
Structure-preserving signatures and commitments to group elements ⋮ Concurrent Secure Computation via Non-Black Box Simulation ⋮ Practical Round-Optimal Blind Signatures in the Standard Model ⋮ Constant-size structure-preserving signatures: generic constructions and simple assumptions ⋮ One-more unforgeability of blind ECDSA ⋮ BlindOR: an efficient lattice-based blind signature scheme from OR-proofs ⋮ Skipping the \(q\) in group signatures ⋮ A correction to a code-based blind signature scheme ⋮ Security of blind signatures revisited ⋮ A fast and simple partially oblivious PRF, with applications ⋮ Boosting the Security of Blind Signature Schemes ⋮ Adaptive Oblivious Transfer and Generalization ⋮ Non-interactive blind signatures for random messages ⋮ Rai-Choo! Evolving blind signatures to the next level ⋮ A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling ⋮ Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs ⋮ 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 ⋮ A framework for practical anonymous credentials from lattices ⋮ \textsf{CSI-Otter}: isogeny-based (partially) blind signatures from the class group action with a twist ⋮ The Abe-Okamoto partially blind signature scheme revisited ⋮ A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort ⋮ One-Round ID-Based Blind Signature Scheme without ROS Assumption ⋮ Equivocal Blind Signatures and Adaptive UC-Security ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Round-optimal blind signatures in the plain model from classical and quantum standard assumptions ⋮ An efficient blind signature scheme based on SM2 signature algorithm ⋮ Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions ⋮ Round-Optimal Blind Signatures from Waters Signatures ⋮ Efficient Round-Optimal Blind Signatures in the Standard Model ⋮ Anonymous tokens with private metadata bit ⋮ Lattice-based blind signatures, revisited
This page was built for publication: Round-Optimal Composable Blind Signatures in the Common Reference String Model
