[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/3133956.3134031acmconferencesArticle/Chapter ViewAbstractPublication PagesccsConference Proceedingsconference-collections
research-article

Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions

Published: 30 October 2017 Publication History

Abstract

A memory-hard function (MHF) ƒn with parameter n can be computed in sequential time and space n. Simultaneously, a high amortized parallel area-time complexity (aAT) is incurred per evaluation. In practice, MHFs are used to limit the rate at which an adversary (using a custom computational device) can evaluate a security sensitive function that still occasionally needs to be evaluated by honest users (using an off-the-shelf general purpose device). The most prevalent examples of such sensitive functions are Key Derivation Functions (KDFs) and password hashing algorithms where rate limits help mitigate off-line dictionary attacks. As the honest users' inputs to these functions are often (low-entropy) passwords special attention is given to a class of side-channel resistant MHFs called iMHFs.
Essentially all iMHFs can be viewed as some mode of operation (making n calls to some round function) given by a directed acyclic graph (DAG) with very low indegree. Recently, a combinatorial property of a DAG has been identified (called "depth-robustness") which results in good provable security for an iMHF based on that DAG. Depth-robust DAGs have also proven useful in other cryptographic applications. Unfortunately, up till now, all known very depth-robust DAGs are impractically complicated and little is known about their exact (i.e. non-asymptotic) depth-robustness both in theory and in practice.
In this work we build and analyze (both formally and empirically) several exceedingly simple and efficient to navigate practical DAGs for use in iMHFs and other applications. For each DAG we:
Prove that their depth-robustness is asymptotically maximal.
Prove bounds of at least 3 orders of magnitude better on their exact depth-robustness compared to known bounds for other practical iMHF.
Implement and empirically evaluate their depth-robustness and aAT against a variety of state-of-the art (and several new) depth-reduction and low aAT attacks. We find that, against all attacks, the new DAGs perform significantly better in practice than Argon2i, the most widely deployed iMHF in practice.
Along the way we also improve the best known empirical attacks on the aAT of Argon2i by implementing and testing several heuristic versions of a (hitherto purely theoretical) depth-reduction attack. Finally, we demonstrate practicality of our constructions by modifying the Argon2i code base to use one of the new high aAT DAGs. Experimental benchmarks on a standard off-the-shelf CPU show that the new modifications do not adversely affect the impressive throughput of Argon2i (despite seemingly enjoying significantly higher aAT).

Supplemental Material

MP4 File

References

[1]
Martin Abadi, Mike Burrows, Mark Manasse, and Ted Wobber 2005. Moderately Hard, Memory-bound Functions. ACM Trans. Internet Technol. Vol. 5, 2 (May 2005), 299--327. /10.1109/SFCS.1983.38
[2]
Leslie G. Valiant. 1977. Graph-Theoretic Arguments in Low-Level Complexity. Mathematical Foundations of Computer Science 1977, 6th Symposium, Tatranska Lomnica, Czechoslovakia, September 5-9, 1977, Proceedings (Lecture Notes in Computer Science), Jozef Gruska (Ed.), Vol. Vol. 53. Springer, 162--176. https://doi.org/10.1007/3-540-08353-7_135
[3]
Vitalik Buterin. 2013. Ethereum. (2013). https://www.ethereum.org/
[4]
Hongjun Wu. 2015. POMELO -- A Password Hashing Algorithm. (2015).
[5]
Zerocoin Electric Coin Company. 2016. ZCash. (2016). https://z.cash/

Cited By

View all

Index Terms

  1. Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    CCS '17: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security
    October 2017
    2682 pages
    ISBN:9781450349468
    DOI:10.1145/3133956
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 30 October 2017

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. depth-robust graphs
    2. hash functions
    3. key stretching
    4. memory hard functions

    Qualifiers

    • Research-article

    Funding Sources

    • European Research Council, ERC consolidator grant

    Conference

    CCS '17
    Sponsor:

    Acceptance Rates

    CCS '17 Paper Acceptance Rate 151 of 836 submissions, 18%;
    Overall Acceptance Rate 1,261 of 6,999 submissions, 18%

    Upcoming Conference

    CCS '25

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)13
    • Downloads (Last 6 weeks)4
    Reflects downloads up to 03 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Software-Based Memory Erasure with Relaxed Isolation Requirements2024 IEEE 37th Computer Security Foundations Symposium (CSF)10.1109/CSF61375.2024.00022(01-16)Online publication date: 8-Jul-2024
    • (2024)Cost-asymmetric memory hard password hashingInformation and Computation10.1016/j.ic.2023.105134297:COnline publication date: 2-Jul-2024
    • (2024)Bandwidth-Hard Functions: Reductions and Lower BoundsJournal of Cryptology10.1007/s00145-024-09497-337:2Online publication date: 12-Mar-2024
    • (2024)A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-ReductionTheory of Cryptography10.1007/978-3-031-78023-3_6(167-199)Online publication date: 3-Dec-2024
    • (2024)Trapdoor Memory-Hard FunctionsAdvances in Cryptology – EUROCRYPT 202410.1007/978-3-031-58734-4_11(315-344)Online publication date: 26-May-2024
    • (2023)Towards a Rigorous Statistical Analysis of Empirical Password Datasets2023 IEEE Symposium on Security and Privacy (SP)10.1109/SP46215.2023.10179431(606-625)Online publication date: May-2023
    • (2023)Computationally Relaxed Locally Decodable Codes, Revisited2023 IEEE International Symposium on Information Theory (ISIT)10.1109/ISIT54713.2023.10206655(2714-2719)Online publication date: 25-Jun-2023
    • (2023)Verifiable Capacity-Bound Functions: A New Primitive from Kolmogorov ComplexityPublic-Key Cryptography – PKC 202310.1007/978-3-031-31371-4_3(63-93)Online publication date: 7-May-2023
    • (2022)Blockchain technology in healthcare: A systematic reviewPLOS ONE10.1371/journal.pone.026646217:4(e0266462)Online publication date: 11-Apr-2022
    • (2022)The Parallel Reversible Pebbling Game: Analyzing the Post-quantum Security of iMHFsTheory of Cryptography10.1007/978-3-031-22318-1_3(52-79)Online publication date: 7-Nov-2022
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media