Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions

DOI10.1007/978-3-319-44618-9_21MaRDI QIDQ2827730zbMATH OpenOpenAlexFDO

Authors Georg Fuchsbauer, Christian Hanser, Chethan Kamath, Daniel Slamanig

Publication date 21 October 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-44618-9_21

zbMATH Keywords

unforgeabilityEUF-CMA securitySPS-EQ scheme

Mathematics Subject Classification ID

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

Recommendations

• Practical Round-Optimal Blind Signatures in the Standard Model
• Efficient round-optimal blind signatures in the standard model
• Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
• Round optimal blind signatures
• Compact Round-Optimal Partially-Blind Signatures
• Efficient Round Optimal Blind Signatures
• Round-Optimal Blind Signatures from Waters Signatures
• scientific article; zbMATH DE number 1088904
• Identity-based blind signature from lattices in standard model
• Round-Optimal Composable Blind Signatures in the Common Reference String Model

Cites work

• scientific article; zbMATH DE number 1643939 (Why is no real title available?)
• scientific article; zbMATH DE number 1722675 (Why is no real title available?)
• scientific article; zbMATH DE number 3825707 (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 2086712 (Why is no real title available?)
• Attack against a pairing based anonymous authentication protocol
• Beyond the limitation of prime-order bilinear groups, and round optimal blind signatures
• Bounded-concurrent secure two-party computation without setup assumptions
• Compact Round-Optimal Partially-Blind Signatures
• Constant-size structure-preserving signatures: generic constructions and simple assumptions
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Efficient Round Optimal Blind Signatures
• On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
• On the impossibility of three-move blind signature schemes
• Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
• Pairing-Friendly Elliptic Curves of Prime Order
• Practical Round-Optimal Blind Signatures in the Standard Model
• Round optimal blind signatures
• Round-Optimal Composable Blind Signatures in the Common Reference String Model
• Round-optimal privacy-preserving protocols with smooth projective hash functions
• Security arguments for digital signatures and blind signatures
• Security in Communication Networks
• Security of Blind Signatures under Aborts
• Security of blind signatures revisited
• Short structure-preserving signatures
• Signatures on randomizable ciphertexts
• Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds
• Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
• Structure-preserving signatures and commitments to group elements
• Structure-preserving signatures from standard assumptions, revisited
• Structure-preserving signatures from type II pairings
• 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
• Topics in Cryptology – CT-RSA 2006
• Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
• Waters signatures with optimal security reduction

Cited in

(25)

• 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
• Interactive threshold mercurial signatures and applications
• Non-interactive blind signatures: post-quantum and stronger security
• On security proofs of existing equivalence class signature schemes
• Round-Optimal Blind Signatures from Waters Signatures
• Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes
• Practical Round-Optimal Blind Signatures in the Standard Model
• Practical Time Capsule Signatures in the Standard Model from Bilinear Maps
• Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
• Tanuki: new frameworks for (concurrently secure) blind signatures from post-quantum group actions
• Anonymous tokens with public metadata and applications to private contact tracing
• Round optimal blind signatures
• How to obtain fully structure-preserving (automorphic) signatures from structure-preserving ones
• On proving equivalence class signatures secure from non-interactive assumptions
• Short pairing-free blind signatures with exponential security
• Efficient round-optimal blind signatures in the standard model
• Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
• Multi-theorem preprocessing NIZKs from lattices
• Concurrently secure blind Schnorr signatures
• Pairing-free blind signatures from standard assumptions in the ROM
• A short paper on blind signatures from knowledge assumptions
• Anonymous tokens with private metadata bit
• 1-out-of-n oblivious signatures: security revisited and a generic construction with an efficient communication cost

This page was built for publication: Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions

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