The following pages link to Sanjam Garg (Q775968):
Displaying 50 items.
- Two-round multiparty secure computation minimizing public key operations (Q775971) (← links)
- Limits on the power of garbling techniques for public-key encryption (Q775977) (← links)
- Adaptive garbled RAM from laconic oblivious transfer (Q775994) (← links)
- On the round complexity of OT extension (Q775997) (← links)
- Two-round MPC: information-theoretic and black-box (Q1629402) (← links)
- Registration-based encryption: removing private-key generator from IBE (Q1629445) (← links)
- A simple construction of iO for Turing machines (Q1631340) (← links)
- Two-round multiparty secure computation from minimal assumptions (Q1648848) (← links)
- Adaptively secure garbling with near optimal online complexity (Q1648850) (← links)
- A new approach to black-box concurrent secure computation (Q1648852) (← links)
- Identity-based encryption from the Diffie-Hellman assumption (Q1675739) (← links)
- Lower bounds on obfuscation from all-or-nothing encryption primitives (Q1675748) (← links)
- Laconic oblivious transfer and its applications (Q1678362) (← links)
- Incremental program obfuscation (Q1680211) (← links)
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input (Q1688409) (← links)
- When does functional encryption imply obfuscation? (Q1690189) (← links)
- From selective IBE to full IBE and selective HIBE (Q1690200) (← links)
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions (Q1701448) (← links)
- Obfuscation from low noise multilinear maps (Q1738067) (← links)
- New constructions of identity-based and key-dependent message secure encryption schemes (Q1749271) (← links)
- Trapdoor functions from the computational Diffie-Hellman assumption (Q1784099) (← links)
- Candidate iO from homomorphic encryption schemes (Q2055602) (← links)
- Constant ciphertext-rate non-committing encryption from standard assumptions (Q2055714) (← links)
- Efficient range-trapdoor functions and applications: rate-1 OT and more (Q2055715) (← links)
- FHE-based bootstrapping of designated-prover NIZK (Q2055742) (← links)
- Tight verifiable delay functions (Q2106631) (← links)
- Black-box constructions of bounded-concurrent secure computation (Q2106632) (← links)
- Formalizing data deletion in the context of the right to be forgotten (Q2119018) (← links)
- Two-round oblivious transfer from CDH or LPN (Q2119032) (← links)
- Reusable two-round MPC from DDH (Q2119050) (← links)
- Compact ring signatures from learning with errors (Q2120080) (← links)
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles (Q2175948) (← links)
- Rate-1 trapdoor functions from the Diffie-Hellman problem (Q2178868) (← links)
- The broadcast message complexity of secure multiparty computation (Q2181889) (← links)
- Registration-based encryption from standard assumptions (Q2289426) (← links)
- New techniques for efficient trapdoor functions and applications (Q2292685) (← links)
- Trapdoor hash functions and their applications (Q2304914) (← links)
- Laconic private set intersection and applications (Q2697887) (← links)
- Amortizing rate-1 OT and applications to PIR and PSI (Q2697889) (← links)
- Functional Encryption Without Obfuscation (Q2799106) (← links)
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits (Q2816296) (← links)
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium (Q2829231) (← links)
- TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption (Q2829960) (← links)
- Secure Computation against Adaptive Auxiliary Information (Q2845680) (← links)
- Attribute-Based Encryption for Circuits from Multilinear Maps (Q2849413) (← links)
- On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input (Q2874523) (← links)
- Resettable Statistical Zero Knowledge (Q2891502) (← links)
- Concurrently Secure Computation in Constant Rounds (Q2894403) (← links)
- Adaptively Secure Multi-Party Computation with Dishonest Majority (Q2914256) (← links)
- Impossibility Results for Static Input Secure Computation (Q2914274) (← links)
