The One-More Discrete Logarithm Assumption in the Generic Group Model

DOI10.1007/978-3-030-92068-5_20zbMath1514.94146OpenAlexW3176137886MaRDI QIDQ6041299

Balthazar Bauer, Georg Fuchsbauer, Antoine Plouviez

Publication date: 26 May 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-030-92068-5_20

zbMATH Keywords

blind signaturesgeneric group modelmulti-signaturesone-more discrete logarithm

Mathematics Subject Classification ID

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

Related Items (1)

Fully adaptive Schnorr threshold signatures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient discrete logarithm based multi-signature scheme in the plain public key model
• Another look at ``provable security
• Efficient signature generation by smart cards
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• Impossibility of the provable security of the Schnorr signature from the one-more DL assumption in the non-programmable random oracle model
• Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
• Compact multi-signatures for smaller blockchains
• The algebraic group model and its applications
• Complexity of a determinate algorithm for the discrete logarithm
• A classification of computational assumptions in the algebraic group model
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• MuSig2: simple two-round Schnorr multi-signatures
• Simple Schnorr multi-signatures with applications to bitcoin
• Short signatures without random oracles and the SDH assumption in bilinear groups
• 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
• On Tight Security Proofs for Schnorr Signatures
• Generic Hardness of the Multiple Discrete Logarithm Problem
• On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields
• Diffie-Hellman Oracles
• On the Impossibility of Three-Move Blind Signature Schemes
• Improved Bounds on Security Reductions for Discrete Log Based Signatures
• The Uber-Assumption Family
• Another look at non-standard discrete log and Diffie-Hellman problems
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures
• Advances in Cryptology - EUROCRYPT 2004
• Hierarchical Identity Based Encryption with Constant Size Ciphertext
• Limits of provable security from standard assumptions
• Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
• Separation Results on the “One-More” Computational Problems
• Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices
• Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
• Cryptography and Coding
• On the (in)security of ROS

This page was built for publication: The One-More Discrete Logarithm Assumption in the Generic Group Model