The following pages link to Mohammad Mahmoody (Q775975):
Displayed 34 items.
- Limits on the power of garbling techniques for public-key encryption (Q775977) (← links)
- On the round complexity of OT extension (Q775997) (← links)
- Registration-based encryption: removing private-key generator from IBE (Q1629445) (← links)
- Lower bounds on obfuscation from all-or-nothing encryption primitives (Q1675748) (← links)
- On the impossibility of cryptography with tamperable randomness (Q1688399) (← links)
- When does functional encryption imply obfuscation? (Q1690189) (← links)
- Blockwise \(p\)-tampering attacks on cryptographic primitives, extractors, and learners (Q1690272) (← links)
- Learning under \(p\)-tampering poisoning attacks (Q2202514) (← links)
- Registration-based encryption from standard assumptions (Q2289426) (← links)
- Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles (Q2408585) (← links)
- Polynomial-time targeted attacks on coin tossing for any number of corruptions (Q2697882) (← links)
- On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models (Q2796117) (← links)
- Lower Bounds on Assumptions Behind Indistinguishability Obfuscation (Q2796118) (← links)
- On the Impossibility of Cryptography with Tamperable Randomness (Q2874520) (← links)
- On Efficient Zero-Knowledge PCPs (Q2891481) (← links)
- On Black-Box Reductions between Predicate Encryption Schemes (Q2891499) (← links)
- The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitives (Q2914296) (← links)
- Publicly verifiable proofs of sequential work (Q2986887) (← links)
- On the power of nonuniformity in proofs of security (Q2986888) (← links)
- Limits of random oracles in secure computation (Q2988865) (← links)
- On the Black-Box Complexity of Optimally-Fair Coin Tossing (Q3000555) (← links)
- Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography (Q3582754) (← links)
- (Q4617626) (← links)
- Languages with Efficient Zero-Knowledge PCPs are in SZK (Q4910284) (← links)
- Computational Concentration of Measure: Optimal Bounds, Reductions, and More (Q5146786) (← links)
- Time-Lock Puzzles in the Random Oracle Model (Q5199183) (← links)
- (Q5294911) (← links)
- On the Power of Hierarchical Identity-Based Encryption (Q5739204) (← links)
- Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? (Q5746339) (← links)
- On the Power of Public-Key Encryption in Secure Computation (Q5746340) (← links)
- On the impossibility of key agreements from quantum random oracles (Q6104333) (← links)
- Fine-grained non-interactive key-exchange: constructions and lower bounds (Q6138079) (← links)
- Black-box separations for non-interactive classical commitments in a quantum world (Q6138082) (← links)
- Lower bounds for the number of decryption updates in registration-based encryption (Q6169371) (← links)