scientific article; zbMATH DE number 2086702
From MaRDI portal
Publication:4737239
zbMATH Open1055.94021MaRDI QIDQ4737239FDOQ4737239
Authors: Ueli M. Maurer 
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2332/23320110.htm
Title of this publication is not available (Why is that?)
Recommendations
Cited In (44)
- Anonymous authenticated communication
- The Multi-user Security of Double Encryption
- When messages are keys: is HMAC a dual-PRF?
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- Title not available (Why is that?)
- Building Blockcipher from Tweakable Blockcipher: Extending FSE 2009 Proposal
- A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier
- Quantum indistinguishability of random sponges
- Building blockcipher from small-block tweakable blockcipher
- Query-Complexity Amplification for Random Oracles
- On-line ciphers and the Hash-CBC constructions
- Short variable length domain extenders with beyond birthday bound security
- State separation for code-based game-playing proofs
- Universal reductions: reductions relative to stateful oracles
- Tweakable Enciphering Schemes from Hash-Sum-Expansion
- Giving an adversary guarantees (or: how to model designated verifier signatures in a composable framework)
- Luby-Rackoff Ciphers from Weak Round Functions?
- Composition with knowledge assumptions
- A New Mode of Operation for Block Ciphers and Length-Preserving MACs
- The “Coefficients H” Technique
- Indifferentiability of the confusion-diffusion network and the cascade block cipher
- Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
- Garbling XOR gates ``for free in the standard model
- From Indifferentiability to Constructive Cryptography (and Back)
- Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
- Tweak-Length Extension for Tweakable Blockciphers
- Tweakable Blockciphers with Asymptotically Optimal Security
- Composable and finite computational security of quantum message transmission
- Large scale, actively secure computation from LPN and free-XOR garbled circuits
- A Simple and Unified Method of Proving Indistinguishability
- Hardness-preserving reductions via cuckoo hashing
- A Proof of Security in O(2 n ) for the Benes Scheme
- Tight security for key-alternating ciphers with correlated sub-keys
- Revisiting (R)CCA security and replay protection
- Revisiting structure graphs: applications to CBC-MAC and EMAC
- A unified and composable take on ratcheting
- Device independent quantum key distribution using three-party pseudo-telepathy
- The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3
- Improved direct product theorems for randomized query complexity
- Indistinguishability tests in the actor–partner interdependence model
- Theory of Cryptography
- Adaptive security of multi-party protocols, revisited
- On the Security of Hash Functions Employing Blockcipher Postprocessing
- Overcoming impossibility results in composable security using interval-wise guarantees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737239)
