Pages that link to "Item:Q2849409"
From MaRDI portal
The following pages link to Instantiating Random Oracles via UCEs (Q2849409):
Displaying 33 items.
- The random oracle model: a twenty-year retrospective (Q887442) (← links)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- Another step towards realizing random oracles: non-malleable point obfuscation (Q1648795) (← links)
- Subversion-resilient signatures: definitions, constructions and applications (Q1989360) (← links)
- Extracting randomness from extractor-dependent sources (Q2055613) (← links)
- Practical algorithm substitution attack on extractable signatures (Q2119943) (← links)
- Limits on the adaptive security of Yao's garbling (Q2128573) (← links)
- Adaptive security of practical garbling schemes (Q2152063) (← links)
- The magic of ELFs (Q2318089) (← links)
- Instantiability of RSA-OAEP under chosen-plaintext attack (Q2408591) (← links)
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy (Q2516532) (← links)
- On treewidth, separators and Yao's garbling (Q2697873) (← links)
- On the Correlation Intractability of Obfuscated Pseudorandom Functions (Q2796135) (← links)
- Contention in Cryptoland: Obfuscation, Leakage and UCE (Q2799108) (← links)
- Point-Function Obfuscation: A Framework and Generic Constructions (Q2799109) (← links)
- Signatures Resilient to Uninvertible Leakage (Q2827729) (← links)
- A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation (Q2827742) (← links)
- Adaptively Secure Garbled Circuits from One-Way Functions (Q2829946) (← links)
- Big-Key Symmetric Encryption: Resisting Key Exfiltration (Q2835594) (← links)
- The Magic of ELFs (Q2835598) (← links)
- Selective-Opening Security in the Presence of Randomness Failures (Q2953780) (← links)
- How to Generate and Use Universal Samplers (Q2953794) (← links)
- Lossy Key Encapsulation Mechanism and Its Applications (Q2988341) (← links)
- Adaptive Security of Yao’s Garbled Circuits (Q3179366) (← links)
- Approximate-Deterministic Public Key Encryption from Hard Learning Problems (Q3179474) (← links)
- Towards Forward Security Properties for PEKS and IBE (Q3194593) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- Modeling Random Oracles Under Unpredictable Queries (Q4639493) (← links)
- Toward RSA-OAEP Without Random Oracles (Q5041161) (← links)
- Public-Seed Pseudorandom Permutations (Q5738982) (← links)
- Immunizing backdoored PRGs (Q6582215) (← links)
- Searching for ELFs in the cryptographic forest (Q6582218) (← links)
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity (Q6595677) (← links)
