Optimal security proofs for full domain hash. Revisited (Q1747667): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
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/s00145-017-9257-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2607790354 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating Short Structure-Preserving Signatures from Non-interactive Assumptions / 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: Another look at ``provable security'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Exact Security of Digital Signatures-How to Sign with RSA and Rabin / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Tight Security for Rabin-Williams Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient signature schemes with tight reductions to the Diffie-Hellman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Small Root of a Univariate Modular Equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for hard lattices and new cryptographic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-Key Locally-Decodable Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying RSA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Instantiability of RSA-OAEP under Chosen-Plaintext Attack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Sound Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy trapdoor functions and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Validity of the Φ-Hiding Assumption in Cryptographic Protocols / rank
 
Normal rank

Latest revision as of 13:29, 15 July 2024

scientific article
Language Label Description Also known as
English
Optimal security proofs for full domain hash. Revisited
scientific article

    Statements

    Optimal security proofs for full domain hash. Revisited (English)
    0 references
    0 references
    0 references
    26 April 2018
    0 references
    digital signatures
    0 references
    full domain hash
    0 references
    lossiness
    0 references
    security reduction
    0 references

    Identifiers