Security analysis of RSA-BSSA

DOI10.1007/978-3-031-31368-4_10zbMath1527.94051OpenAlexW4367663881MaRDI QIDQ6070761

Anna Lysyanskaya

Publication date: 24 November 2023

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

Full work available at URL: https://doi.org/10.1007/978-3-031-31368-4_10

zbMATH Keywords

blind signature schemeprivacy-preserving web browsing

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Snowblind: a threshold blind signature in pairing-free groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient signature generation by smart cards
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• Security arguments for digital signatures and blind signatures
• Public key signatures in the multi-user setting.
• Lattice-based blind signatures, revisited
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• Short pairing-free blind signatures with exponential security
• Efficient noninteractive certification of RSA moduli and beyond
• A modular treatment of blind signatures from identification schemes
• The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
• Security of Blind Signatures Revisited
• Random Oracles with(out) Programmability
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• Blind Signature System
• Topics in Cryptology – CT-RSA 2006
• On the (in)security of ROS

This page was built for publication: Security analysis of RSA-BSSA