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

scientific article; zbMATH DE number 7689426

Language	Label	Description	Also known as
English	The One-More Discrete Logarithm Assumption in the Generic Group Model	scientific article; zbMATH DE number 7689426

Statements

instance of

scholarly article

0 references

title

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

0 references

zbMATH Open document ID

1514.94146

0 references

DOI

10.1007/978-3-030-92068-5_20

0 references

0 references

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

26 May 2023

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

one-more discrete logarithm

0 references

generic group model

0 references

blind signatures

0 references

multi-signatures

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-92068-5_20

0 references

OpenAlex ID

W3176137886

0 references

cites work

Short signatures without random oracles and the SDH assumption in bilinear groups

0 references

Hierarchical Identity Based Encryption with Constant Size Ciphertext

0 references

Compact multi-signatures for smaller blockchains

0 references

A classification of computational assumptions in the algebraic group model

0 references

On the Security of One-Witness Blind Signature Schemes

0 references

On the (in)security of ROS

0 references

Separation Results on the “One-More” Computational Problems

0 references

Advances in Cryptology - EUROCRYPT 2004

0 references

The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme

0 references

Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme

0 references

The Uber-Assumption Family

0 references

Q4409116

0 references

Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles

0 references

Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models

0 references

Q3671884

0 references

Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures

0 references

Impossibility of the provable security of the Schnorr signature from the one-more DL assumption in the non-programmable random oracle model

0 references

On Tight Security Proofs for Schnorr Signatures

0 references

The algebraic group model and its applications

0 references

Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model

0 references

On the Impossibility of Three-Move Blind Signature Schemes

0 references

Improved Bounds on Security Reductions for Discrete Log Based Signatures

0 references

Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices

0 references

On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields

0 references

Another look at ``provable security''

0 references

Another look at non-standard discrete log and Diffie-Hellman problems

0 references

Q3561288

0 references

Cryptography and Coding

0 references

Simple Schnorr multi-signatures with applications to bitcoin

0 references

Q4472077

0 references

Diffie-Hellman Oracles

0 references

Efficient discrete logarithm based multi-signature scheme in the plain public key model

0 references

Complexity of a determinate algorithm for the discrete logarithm

0 references

MuSig2: simple two-round Schnorr multi-signatures

0 references

Q2724585

0 references

Limits of provable security from standard assumptions

0 references

Security Proofs for Signature Schemes

0 references

Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log

0 references

Efficient signature generation by smart cards

0 references

Q4473566

0 references

On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model

0 references

Generic Hardness of the Multiple Discrete Logarithm Problem

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6041299