Pages that link to "Item:Q5415546"

The following pages link to On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption (Q5415546):

Displayed 50 items.

• Homomorphic AES evaluation using the modified LTV scheme (Q310240) ‎ (← links)
• Trusted computing with addition machines. I (Q681716) ‎ (← links)
• A new scale-invariant homomorphic encryption scheme (Q781008) ‎ (← links)
• Algorithmic acceleration of B/FV-like somewhat homomorphic encryption for compute-enabled RAM (Q832329) ‎ (← links)
• A homomorphic encryption scheme with adaptive chosen ciphertext security but without random oracle (Q897888) ‎ (← links)
• Security considerations for Galois non-dual RLWE families (Q1698662) ‎ (← links)
• Provably secure NTRUEncrypt over any cyclotomic field (Q1726689) ‎ (← links)
• The polynomial approximate common divisor problem and its application to the fully homomorphic encryption (Q1750401) ‎ (← links)
• On the deductive security of queries to databases with multi-bit records (Q1789206) ‎ (← links)
• Efficient and secure outsourced approximate pattern matching protocol (Q1797787) ‎ (← links)
• A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE (Q2001181) ‎ (← links)
• A framework for cryptographic problems from linear algebra (Q2023808) ‎ (← links)
• Post-quantum multi-party computation (Q2056694) ‎ (← links)
• Multiparty reusable non-interactive secure computation from LWE (Q2056764) ‎ (← links)
• Dynamic decentralized functional encryption (Q2096508) ‎ (← links)
• Keyed-fully homomorphic encryption without indistinguishability obfuscation (Q2096599) ‎ (← links)
• An optimized GHV-type HE scheme: simpler, faster, and more versatile (Q2096603) ‎ (← links)
• On the round complexity of secure quantum computation (Q2120084) ‎ (← links)
• A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs (Q2128576) ‎ (← links)
• A trace map attack against special ring-LWE samples (Q2128748) ‎ (← links)
• Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract) (Q2148748) ‎ (← links)
• Transciphering, using FiLIP and TFHE for an efficient delegation of computation (Q2152020) ‎ (← links)
• Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials (Q2152064) ‎ (← links)
• Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems (Q2161427) ‎ (← links)
• Round-optimal and communication-efficient multiparty computation (Q2169992) ‎ (← links)
• Anonymity of NIST PQC round 3 KEMs (Q2170102) ‎ (← links)
• Flattening NTRU for evaluation key free homomorphic encryption (Q2191204) ‎ (← links)
• Characterizing overstretched NTRU attacks (Q2191207) ‎ (← links)
• D-NTRU: more efficient and average-case IND-CPA secure NTRU variant (Q2195452) ‎ (← links)
• Privacy preserving multi-party computation delegation for deep learning in cloud computing (Q2198099) ‎ (← links)
• Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) ‎ (← links)
• Worst-case to average-case reductions for module lattices (Q2345928) ‎ (← links)
• On the deductive security of queries to confidential databases in cloud computing systems (Q2364247) ‎ (← links)
• Analysis of Gong et al.'s CCA2-secure homomorphic encryption (Q2629237) ‎ (← links)
• Bootstrapping for helib (Q2661696) ‎ (← links)
• Cryptographic algorithms for privacy-preserving online applications (Q2668547) ‎ (← links)
• Secure MPC: laziness leads to GOD (Q2691583) ‎ (← links)
• Maliciously circuit-private multi-key FHE and MPC based on LWE (Q2701482) ‎ (← links)
• Multi-input Functional Encryption and Its Application in Outsourcing Computation (Q2801771) ‎ (← links)
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits (Q2816296) ‎ (← links)
• High-Precision Secure Computation of Satellite Collision Probabilities (Q2827717) ‎ (← links)
• The Feasibility of Outsourced Database Search in the Plain Model (Q2827726) ‎ (← links)
• Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption (Q2829226) ‎ (← links)
• Spooky Encryption and Its Applications (Q2829944) ‎ (← links)
• A Subfield Lattice Attack on Overstretched NTRU Assumptions (Q2835586) ‎ (← links)
• Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts (Q2835588) ‎ (← links)
• Breaking the Circuit Size Barrier for Secure Computation Under DDH (Q2835599) ‎ (← links)
• Depth Optimized Efficient Homomorphic Sorting (Q2946441) ‎ (← links)
• Private Computation on Encrypted Genomic Data (Q2946463) ‎ (← links)
• Efficient Integer Encoding for Homomorphic Encryption via Ring Isomorphisms (Q2946465) ‎ (← links)