Pages that link to "Item:Q5494940"
From MaRDI portal
The following pages link to Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$ (Q5494940):
Displaying 50 items.
- Trusted computing with addition machines. I (Q681716) (← links)
- On the hardness of module-LWE with binary secret (Q826282) (← links)
- Fine-grained secure computation (Q1631318) (← links)
- Homomorphic lower digits removal and improved FHE bootstrapping (Q1648799) (← links)
- Security considerations for Galois non-dual RLWE families (Q1698662) (← links)
- An efficient quantum somewhat homomorphic symmetric searchable encryption (Q1705121) (← links)
- How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields (Q1999182) (← links)
- A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE (Q2001181) (← links)
- Verifiable single-server private information retrieval from LWE with binary errors (Q2055570) (← links)
- On the security of homomorphic encryption on approximate numbers (Q2056709) (← links)
- An optimized GHV-type HE scheme: simpler, faster, and more versatile (Q2096603) (← links)
- A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence (Q2102080) (← links)
- Deniable fully homomorphic encryption from learning with errors (Q2128579) (← links)
- High-precision bootstrapping for approximate homomorphic encryption by error variance minimization (Q2170015) (← links)
- Fully homomorphic NIZK and NIWI proofs (Q2175946) (← links)
- Compressible FHE with applications to PIR (Q2175949) (← links)
- Differentially private naive Bayes learning over multiple data sources (Q2195313) (← links)
- Survey of information security (Q2385398) (← links)
- Toward non-interactive zero-knowledge proofs for NP from LWE (Q2661693) (← links)
- Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives (Q2663507) (← links)
- Cryptographic algorithms for privacy-preserving online applications (Q2668547) (← links)
- Sample-size-reduction of quantum states for the noisy linear problem (Q2682658) (← links)
- Computational fuzzy extractor from LWE (Q2682915) (← links)
- A multi-valued quantum fully homomorphic encryption scheme (Q2687199) (← links)
- Towards classical hardness of module-LWE: the linear rank case (Q2692385) (← links)
- Linearly Homomorphic Encryption from $$\mathsf {DDH}$$ (Q2790061) (← links)
- Lower Bounds on Assumptions Behind Indistinguishability Obfuscation (Q2796118) (← links)
- Practical Techniques Building on Encryption for Protecting and Managing Data in the Cloud (Q2803632) (← links)
- A novel fully homomorphic encryption scheme bsed on LWE (Q2825264) (← links)
- Quantum Homomorphic Encryption for Polynomial-Sized Circuits (Q2829941) (← links)
- Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems (Q2829945) (← links)
- How to Prove Knowledge of Small Secrets (Q2829957) (← links)
- Cryptanalysis of chosen symmetric homomorphic schemes (Q2834172) (← links)
- Breaking the Circuit Size Barrier for Secure Computation Under DDH (Q2835599) (← links)
- Reduced memory meet-in-the-middle attack against the NTRU private key (Q2970998) (← links)
- Classical Homomorphic Encryption for Quantum Circuits (Q3387755) (← links)
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices (Q3457104) (← links)
- Attacks on the Search RLWE Problem with Small Errors (Q4603026) (← links)
- (Q4638056) (← links)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- Ring Packing and Amortized FHEW Bootstrapping (Q5002783) (← links)
- Homomorphic Encryption (Q5021133) (← links)
- Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
- Identity-based re-encryption scheme with lightweight re-encryption key generation (Q5031868) (← links)
- Privacy-Preserving Extraction of HOG Features Based on Integer Vector Homomorphic Encryption (Q5056012) (← links)
- Towards a Simpler Lattice Gadget Toolkit (Q5087269) (← links)
- Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
- Verifying quantum computations at scale: A cryptographic leash on quantum devices (Q5204995) (← links)
- Private Puncturable PRFs from Standard Lattice Assumptions (Q5738885) (← links)
- Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack (Q5738887) (← links)
