The following pages link to Craig Gentry (Q1688408):
Displaying 50 items.
- (Leveled) fully homomorphic encryption without bootstrapping (Q92720) (← links)
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input (Q1688409) (← links)
- A unified framework for trapdoor-permutation-based sequential aggregate signatures (Q1753840) (← links)
- Can a public blockchain keep a secret? (Q2055723) (← links)
- YOSO: You only speak once. Secure MPC with stateless ephemeral roles (Q2128556) (← links)
- Practical non-interactive publicly verifiable secret sharing with thousands of parties (Q2170010) (← links)
- Compressible FHE with applications to PIR (Q2175949) (← links)
- Homomorphic encryption for finite automata (Q2176661) (← links)
- Random-index PIR and applications (Q2697885) (← links)
- (Q2778849) (← links)
- Private Database Access with HE-over-ORAM Architecture (Q2794501) (← links)
- Functional Encryption Without Obfuscation (Q2799106) (← links)
- Candidate indistinguishability obfuscation and functional encryption for all circuits (Q2816296) (← links)
- (Leveled) fully homomorphic encryption without bootstrapping (Q2826066) (← links)
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based (Q2845661) (← links)
- Attribute-Based Encryption for Circuits from Multilinear Maps (Q2849413) (← links)
- Discrete Gaussian Leftover Hash Lemma over Infinite Domains (Q2867213) (← links)
- Private Database Queries Using Somewhat Homomorphic Encryption (Q2873641) (← links)
- Witness Encryption from Instance Independent Assumptions (Q2874518) (← links)
- On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input (Q2874523) (← links)
- Optimizing ORAM and Using It Efficiently for Secure Computation (Q2876659) (← links)
- Fully Homomorphic Encryption with Polylog Overhead (Q2894424) (← links)
- Better Bootstrapping in Fully Homomorphic Encryption (Q2900205) (← links)
- Ring Switching in BGV-Style Homomorphic Encryption (Q2912784) (← links)
- Homomorphic Evaluation of the AES Circuit (Q2914304) (← links)
- Implementing Gentry’s Fully-Homomorphic Encryption Scheme (Q3003380) (← links)
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations (Q3457113) (← links)
- Trapdoors for hard lattices and new cryptographic constructions (Q3549701) (← links)
- Fully Homomorphic Encryption over the Integers (Q3563828) (← links)
- A Simple BGN-Type Cryptosystem from LWE (Q3563853) (← links)
- Computing arbitrary functions of encrypted data (Q3578184) (← links)
- Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness (Q3582751) (← links)
- i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits (Q3582753) (← links)
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers (Q3582771) (← links)
- Practical Identity-Based Encryption Without Random Oracles (Q3593111) (← links)
- New Multiparty Signature Schemes for Network Routing Applications (Q3604410) (← links)
- Hierarchical Identity Based Encryption with Polynomially Many Levels (Q3611781) (← links)
- Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts) (Q3627434) (← links)
- Computing on Encrypted Data (Q3648484) (← links)
- Hierarchical ID-Based Cryptography (Q4412820) (← links)
- (Q4434881) (← links)
- (Q4434890) (← links)
- (Q4474162) (← links)
- (Q4589021) (← links)
- (Q4737253) (← links)
- Encrypted Messages from the Heights of Cryptomania (Q4910274) (← links)
- Packed Ciphertexts in LWE-Based Homomorphic Encryption (Q4915997) (← links)
- Candidate Multilinear Maps from Ideal Lattices (Q4924400) (← links)
- Quadratic Span Programs and Succinct NIZKs without PCPs (Q4924436) (← links)
- Fully homomorphic encryption using ideal lattices (Q5172710) (← links)
