Pages that link to "Item:Q5451061"
From MaRDI portal
The following pages link to Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log (Q5451061):
Displaying 50 items.
- Generic construction for tightly-secure signatures from discrete log (Q820557) (← links)
- The random oracle model: a twenty-year retrospective (Q887442) (← links)
- A synthetic indifferentiability analysis of some block-cipher-based hash functions (Q1009050) (← links)
- On the tightness of forward-secure signature reductions (Q1715854) (← links)
- Signatures from sequential-OR proofs (Q2055653) (← links)
- Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512 (Q2055690) (← links)
- Impossibility on tamper-resilient cryptography with uniqueness properties (Q2061927) (← links)
- More efficient digital signatures with tight multi-user security (Q2061945) (← links)
- A classification of computational assumptions in the algebraic group model (Q2096519) (← links)
- Black-box use of one-way functions is useless for optimal fair coin-tossing (Q2096541) (← links)
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model (Q2119006) (← links)
- On instantiating the algebraic group model from falsifiable assumptions (Q2119007) (← links)
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols (Q2120075) (← links)
- Another look at extraction and randomization of Groth's zk-SNARK (Q2145409) (← links)
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures (Q2152049) (← links)
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption (Q2152147) (← links)
- Logarithmic-size ring signatures with tight security from the DDH assumption (Q2167754) (← links)
- Optimal tightness for chain-based unique signatures (Q2170062) (← links)
- Identity-based signatures in standard model (Q2317833) (← links)
- Simple Schnorr multi-signatures with applications to bitcoin (Q2324793) (← links)
- On tight security proofs for Schnorr signatures (Q2423848) (← links)
- On tightly-secure (linkable) ring signatures (Q2673067) (← links)
- Optimal Security Proofs for Signatures from Identification Schemes (Q2829210) (← links)
- Another Look at Tightness (Q2889878) (← links)
- On the Joint Security of Encryption and Signature in EMV (Q2890000) (← links)
- Towards Non-Black-Box Separations of Public Key Encryption and One Way Function (Q3181026) (← links)
- On Related-Secret Pseudorandomness (Q3408199) (← links)
- Improved Bounds on Security Reductions for Discrete Log Based Signatures (Q3600215) (← links)
- Hash function requirements for Schnorr signatures (Q3632752) (← links)
- Anonymity from Public Key Encryption to Undeniable Signatures (Q3637142) (← links)
- Tighter Reductions for Forward-Secure Signature Schemes (Q4916016) (← links)
- On methods of shortening ElGamal-type signatures (Q5071464) (← links)
- Separation Results on the “One-More” Computational Problems (Q5458933) (← links)
- Digital Signatures with Memory-Tight Security in the Multi-challenge Setting (Q6041292) (← links)
- The One-More Discrete Logarithm Assumption in the Generic Group Model (Q6041299) (← links)
- Chain Reductions for Multi-signatures and the HBMS Scheme (Q6045076) (← links)
- On pairing-free blind signature schemes in the algebraic group model (Q6113966) (← links)
- The price of verifiability: lower bounds for verifiable random functions (Q6169431) (← links)
- An analysis of the algebraic group model (Q6175979) (← links)
- Adaptive Proofs Have Straightline Extractors (in the Random Oracle Model) (Q6487208) (← links)
- Toward tight security of the Galindo-Garcia identity-based signature (Q6535386) (← links)
- A tightly secure ID-based signature scheme under DL assumption in AGM (Q6535485) (← links)
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \(\Sigma\)-protocols (Q6570528) (← links)
- Generic-group lower bounds via reductions between geometric-search problems: with and without preprocessing (Q6582221) (← links)
- Limits in the provable security of ECDSA signatures (Q6587956) (← links)
- On proving equivalence class signatures secure from non-interactive assumptions (Q6635743) (← links)
- Vector commitments with proofs of smallness: short range proofs and more (Q6635763) (← links)
- New limits of provable security and applications to ElGamal encryption (Q6637527) (← links)
- \textsc{Zeromorph}: zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments (Q6639502) (← links)
- Generic and algebraic computation models: when AGM proofs transfer to the GGM (Q6652959) (← links)
