Tight security proofs for the bounded-storage model
From MaRDI portal
Publication:3579184
DOI10.1145/509907.509960zbMath1192.94094DBLPconf/stoc/DziembowskiM02OpenAlexW2145765524WikidataQ59760550 ScholiaQ59760550MaRDI QIDQ3579184
Ueli M. Maurer, Stefan Dziembowski
Publication date: 5 August 2010
Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/509907.509960
Related Items (9)
Secure multiparty computation in the bounded storage model ⋮ Random oracles and non-uniformity ⋮ Authentication in the bounded storage model ⋮ Speak much, remember little: cryptography in the bounded storage model, revisited ⋮ Unnamed Item ⋮ Long term confidentiality: a survey ⋮ Innovative approaches for security of small artefacts ⋮ Memory-sample lower bounds for learning with classical-quantum hybrid memory ⋮ Non-interactive timestamping in the bounded-storage model
This page was built for publication: Tight security proofs for the bounded-storage model
