Concurrently secure blind Schnorr signatures

DOI10.1007/978-3-031-58723-8_5MaRDI QIDQ6636502

Publication date: 12 November 2024

implementation Schnorr signatures Bitcoin concurrent security (partially) blind signatures

Cryptography (94A60) Elliptic curves (14H52) Authentication, digital signatures and secret sharing (94A62)

Related Items (3)

Pairing-free blind signatures from CDH assumptions ⋮ Oblivious issuance of proofs ⋮ Shared-custodial password-authenticated deterministic wallets

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Updatable and universal common reference strings with applications to zk-SNARKs
Minimum disclosure proofs of knowledge
Definitions and properties of zero-knowledge proof systems
The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
Security arguments for digital signatures and blind signatures
Non-interactive zaps of knowledge
On the one-per-message unforgeability of (EC)DSA and its variants
Compact multi-signatures for smaller blockchains
Subversion-zero-knowledge SNARKs
The algebraic group model and its applications
Complexity of a determinate algorithm for the discrete logarithm
Transparent SNARKs from DARK compilers
Marlin: preprocessing zkSNARKs with universal and updatable SRS
\textsc{Fractal}: post-quantum and transparent recursive proofs from holography
Transferable e-cash: a cleaner model and the first practical instantiation
Lattice-based blind signatures, revisited
Spartan: efficient and general-purpose zkSNARKs without trusted setup
Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
Short pairing-free blind signatures with exponential security
Algebraic cryptanalysis of STARK-friendly designs: application to MARVELlous and MiMC
A taxonomy of pairing-friendly elliptic curves
Tumblebit$++$: a comprehensive privacy protocol providing anonymity and amount-invisibility
Aurora: transparent succinct arguments for R1CS
Simple Schnorr multi-signatures with applications to bitcoin
On the Security of the Schnorr Signature Scheme and DSA Against Related-Key Attacks
Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
Security Proofs for Signature Schemes
NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
Compact E-Cash and Simulatable VRFs Revisited
Practical Round-Optimal Blind Signatures in the Standard Model
Constructing elliptic curves of prime order
Concurrent Blind Signatures Without Random Oracles
Structure-Preserving Signatures and Commitments to Group Elements
Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions
A public key cryptosystem and a signature scheme based on discrete logarithms
Universal Electronic Cash
A practical secret voting scheme for large scale elections
Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
Amicable Pairs and Aliquot Cycles for Elliptic Curves
Fast Reed-Solomon Interactive Oracle Proofs of Proximity
Round Optimal Blind Signatures
Advances in Cryptology – CRYPTO 2004
Efficient Round Optimal Blind Signatures
Pairing-Friendly Elliptic Curves of Prime Order
Zaps and Their Applications
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
On the Size of Pairing-Based Non-interactive Arguments
Round-Optimal Composable Blind Signatures in the Common Reference String Model
Efficient Round-Optimal Blind Signatures in the Standard Model
A Short Paper on Blind Signatures from Knowledge Assumptions
Theory of Cryptography
On the (in)security of ROS
Boosting the Security of Blind Signature Schemes
The One-More Discrete Logarithm Assumption in the Generic Group Model
HyperPlonk: Plonk with linear-time prover and high-degree custom gates
Rai-Choo! Evolving blind signatures to the next level
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
Non-interactive Mimblewimble transactions, revisited
Snarky ceremonies
Better than advertised security for non-interactive threshold signatures
Threshold signatures with private accountability
Snowblind: a threshold blind signature in pairing-free groups
Protostar: generic efficient accumulation/folding for special-sound protocols
Limits in the provable security of ECDSA signatures

This page was built for publication: Concurrently secure blind Schnorr signatures