Pages that link to "Item:Q3582783"
From MaRDI portal
The following pages link to Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks (Q3582783):
Displaying 38 items.
- Garbling XOR gates ``for free'' in the standard model (Q315547) (← links)
- Bounded tamper resilience: how to go beyond the algebraic barrier (Q514469) (← links)
- Related-key analysis of generalized Feistel networks with expanding round functions (Q826269) (← links)
- How to stretch random functions: The security of protected counter sums (Q1304976) (← links)
- A probabilistic cryptanalytic method for a time-variant permutation generator (Q1603353) (← links)
- Super-strong RKA secure MAC, PKE and SE from tag-based hash proof system (Q1647557) (← links)
- Subversion-resilient signatures: definitions, constructions and applications (Q1989360) (← links)
- Related-key security for pseudorandom functions beyond the linear barrier (Q1994635) (← links)
- Provable related-key security of contracting Feistel networks (Q2057179) (← links)
- Impossibility on tamper-resilient cryptography with uniqueness properties (Q2061927) (← links)
- Non-malleable functions and their applications (Q2121503) (← links)
- Pseudorandom functions from LWE: RKA security and application (Q2183928) (← links)
- Related-key secure key encapsulation from extended computational bilinear Diffie-Hellman (Q2293251) (← links)
- Public key encryption resilient to leakage and tampering attacks (Q2402358) (← links)
- Clever Arbiters Versus Malicious Adversaries (Q2803661) (← links)
- Multilinear and Aggregate Pseudorandom Functions: New Constructions and Improved Security (Q2811127) (← links)
- Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions (Q2946437) (← 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)
- Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions (Q2958152) (← links)
- How to Make the Cramer-Shoup Cryptosystem Secure Against Linear Related-Key Attacks (Q2980852) (← links)
- On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model (Q3013081) (← links)
- Expedient Non-malleability Notions for Hash Functions (Q3073712) (← links)
- An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security (Q3457120) (← links)
- Security Against Related Randomness Attacks via Reconstructive Extractors (Q3460096) (← links)
- Modeling Random Oracles Under Unpredictable Queries (Q4639493) (← links)
- On the Security of Pseudorandomized Information-Theoretically Secure Schemes (Q4931668) (← links)
- On the semantic security of cellular automata based pseudo-random permutation using results from the Luby-Rackoff construction (Q5377238) (← links)
- Parallelizable Rate-1 Authenticated Encryption from Pseudorandom Functions (Q5418701) (← links)
- On the Provable Security of an Efficient RSA-Based Pseudorandom Generator (Q5459079) (← links)
- Tweakable Pseudorandom Permutation from Generalized Feistel Structure (Q5505455) (← 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)
- Continuously non-malleable codes against bounded-depth tampering (Q6175984) (← links)
- Proactive secret sharing with constant communication (Q6582179) (← links)
- Symmetric and dual PRFs from standard assumptions: a generic validation of a prevailing assumption (Q6617632) (← links)
