scientific article; zbMATH DE number 2086702
From MaRDI portal
Publication:4737239
Recommendations
Cited in
(47)- Query-complexity amplification for random oracles
- Anonymous authenticated communication
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- The Multi-user Security of Double Encryption
- When messages are keys: is HMAC a dual-PRF?
- scientific article; zbMATH DE number 3844684 (Why is no real title available?)
- A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier
- Coupling of random systems
- Building blockcipher from small-block tweakable blockcipher
- Quantum indistinguishability of random sponges
- Tweak-length extension for tweakable blockciphers
- Short variable length domain extenders with beyond birthday bound security
- On-line ciphers and the Hash-CBC constructions
- Tweakable blockciphers with asymptotically optimal security
- Key-alternating ciphers and key-length extension: exact bounds and multi-user security
- State separation for code-based game-playing proofs
- Luby-Rackoff Ciphers from Weak Round Functions?
- Tweakable Enciphering Schemes from Hash-Sum-Expansion
- Universal reductions: reductions relative to stateful oracles
- Giving an adversary guarantees (or: how to model designated verifier signatures in a composable framework)
- Composition with knowledge assumptions
- The “Coefficients H” Technique
- A New Mode of Operation for Block Ciphers and Length-Preserving MACs
- Indifferentiability of the confusion-diffusion network and the cascade block cipher
- Garbling XOR gates ``for free in the standard model
- Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
- Information-theoretic indistinguishability via the chi-squared method
- From Indifferentiability to Constructive Cryptography (and Back)
- The multi-user security of authenticated encryption: AES-GCM in TLS 1.3
- 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
- Revisiting (R)CCA security and replay protection
- Revisiting structure graphs: applications to CBC-MAC and EMAC
- Tight security for key-alternating ciphers with correlated sub-keys
- A unified and composable take on ratcheting
- Device independent quantum key distribution using three-party pseudo-telepathy
- Improved direct product theorems for randomized query complexity
- Symbolic encryption with pseudorandom keys
- Indistinguishability tests in the actor–partner interdependence model
- Theory of Cryptography
- Adaptive security of multi-party protocols, revisited
- Building blockcipher from tweakable blockcipher: extending FSE 2009 proposal
- 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)
