Towards a security model for computational puzzle schemes (Q3101621): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4786018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341756 / 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: Applied Cryptography and Network Security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Timed Release of Standard Digital Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure communications over insecure channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of a determinate algorithm for the discrete logarithm / rank
 
Normal rank

Latest revision as of 16:33, 4 July 2024

scientific article
Language Label Description Also known as
English
Towards a security model for computational puzzle schemes
scientific article

    Statements

    Towards a security model for computational puzzle schemes (English)
    0 references
    0 references
    0 references
    29 November 2011
    0 references
    computational puzzle
    0 references
    determinable difficulty
    0 references
    parallelization
    0 references

    Identifiers