The following pages link to Pooya Farshim (Q285243):
Displayed 33 items.
- Polly cracker, revisited (Q285245) (← links)
- The key-dependent message security of key-alternating Feistel ciphers (Q826271) (← links)
- Indifferentiable authenticated encryption (Q1673391) (← links)
- Graded encoding schemes from obfuscation (Q1753858) (← links)
- Combiners for backdoored random oracles (Q1784094) (← links)
- Password hashing and preprocessing (Q2056723) (← links)
- Towards defeating backdoored random oracles: indifferentiability with bounded adaptivity (Q2119079) (← links)
- Simpler constructions of asymmetric primitives from obfuscation (Q2152062) (← links)
- Multilinear maps from obfuscation (Q2188963) (← links)
- Generic constructions of identity-based and certificateless kEMs (Q2425527) (← links)
- Multilinear Maps from Obfuscation (Q2796137) (← links)
- On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption (Q2870085) (← links)
- Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources (Q2874504) (← links)
- Delegatable Homomorphic Encryption with Applications to Secure Outsourcing of Computation (Q2890014) (← links)
- The Related-Key Analysis of Feistel Constructions (Q2946914) (← links)
- The Related-Key Security of Iterated Even–Mansour Ciphers (Q2946950) (← links)
- A More Cautious Approach to Security Against Mass Surveillance (Q2946964) (← links)
- On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model (Q3013081) (← links)
- Polly Cracker, Revisited (Q3102185) (← links)
- Relations among Notions of Complete Non-malleability: Indistinguishability Characterisation and Efficient Construction without Random Oracles (Q3163102) (← links)
- Strong Knowledge Extractors for Public-Key Encryption Schemes (Q3163103) (← links)
- Private Functional Encryption: Indistinguishability-Based Definitions and Constructions from Obfuscation (Q3179487) (← links)
- Certified Encryption Revisited (Q3637140) (← links)
- Security Analysis of Standard Authentication and Key Agreement Protocols Utilising Timestamps (Q3637143) (← links)
- Modeling Random Oracles Under Unpredictable Queries (Q4639493) (← links)
- On the Semantic Security of Functional Encryption Schemes (Q4916006) (← links)
- Robust Encryption, Revisited (Q4916019) (← links)
- Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions (Q4924425) (← links)
- Random-Oracle Uninstantiability from Indistinguishability Obfuscation (Q5261686) (← links)
- Randomness Reuse: Extensions and Improvements (Q5447521) (← links)
- Secure Cryptographic Workflow in the Standard Model (Q5458291) (← links)
- Cryptography and Coding (Q5897536) (← links)
- Beyond Uber: instantiating generic groups via PGGs (Q6169556) (← links)