Understanding adaptivity: random systems revisited

DOI10.1007/978-3-642-34961-4_20MaRDI QIDQ4911593zbMATH OpenOpenAlexFDO

Authors Dimitar Jetchev, Onur Özen, Martijn Stam

Publication date 19 March 2013

Published in Advances in Cryptology – ASIACRYPT 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-34961-4_20

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Theory of Cryptography
• Coupling of random systems
• scientific article; zbMATH DE number 1722683
• The cost of adaptivity in security games on graphs
• Adaptive versus non-adaptive security of multi-party protocols

Cited in

(6)

• Building blockcipher from small-block tweakable blockcipher
• The hitchhiker's guide to adaptive dynamics
• Hardness-preserving reductions via cuckoo hashing
• Tweakable blockciphers with asymptotically optimal security
• Query-complexity amplification for random oracles
• Tweak-length extension for tweakable blockciphers

This page was built for publication: Understanding adaptivity: random systems revisited

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