Pages that link to "Item:Q5172710"
From MaRDI portal
The following pages link to Fully homomorphic encryption using ideal lattices (Q5172710):
Displaying 50 items.
- A full RNS variant of FV like somewhat homomorphic encryption schemes (Q1698661) (← links)
- An efficient quantum somewhat homomorphic symmetric searchable encryption (Q1705121) (← links)
- Homomorphic secret sharing for low degree polynomials (Q1710675) (← links)
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption (Q1711842) (← links)
- Privacy preserving distributed optimization using homomorphic encryption (Q1716476) (← links)
- A full RNS variant of approximate homomorphic encryption (Q1726685) (← links)
- Unsupervised Machine Learning on encrypted data (Q1726695) (← links)
- Perennial secure multi-party computation of universal Turing machine (Q1737594) (← links)
- Practical homomorphic message authenticators for arithmetic circuits (Q1747657) (← links)
- CRT-based fully homomorphic encryption over the integers (Q1749613) (← links)
- The polynomial approximate common divisor problem and its application to the fully homomorphic encryption (Q1750401) (← links)
- Security analysis of cryptosystems using short generators over ideal lattices (Q1756730) (← links)
- On the deductive security of queries to databases with multi-bit records (Q1789206) (← links)
- A new reversible date-hiding algorithm for encrypted images (Q1793158) (← links)
- Efficient and secure outsourced approximate pattern matching protocol (Q1797787) (← links)
- Group homomorphic encryption: characterizations, impossibility results, and applications (Q1943979) (← links)
- Privacy preserving linear regression modeling of distributed databases (Q1947629) (← links)
- Processing secure, verifiable and efficient SQL over outsourced database (Q1991841) (← 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)
- Efficient obfuscation for CNF circuits and applications in cloud computing (Q2001194) (← links)
- Polynomial expressions of \(p\)-ary auction functions (Q2003342) (← links)
- A more efficient leveled strongly-unforgeable fully homomorphic signature scheme (Q2004727) (← links)
- New publicly verifiable computation for batch matrix multiplication (Q2004759) (← links)
- On the structure of Boolean functions with small spectral norm (Q2012184) (← links)
- PRE: stronger security notions and efficient construction with non-interactive opening (Q2015128) (← links)
- Oblivious DFA evaluation on joint input and its applications (Q2023228) (← links)
- CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes (Q2023314) (← links)
- A framework for cryptographic problems from linear algebra (Q2023808) (← links)
- Delegating a product of group exponentiations with application to signature schemes (Q2025335) (← links)
- Discretisation and product distributions in ring-LWE (Q2027267) (← links)
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency (Q2051777) (← links)
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795) (← links)
- Privacy-preserving polynomial interpolation and its applications on predictive analysis (Q2053829) (← links)
- Verifiable single-server private information retrieval from LWE with binary errors (Q2055570) (← links)
- Private information retrieval with sublinear online time (Q2055601) (← links)
- Candidate iO from homomorphic encryption schemes (Q2055602) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q2055661) (← links)
- Boosting verifiable computation on encrypted data (Q2055689) (← links)
- Post-quantum multi-party computation (Q2056694) (← links)
- Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys (Q2056705) (← links)
- High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function (Q2056708) (← links)
- On the security of homomorphic encryption on approximate numbers (Q2056709) (← links)
- The rise of Paillier: homomorphic secret sharing and public-key silent OT (Q2056710) (← links)
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN (Q2056771) (← links)
- An improvement of multi-exponentiation with encrypted bases argument: smaller and faster (Q2057167) (← links)
- Bootstrapping fully homomorphic encryption over the integers in less than one second (Q2061925) (← links)
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings (Q2061939) (← links)
- A geometric approach to homomorphic secret sharing (Q2061949) (← links)