On the (in)security of ROS

DOI10.1007/978-3-030-77870-5_2zbMath1479.94294OpenAlexW3082474598MaRDI QIDQ5918406

Mariana Raykova, Fabrice Benhamouda, Tancrède Lepoint, Michele Orrù, Julian Loss

Publication date: 8 December 2021

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

Full work available at URL: https://doi.org/10.1007/978-3-030-77870-5_2

zbMATH Keywords

blind signaturespartially blind signaturesrandom inhomogeneities in a overdetermined solvable system of linear equationswitness indistinguishability

Mathematics Subject Classification ID

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

Related Items (25)

Two-round trip Schnorr multi-signatures via delinearized witnesses ⋮ MuSig2: simple two-round Schnorr multi-signatures ⋮ FROST: Flexible round-optimized Schnorr threshold signatures ⋮ One-more unforgeability of blind ECDSA ⋮ A fast and simple partially oblivious PRF, with applications ⋮ Short pairing-free blind signatures with exponential security ⋮ Boosting the Security of Blind Signature Schemes ⋮ The One-More Discrete Logarithm Assumption in the Generic Group Model ⋮ On the (im)possibility of secure ElGamal blind signatures ⋮ Security analysis of RSA-BSSA ⋮ Threshold and multi-signature schemes from linear hash functions ⋮ Rai-Choo! Evolving blind signatures to the next level ⋮ MuSig-L: lattice-based multi-signature with single-round online phase ⋮ 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 ⋮ Efficient lattice-based blind signatures via Gaussian one-time signatures ⋮ \textsf{CSI-Otter}: isogeny-based (partially) blind signatures from the class group action with a twist ⋮ Universally composable \(\varSigma \)-protocols in the global random-oracle model ⋮ The Abe-Okamoto partially blind signature scheme revisited ⋮ Fully adaptive Schnorr threshold signatures ⋮ Snowblind: a threshold blind signature in pairing-free groups ⋮ \textsf{DualMS}: efficient lattice-based two-round multi-signature with trapdoor-free simulation ⋮ Unnamed Item ⋮ Aggregatable distributed key generation ⋮ ATSSIA: asynchronous truly-threshold Schnorr signing for inconsistent availability

Cites Work

• Secure distributed key generation for discrete-log based cryptosystems
• Security arguments for digital signatures and blind signatures
• Lattice-based blind signatures, revisited
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• A modular treatment of blind signatures from identification schemes
• Simple Schnorr multi-signatures with applications to bitcoin
• Efficient Provably Secure Restrictive Partially Blind Signatures from Bilinear Pairings
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• Information Security and Privacy
• Topics in Cryptology – CT-RSA 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the (in)security of ROS