Memory-tight reductions

DOI10.1007/978-3-319-63688-7_4zbMath1407.94076OpenAlexW2741724173WikidataQ59163630 ScholiaQ59163630MaRDI QIDQ1675721

Benedikt Auerbach, Eike Kiltz, Manuel Fersch, David Cash

Publication date: 3 November 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-63688-7_4

zbMATH Keywords

tightnessprovable securitymemoryblack box reduction

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

Memory-Tight Reductions for Practical Key Encapsulation Mechanisms ⋮ Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries ⋮ Memory lower bounds of reductions revisited ⋮ Hiding in plain sight: memory-tight proofs via randomness programming ⋮ Digital Signatures with Memory-Tight Security in the Multi-challenge Setting ⋮ Memory-tight multi-challenge security of public-key encryption ⋮ Tight time-space lower bounds for finding multiple collision pairs and their applications ⋮ The memory-tightness of authenticated encryption ⋮ On the memory-tightness of hashed ElGamal

This page was built for publication: Memory-tight reductions