Combiners for backdoored random oracles

DOI10.1007/978-3-319-96881-0_10MaRDI QIDQ1784094zbMATH OpenOpenAlexFDO

Authors Balthazar Bauer, Pooya Farshim, Sogol Mazaheri

Publication date 26 September 2018

Full work available at URL https://hal.inria.fr/hal-01866724/file/770.pdf

zbMATH Keywords

combinercommunication complexitylower boundsrandom oracleset-disjointnessset-intersection

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Towards defeating backdoored random oracles: indifferentiability with bounded adaptivity
• Generic attacks on hash combiners
• Some observations on the theory of cryptographic hash functions
• Compression from Collisions, or Why CRHF Combiners Have a Long Output
• The sum can be weaker than each part

Cited in

(6)

• Towards defeating backdoored random oracles: indifferentiability with bounded adaptivity
• Security Analysis of Constructions Combining FIL Random Oracles
• Subversion-resilient authenticated encryption without random oracles
• Immunizing backdoored PRGs
• Black-box uselessness: composing separations in cryptography
• A min-entropy approach to multi-party communication lower bounds

This page was built for publication: Combiners for backdoored random oracles

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