Efficiency Bounds for Adversary Constructions in Black-Box Reductions
From MaRDI portal
Publication:3634498
DOI10.1007/978-3-642-02620-1_19zbMath1284.94059OpenAlexW1480767061WikidataQ62048364 ScholiaQ62048364MaRDI QIDQ3634498
Aivo Jürgenson, Margus Niitsoo, Ahto Buldas
Publication date: 25 June 2009
Published in: Information Security and Privacy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02620-1_19
Cites Work
- Lower bounds on the efficiency of encryption and digital signature schemes
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities
- On Provably Secure Time-Stamping Schemes
- Bounds on the Efficiency of Generic Cryptographic Constructions
- Fast Software Encryption
- Theory of Cryptography
- Unnamed Item
- Unnamed Item
This page was built for publication: Efficiency Bounds for Adversary Constructions in Black-Box Reductions