scientific article; zbMATH DE number 2009976
From MaRDI portal
Publication:4434895
Recommendations
Cited in
(87)- Super-strong RKA secure MAC, PKE and SE from tag-based hash proof system
- Output masking of tweakable Even-Mansour can be eliminated for message authentication code
- Subversion-resilient signatures: definitions, constructions and applications
- Related-key security for pseudorandom functions beyond the linear barrier
- Security of hedged Fiat-Shamir signatures under fault attacks
- Security under message-derived keys: signcryption in iMessage
- Large scale, actively secure computation from LPN and free-XOR garbled circuits
- Provable related-key security of contracting Feistel networks
- Impossibility on tamper-resilient cryptography with uniqueness properties
- Analyzing the provable security bounds of GIFT-COFB and Photon-Beetle
- Collision-resistant and pseudorandom function based on Merkle-Damgård hash function
- Non-malleable functions and their applications
- Efficient schemes for committing authenticated encryption
- Robust digital signature revisited
- Continuously non-malleable codes in the split-state model
- Lesamnta-LW revisited: improved security analysis of primitive and new PRF mode
- Related-key secure key encapsulation from extended computational bilinear Diffie-Hellman
- Public key encryption resilient to leakage and tampering attacks
- Public-key encryption for protecting data in cloud system with intelligent agents against side-channel attacks
- Connecting tweakable and multi-key blockcipher security
- Critique of the related-key attack concept
- Relations between robustness and RKA security under public-key encryption
- A quantum related-key attack based on the Bernstein-Vazirani algorithm
- Minimizing the two-round tweakable Even-Mansour cipher
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- Optimally secure block ciphers from ideal primitives
- Clever arbiters versus malicious adversaries. On the gap between known-input security and chosen-input security
- Efficient completely non-malleable and RKA secure public key encryptions
- Provably-secure remote memory attestation for heap overflow protection
- XPX: generalized tweakable Even-Mansour with improved security guarantees
- Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions
- Secure message authentication against related-key attack
- The related-key analysis of Feistel constructions
- The Chaining Lemma and its application
- Salvaging weak security bounds for blockcipher-based constructions
- Efficient public-key cryptography with bounded leakage and tamper resilience
- Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions
- Network coding signature schemes against related-key attacks in the random oracle model
- On cipher-dependent related-key attacks in the ideal-cipher model
- Expedient Non-malleability Notions for Hash Functions
- Cryptography secure against related-key attacks and tampering
- Garbling XOR gates ``for free in the standard model
- Weak-key and related-key analysis of hash-counter-hash tweakable enciphering schemes
- On related-secret pseudorandomness
- Delayed-key message authentication for streams
- On the Notions of PRP-RKA, KR and KR-RKA for Block Ciphers
- The Security of Elastic Block Ciphers Against Key-Recovery Attacks
- On the Unprovable Security of 2-Key XCBC
- Password Mistyping in Two-Factor-Authenticated Key Exchange
- A Unified Approach to Related-Key Attacks
- Pseudorandom functions and permutations provably secure against related-key attacks
- Certified Encryption Revisited
- A Scheme to Base a Hash Function on a Block Cipher
- A simple variant of the Merkle-Damgård scheme with a permutation
- Tweakable block ciphers
- A note on quantum related-key attacks
- Modeling random oracles under unpredictable queries
- Related-key almost universal hash functions: definitions, constructions and applications
- Robust encryption, revisited
- Reflection ciphers
- Bounded tamper resilience: how to go beyond the algebraic barrier
- Notions and relations for RKA-secure permutation and function families
- Security of NMAC and HMAC Based on Non-malleability
- Tweakable Pseudorandom Permutation from Generalized Feistel Structure
- Fast Software Encryption
- Non-malleable Codes with Split-State Refresh
- Functional encryption: deterministic to randomized functions from simple assumptions
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Flexible password-based encryption: securing cloud storage and provably resisting partitioning-oracle attacks
- Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls
- Multi-instance secure public-key encryption
- On the related-key attack security of authenticated encryption schemes
- When messages are keys: is HMAC a dual-PRF?
- QCB: efficient quantum-secure authenticated encryption
- Practical non-malleable codes from symmetric-key primitives in 2-split-state model
- Continuously non-malleable codes against bounded-depth tampering
- Practical verifiable random function with RKA security
- The indifferentiability of the duplex and its practical applications
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
- More efficient public-key cryptography with leakage and tamper resilience
- The security of ML-DSA against fault-injection attacks
- Four attacks and a proof for Telegram
- Constrained pseudorandom functions for inner-product predicates from weaker assumptions
- Related-key analysis of generalized Feistel networks with expanding round functions
- Improved domain extender for the ideal cipher
- New proofs for NMAC and HMAC: security without collision resistance
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 Q4434895)
