Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
From MaRDI portal
Publication:2119006
DOI10.1007/978-3-030-45724-2_3zbMath1492.94187OpenAlexW3022524423MaRDI QIDQ2119006
Georg Fuchsbauer, Antoine Plouviez, Yannick Seurin
Publication date: 23 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-45724-2_3
Related Items (34)
Two-round trip Schnorr multi-signatures via delinearized witnesses ⋮ MuSig2: simple two-round Schnorr multi-signatures ⋮ Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols ⋮ Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures ⋮ Tight state-restoration soundness in the algebraic group model ⋮ One-more unforgeability of blind ECDSA ⋮ The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures ⋮ 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 ⋮ Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge ⋮ Chain Reductions for Multi-signatures and the HBMS Scheme ⋮ On the (im)possibility of secure ElGamal blind signatures ⋮ Multi-user CDH problems and the concrete security of \(\mathsf{NAXOS}\) and \(\mathsf{X3DH}\) ⋮ PFLM: privacy-preserving federated learning with membership proof ⋮ Hardening signature schemes via derive-then-derandomize: stronger security proofs for EdDSA ⋮ Security analysis of RSA-BSSA ⋮ Classical and quantum security of elliptic curve VRF, via relative indifferentiability ⋮ 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 ⋮ Half-aggregation of Schnorr signatures with tight reductions ⋮ On pairing-free blind signature schemes in the algebraic group model ⋮ Non-interactive Mimblewimble transactions, revisited ⋮ Snarky ceremonies ⋮ Algebraic adversaries in the universal composability framework ⋮ An analysis of the algebraic group model ⋮ Snowblind: a threshold blind signature in pairing-free groups ⋮ Practical Schnorr threshold signatures without the algebraic group model ⋮ On the (in)security of ROS ⋮ On the (in)security of ROS ⋮ An efficient blind signature scheme based on SM2 signature algorithm ⋮ Anonymous tokens with private metadata bit ⋮ A classification of computational assumptions in the algebraic group model
Uses Software
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
- Unnamed Item
- The extended \(k\)-tree algorithm
- Some (in)sufficient conditions for secure hybrid encryption
- 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
- Securing threshold cryptosystems against chosen ciphertext attack
- Compact multi-signatures for smaller blockchains
- Short signatures from the Weil pairing
- The algebraic group model and its applications
- Complexity of a determinate algorithm for the discrete logarithm
- A modular treatment of blind signatures from identification schemes
- Simple Schnorr multi-signatures with applications to bitcoin
- On tight security proofs for Schnorr signatures
- Refinements of the k-tree Algorithm for the Generalized Birthday Problem
- On the Hardness of Proving CCA-Security of Signed ElGamal
- On the Security of One-Witness Blind Signature Schemes
- Security Proofs for Signature Schemes
- On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model
- Commuting Signatures and Verifiable Encryption
- High-Speed High-Security Signatures
- Randomizable Proofs and Delegatable Anonymous Credentials
- Practical Round-Optimal Blind Signatures in the Standard Model
- Simplified Submission of Inputs to Protocols
- On the Impossibility of Three-Move Blind Signature Schemes
- Improved Bounds on Security Reductions for Discrete Log Based Signatures
- 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
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- A Robust and Plaintext-Aware Variant of Signed ElGamal Encryption
- Round Optimal Blind Signatures
- Compact E-Cash
- Efficient Round Optimal Blind Signatures
- Limits of provable security from standard assumptions
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
This page was built for publication: Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
