Lower bounds on the efficiency of generic cryptographic constructions

DOI10.1109/SFCS.2000.892119MaRDI QIDQ7239957zbMATH OpenFDO

Authors Rosario Gennaro, Luca Trevisan

Publication date 8 May 2026

Full work available at URL https://doi.org/10.1109/SFCS.2000.892119

Mathematics Subject Classification ID

Computer science (68-XX)

Cited in

(3)

• Time-space tradeoffs of truncation with preprocessing
• Multi-source randomness extraction and generation in the random-oracle model
• On the efficiency of generic, quantum cryptographic constructions

This page was built for publication: Lower bounds on the efficiency of generic cryptographic constructions

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