Tight security proofs for the bounded-storage model

DOI10.1145/509907.509960MaRDI QIDQ3579184zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Stefan Dziembowski, Ueli M. Maurer

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cited in

(11)

• Non-interactive timestamping in the bounded-storage model
• Random oracles and non-uniformity
• Secure multiparty computation in the bounded storage model
• Authentication in the bounded storage model
• Long term confidentiality: a survey
• Innovative approaches for security of small artefacts
• Randomness extraction in \(\mathsf{AC}^0\) and with small locality
• Speak much, remember little: cryptography in the bounded storage model, revisited
• Memory-sample lower bounds for learning with classical-quantum hybrid memory
• On bounded storage key agreement and one-way functions
• Low-degree polynomials are good extractors

This page was built for publication: Tight security proofs for the bounded-storage model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579184)