Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols (Q3073713): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Colin A. Boyd / rank
 
Normal rank
Property / author
 
Property / author: Juan Manuel González Nieto / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NAXOS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1548440180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Just fast keying / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stateless connections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4786018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The security of the cipher block chaining message authentication code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security Notions and Generic Constructions for Client Puzzles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security Amplification for Interactive Cryptographic Primitives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling and Proofs of Work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stronger Security of Authenticated Key Exchange / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Denial-of-Service-Resilient Key Agreement Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2770462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS / rank
 
Normal rank

Latest revision as of 18:57, 3 July 2024

scientific article
Language Label Description Also known as
English
Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols
scientific article

    Statements

    Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 February 2011
    0 references
    client puzzles
    0 references
    proof of work
    0 references
    denial of service resistance
    0 references
    protocols
    0 references

    Identifiers