The One-More Discrete Logarithm Assumption in the Generic Group Model (Q6041299): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-92068-5_20 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3176137886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short signatures without random oracles and the SDH assumption in bilinear groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical Identity Based Encryption with Constant Size Ciphertext / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact multi-signatures for smaller blockchains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification of computational assumptions in the algebraic group model / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Security of One-Witness Blind Signature Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (in)security of ROS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation Results on the “One-More” Computational Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Uber-Assumption Family / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671884 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility of the provable security of the Schnorr signature from the one-more DL assumption in the non-programmable random oracle model / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Tight Security Proofs for Schnorr Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebraic group model and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Impossibility of Three-Move Blind Signature Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds on Security Reductions for Discrete Log Based Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another look at ``provable security'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another look at non-standard discrete log and Diffie-Hellman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3561288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptography and Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Schnorr multi-signatures with applications to bitcoin / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diffie-Hellman Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient discrete logarithm based multi-signature scheme in the plain public key model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of a determinate algorithm for the discrete logarithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: MuSig2: simple two-round Schnorr multi-signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of provable security from standard assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security Proofs for Signature Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient signature generation by smart cards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic Hardness of the Multiple Discrete Logarithm Problem / rank
 
Normal rank

Latest revision as of 06:08, 1 August 2024

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

    The One-More Discrete Logarithm Assumption in the Generic Group Model (English)
    0 references
    0 references
    0 references
    0 references
    26 May 2023
    0 references
    0 references
    one-more discrete logarithm
    0 references
    generic group model
    0 references
    blind signatures
    0 references
    multi-signatures
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references