Security of blind discrete log signatures against interactive attacks

DOI10.1007/3-540-45600-7_1MaRDI QIDQ4473566zbMATH OpenFDO

Authors Claus Peter Schnorr

Publication date 4 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2229/22290001.htm, https://nbn-resolving.org/urn:nbn:de:hebis:30-12026

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Enhancing the security of perfect blind DL-signatures
• On the (in)security of ROS
• On the (in)security of ROS
• On the exact security of Schnorr-type signatures in the random oracle model
• Improved Bounds on Security Reductions for Discrete Log Based Signatures

Cited in

(44)

• Practical and robust secure logging from fault-tolerant sequential aggregate signatures
• Anonymous tokens with private metadata bit
• Lattice-based blind signatures, revisited
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• Two-round trip Schnorr multi-signatures via delinearized witnesses
• MuSig2: simple two-round Schnorr multi-signatures
• One-more unforgeability of blind ECDSA
• Short pairing-free blind signatures with exponential security
• Enhancing the security of perfect blind DL-signatures
• Forward-secure multisignature and blind signature schemes
• One-Round ID-Based Blind Signature Scheme without ROS Assumption
• Blind signatures based on the discrete logarithm problem
• Impact of randomization in VKO mechanisms on overall security level
• Separation Results on the “One-More” Computational Problems
• Machine-checked security proofs of cryptographic signature schemes
• On the (in)security of ROS
• On the (in)security of ROS
• 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
• Rai-Choo! Evolving blind signatures to the next level
• A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling
• On pairing-free blind signature schemes in the algebraic group model
• \textsf{CSI-Otter}: isogeny-based (partially) blind signatures from the class group action with a twist
• The Abe-Okamoto partially blind signature scheme revisited
• Snowblind: a threshold blind signature in pairing-free groups
• CSI-Otter: isogeny-based (partially) blind signatures from the class group action with a twist
• Breaking parallel ROS: implication for isogeny and lattice-based blind signatures
• Concurrently secure blind Schnorr signatures
• M\&M's: mix and match attacks on Schnorr-type blind signatures with repetition
• On the unforgeability of the Chaum-Pedersen blind signature scheme
• Pairing-free blind signatures from standard assumptions in the ROM
• Oblivious issuance of proofs
• Shared-custodial password-authenticated deterministic wallets
• On Wagner's k-tree algorithm over integers
• A plausible attack on the adaptive security of threshold Schnorr signatures
• One-more unforgeability for multi- and threshold signatures
• Practical blind signatures in pairing-free groups
• Adaptively secure threshold blind BLS signatures and threshold oblivious PRF
• Dimensional e\textsf{ROS}ion: improving the \textsf{ROS} attack with decomposition in higher bases
• Unforgeability of blind Schnorr in the limited concurrency setting
• Post-quantum (partially) blind signatures from matrix code equivalence
• FROST: Flexible round-optimized Schnorr threshold signatures

This page was built for publication: Security of blind discrete log signatures against interactive attacks

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