The following pages link to Vinod Vaikuntanathan (Q380961):
Displaying 50 items.
- (Leveled) Fully Homomorphic Encryption without Bootstrapping (Q92720) (← links)
- Round-optimal password-based authenticated key exchange (Q380962) (← links)
- Securely obfuscating re-encryption (Q656916) (← links)
- Traitor-tracing from LWE made simple and attribute-based (Q1631335) (← links)
- Anonymous IBE, leakage resilience and circular security from new assumptions (Q1648813) (← links)
- Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
- Structure vs. hardness through the obfuscation lens (Q1675749) (← links)
- Conditional disclosure of secrets via non-linear reconstruction (Q1675752) (← links)
- Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation (Q1690190) (← links)
- Private constrained PRFs (and more) from LWE (Q1690195) (← links)
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates (Q1784107) (← links)
- Extracting randomness from extractor-dependent sources (Q2055613) (← links)
- Statistical ZAPR arguments from bilinear maps (Q2055670) (← links)
- Oblivious transfer is in MiniQCrypt (Q2056751) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- The \(t\)-wise independence of substitution-permutation networks (Q2139644) (← links)
- A note on perfect correctness by derandomization (Q2146431) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Lattice trapdoors and IBE from middle-product LWE (Q2175903) (← links)
- Matrix PRFs: constructions, attacks, and applications to obfuscation (Q2175904) (← links)
- Optimal bounded-collusion secure functional encryption (Q2175911) (← links)
- Worst-case hardness for LPN and cryptographic hashing via code smoothing (Q2292709) (← links)
- Reusable non-interactive secure computation (Q2304929) (← links)
- Somewhere statistical soundness, post-quantum security, and SNARGs (Q2695640) (← links)
- Succinct LWE sampling, random polynomials, and obfuscation (Q2697860) (← links)
- Indistinguishability Obfuscation: From Approximate to Exact (Q2796119) (← links)
- On Basing Private Information Retrieval on NP-Hardness (Q2796134) (← links)
- Obfuscating Conjunctions under Entropic Ring LWE (Q2800561) (← links)
- Time-Lock Puzzles from Randomized Encodings (Q2800583) (← links)
- Secret Sharing and Statistical Zero Knowledge (Q2811150) (← links)
- (Leveled) fully homomorphic encryption without bootstrapping (Q2826066) (← links)
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security (Q2829953) (← links)
- Fine-Grained Cryptography (Q2829959) (← links)
- Functional Encryption: New Perspectives and Lower Bounds (Q2849414) (← links)
- How to Run Turing Machines on Encrypted Data (Q2849418) (← links)
- On Continual Leakage of Discrete Log Representations (Q2867167) (← links)
- How to Compute on Encrypted Data (Q2876919) (← links)
- Functional Re-encryption and Collusion-Resistant Obfuscation (Q2891497) (← links)
- How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption (Q2891498) (← links)
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE (Q2894425) (← links)
- Functional Encryption for Threshold Functions (or Fuzzy IBE) from Lattices (Q2900223) (← links)
- Efficient Password Authenticated Key Exchange via Oblivious Transfer (Q2900235) (← links)
- Functional Encryption with Bounded Collusions via Multi-party Computation (Q2914259) (← links)
- Byzantine agreement in the full-information model in O(log n) rounds (Q2931382) (← links)
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs (Q2941535) (← links)
- Leveled Fully Homomorphic Signatures from Standard Lattices (Q2941539) (← links)
- SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers (Q2985306) (← links)
- Lattice-based FHE as secure as PKE (Q2988863) (← links)
- Round-Optimal Password-Based Authenticated Key Exchange (Q3000545) (← links)
- A Group Signature Scheme from Lattice Assumptions (Q3058668) (← links)
