Secret computation of purchase history data using somewhat homomorphic encryption
From MaRDI portal
Publication:890595
Recommendations
- Practical packing method in somewhat homomorphic encryption
- Efficient Secure Matrix Multiplication Over LWE-Based Homomorphic Encryption
- Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption
- Secure statistical analysis using RLWE-based homomorphic encryption
- A new privacy homomorphism and applications
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- BKZ 2.0: Better lattice security estimates
- Better key sizes (and attacks) for LWE-based encryption
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption over the integers with shorter public keys
- Fully homomorphic encryption using ideal lattices
- Homomorphic evaluation of the AES circuit
- Implementing Gentry's fully-homomorphic encryption scheme
- Multiparty Computation from Somewhat Homomorphic Encryption
- On ideal lattices and learning with errors over rings
- Packed homomorphic encryption based on ideal lattices and its application to biometrics
- Privacy-Preserving Wildcards Pattern Matching Using Symmetric Somewhat Homomorphic Encryption
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Theory of Cryptography
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(3)
This page was built for publication: Secret computation of purchase history data using somewhat homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890595)