Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks (Q2958121): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficiently Computing Data-Independent Memory-Hard Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-Robust Graphs and Their Cumulative Memory Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: High Parallel Complexity Graphs and Memory-Hard Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs of Space: When Space Is of the Essence / rank
 
Normal rank
Property / cites work
 
Property / cites work: BLAKE2: Simpler, Smaller, Fast as MD5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-instance Security and Its Application to Password-Based Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time/Space Trade-Offs for Reversible Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-uniform Cracks in the Concrete: The Power of Free Precomputation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Keccak / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tradeoff Cryptanalysis of Memory-Hard Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mitigating Dictionary Attacks on Password-Protected Local Storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / 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: Proofs of Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Time Computable Self-erasing Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory-Demanding Password Scrambling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource-based corruptions and the combinatorics of hidden diversity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Software protection and simulation on oblivious RAMs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Time Versus Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically tight bounds on time-space trade-offs in a pebble game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Cryptology – CT-RSA 2006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4185781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space trade-offs in a pebble game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space bounds for a game on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time-Space Trade-Off / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of Space from Stacked Expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalizing Human Ignorance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Register Allocation Problems / 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: Time-space tradeoffs for computing functions, using connectivity properties of their circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient cache attacks on AES, and countermeasures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4164821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707453 / rank
 
Normal rank

Latest revision as of 08:22, 13 July 2024

scientific article
Language Label Description Also known as
English
Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks
scientific article

    Statements

    Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks (English)
    0 references
    0 references
    0 references
    0 references
    1 February 2017
    0 references
    memory-hard functions
    0 references
    password hashing
    0 references
    pebbling arguments
    0 references
    time-space trade-offs
    0 references
    sandwich graph
    0 references
    Argon2
    0 references
    scrypt
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers