The following pages link to Fast Software Encryption (Q5713918):
Displayed 22 items.
- Relations between robustness and RKA security under public-key encryption (Q266278) (← links)
- Bounded tamper resilience: how to go beyond the algebraic barrier (Q514469) (← links)
- Notions and relations for RKA-secure permutation and function families (Q540472) (← links)
- Subversion-resilient signatures: definitions, constructions and applications (Q1989360) (← links)
- Analyzing the provable security bounds of GIFT-COFB and Photon-Beetle (Q2096604) (← links)
- Non-malleable functions and their applications (Q2121503) (← links)
- Related-key secure key encapsulation from extended computational bilinear Diffie-Hellman (Q2293251) (← links)
- Connecting tweakable and multi-key blockcipher security (Q2413014) (← links)
- Clever Arbiters Versus Malicious Adversaries (Q2803661) (← links)
- Secure Message Authentication Against Related-Key Attack (Q2946884) (← links)
- The Chaining Lemma and Its Application (Q2947530) (← links)
- Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience (Q2958151) (← links)
- On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model (Q3013081) (← links)
- Expedient Non-malleability Notions for Hash Functions (Q3073712) (← links)
- On Related-Secret Pseudorandomness (Q3408199) (← links)
- Delayed-Key Message Authentication for Streams (Q3408201) (← links)
- Security Against Related Randomness Attacks via Reconstructive Extractors (Q3460096) (← links)
- On the Notions of PRP-RKA, KR and KR-RKA for Block Ciphers (Q3503881) (← links)
- Non-malleable Codes with Split-State Refresh (Q5738791) (← links)
- Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions (Q5738969) (← links)
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5915597) (← links)
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5918098) (← links)