Naor-Reingold goes public: the complexity of known-key security

DOI10.1007/978-3-319-78372-7_21zbMath1415.94462OpenAlexW2794485042MaRDI QIDQ1653117

Stefano Tessaro, Pratik Soni

Publication date: 17 July 2018

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

zbMATH Keywords

foundationspseudorandomnesslimited independencecorrelation-intractabilityknown-key securitypsPRPs

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Sequential indifferentiability of confusion-diffusion networks ⋮ Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules) ⋮ Beyond Uber: instantiating generic groups via PGGs

This page was built for publication: Naor-Reingold goes public: the complexity of known-key security