Security in Communication Networks

DOI10.1007/b105083zbMath1116.94311OpenAlexW2983337624MaRDI QIDQ5491695

Maciej Koprowski, Bogdan Warinschi, Jan Camenisch

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)

Related Items (12)

Structure-preserving signatures and commitments to group elements ⋮ An Efficient Privacy-Preserving E-coupon System ⋮ Security of blind signatures revisited ⋮ One-Round ID-Based Blind Signature Scheme without ROS Assumption ⋮ Equivocal Blind Signatures and Adaptive UC-Security ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment ⋮ An efficient blind signature scheme based on SM2 signature algorithm ⋮ Compact E-Cash and Simulatable VRFs Revisited ⋮ 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

This page was built for publication: Security in Communication Networks