CoChat
Sign Up
Cited by 9Cryptographic Implementations and SecurityCryptography and Data SecurityBlockchain Technology Applications and Security

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Time-Memory Tradeoff Attacks on the MTP Proof-of-Work Scheme

Dinur, Itai, Nadler, Niv·2017·Lecture Notes in Computer Science
DOI 10.1007/978-3-319-63715-0_13
Open this paper in CoChat — free account

Overview

Integrity signals

Registry

Crossref · 10.1007/978-3-319-63715-0_13

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Flagged first, then by citations

Show all 1 references

Research works printed but not linked: 10

  1. Alwen, J., Blocki, J.: Efficiently computing data-independent memory-hard functions. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 241–271. Springer, Heidelberg (2016). doi:10.1007/978-3-662-53008-5_9 · DOI
  2. Alwen, J., Blocki, J.: Towards practical attacks on Argon2i and balloon hashing. IACR Cryptology ePrint Archive, 2016:759 (2016). Presented at the IEEE European Symposium on Security and Privacy (2017) · DOI
  3. Ateniese, G., Bonacina, I., Faonio, A., Galesi, N.: Proofs of space: when space is of the essence. In: Abdalla, M., Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 538–557. Springer, Cham (2014). doi:10.1007/978-3-319-10879-7_31 · DOI
  4. Aumasson, J.-P., Neves, S., Wilcox-O’Hearn, Z., Winnerlein, C.: BLAKE2: simpler, smaller, fast as MD5. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 119–135. Springer, Heidelberg (2013). doi:10.1007/978-3-642-38980-1_8 · DOI · Paper page
  5. Biryukov, A., Dinu, D., Khovratovich, D.: Argon2: new generation of memory-hard functions for password hashing and other applications. In: IEEE European Symposium on Security and Privacy, EuroS&P 2016, Saarbrücken, Germany, 21–24 March 2016, pp. 292–302. IEEE (2016) · DOI
  6. Biryukov, A., Khovratovich, D.: Egalitarian computing. In: Holz, T., Savage, S. (eds.) 25th USENIX Security Symposium, USENIX Security 2016, Austin, TX, USA, 10–12 August 2016, pp. 315–326. USENIX Association (2016)
  7. Bonneau, A.N.J., Felten, E., Miller, A., Goldfeder, S.: Bitcoin and Cryptocurrency Technologies: A Comprehensive Introduction. Princeton University Press, Princeton (2016)
  8. Dwork, C., Naor, M.: Pricing via processing or combatting junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 139–147. Springer, Heidelberg (1993). doi:10.1007/3-540-48071-4_10 · DOI · Paper page
  9. Dziembowski, S., Faust, S., Kolmogorov, V., Pietrzak, K.: Proofs of space. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 585–605. Springer, Heidelberg (2015). doi:10.1007/978-3-662-48000-7_29 · DOI · Paper page
  10. Mahmoody, M., Moran, T., Vadhan, S.P.: Publicly verifiable proofs of sequential work. In: Kleinberg, R.D. (ed.) Innovations in Theoretical Computer Science, ITCS 2013, Berkeley, CA, USA, 9–12 January 2013, pp. 373–388. ACM (2013) · DOI

Cited by

Sorted by citations

  • IoT Expunge: Implementing Verifiable Retention of IoT Data

    Panwar, N., Sharma, S., Gupta, P., Ghosh, D., Mehrotra, S., & Venkatasubramanian, N. (2020) · Proceedings of the Tenth ACM Conference on Data and Application Security and Privacy · doi:10.1145/3374664.3375737 · Cited by 6

    “Note that such a computation cannot be parallelized and, thus, achieves the verifiable time-space trade-off during the computation [16].”
    Background

See all 9

Metadata

Authors
Dinur, I., & Nadler, N.
Affiliations
Ben-Gurion University of the Negev (IL)
Corresponding author
Dinur, Itai
ORCID
Dinur, Itai
Venue
Lecture Notes in Computer Science
Publisher
Springer International Publishing
Published
2017
Volume
2017
Pages
375-403
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
DOI
10.1007/978-3-319-63715-0_13
OpenAlex
W2732356589
Cited by
9
References
1
Citations by year
2026: 1 · 2025: 1 · 2023: 1 · 2022: 2 · 2020: 2 · 2018: 1
FWCI
0.37
Type
conference paper
Language
en
Open access
closed
Licence
Locations
  • Lecture notes in computer science (publishedVersion)
  • IACR Cryptology ePrint Archive
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
  • Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
  • Physical Sciences › Computer Science › Information Systems › Blockchain Technology Applications and Security
Keywords
proof-of-work, MTP, memory-hard functions, time-memory trade-off, memory access patterns

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review