Security in Communication Networks

DOI10.1007/B105083MaRDI QIDQ5491695zbMATH OpenOpenAlexFDO

Authors Jan Camenisch, Maciej Koprowski, Bogdan Warinschi

Publication date 10 October 2006

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

Full work available at URL https://doi.org/10.1007/b105083

zbMATH Keywords

provably secure blind signature scheme

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Theory of Cryptography
• Concurrent Blind Signatures Without Random Oracles
• Efficient round-optimal blind signatures in the standard model
• Boosting the Security of Blind Signature Schemes
• Efficient Round Optimal Blind Signatures

Cited in

(33)

• Batch blind signatures on elliptic curves
• Efficient digital signatures from RSA without random oracles
• An efficient blind signature scheme based on SM2 signature algorithm
• Efficient signatures on randomizable ciphertexts
• BlindOR: an efficient lattice-based blind signature scheme from OR-proofs
• Short pairing-free blind signatures with exponential security
• Security of blind signatures revisited
• Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
• Sub-linear Blind Ring Signatures without Random Oracles
• Structure-preserving signatures and commitments to group elements
• Impossibility of blind signatures from one-way permutations
• Signatures on randomizable ciphertexts
• Compact E-Cash and Simulatable VRFs Revisited
• An efficient privacy-preserving e-coupon system
• Concurrent Blind Signatures Without Random Oracles
• On the impossibility of three-move blind signature schemes
• Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions
• One-Round ID-Based Blind Signature Scheme without ROS Assumption
• Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment
• scientific article; zbMATH DE number 1303137 (Why is no real title available?)
• Efficient Round Optimal Blind Signatures
• A Provably Secure Blind Signature Scheme
• Equivocal Blind Signatures and Adaptive UC-Security
• Round-Optimal Blind Signatures from Waters Signatures
• Efficient round-optimal blind signatures in the standard model
• A short paper on blind signatures from knowledge assumptions
• Theory of Cryptography
• Multi-theorem preprocessing NIZKs from lattices
• Provably secure randomized blind signature scheme based on bilinear pairing
• Boosting the Security of Blind Signature Schemes
• Security analysis of RSA-BSSA
• Pairing-free blind signatures from CDH assumptions
• Pairing-free blind signatures from standard assumptions in the ROM

This page was built for publication: Security in Communication Networks

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