scientific article; zbMATH DE number 2086702

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2332/23320110.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Monte Carlo methods (65C05) Cryptography (94A60)

Related Items (39)

How to build an ideal cipher: the indifferentiability of the Feistel construction ⋮ Short variable length domain extenders with beyond birthday bound security ⋮ Composition with knowledge assumptions ⋮ Garbling XOR gates ``for free in the standard model ⋮ From Indifferentiability to Constructive Cryptography (and Back) ⋮ Tweak-Length Extension for Tweakable Blockciphers ⋮ Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds ⋮ Revisiting structure graphs: applications to CBC-MAC and EMAC ⋮ Composable and finite computational security of quantum message transmission ⋮ A unified and composable take on ratcheting ⋮ Device independent quantum key distribution using three-party pseudo-telepathy ⋮ On-line ciphers and the Hash-CBC constructions ⋮ Tweakable Blockciphers with Asymptotically Optimal Security ⋮ Query-Complexity Amplification for Random Oracles ⋮ Indifferentiability of the confusion-diffusion network and the cascade block cipher ⋮ Hardness-preserving reductions via cuckoo hashing ⋮ A Proof of Security in O(2 n ) for the Benes Scheme ⋮ Anonymous authenticated communication ⋮ When messages are keys: is HMAC a dual-PRF? ⋮ Giving an adversary guarantees (or: how to model designated verifier signatures in a composable framework) ⋮ Tight security for key-alternating ciphers with correlated sub-keys ⋮ Universal reductions: reductions relative to stateful oracles ⋮ Adaptive security of multi-party protocols, revisited ⋮ A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier ⋮ State separation for code-based game-playing proofs ⋮ On the Security of Hash Functions Employing Blockcipher Postprocessing ⋮ Improved direct product theorems for randomized query complexity ⋮ The Multi-user Security of Double Encryption ⋮ Building blockcipher from small-block tweakable blockcipher ⋮ Luby-Rackoff Ciphers from Weak Round Functions? ⋮ Tweakable Enciphering Schemes from Hash-Sum-Expansion ⋮ A New Mode of Operation for Block Ciphers and Length-Preserving MACs ⋮ Large scale, actively secure computation from LPN and free-XOR garbled circuits ⋮ Revisiting (R)CCA security and replay protection ⋮ The “Coefficients H” Technique ⋮ Building Blockcipher from Tweakable Blockcipher: Extending FSE 2009 Proposal ⋮ Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security ⋮ The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3 ⋮ Overcoming impossibility results in composable security using interval-wise guarantees

This page was built for publication: