Homomorphic Autocomplete

No abstract is available for this paper.

• Publication year

  2015

• Venue

  IACR Cryptology ePrint Archive

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Homomorphic AES evaluation using the modified LTV scheme

  2015influential reference
• Fully Homomorphic Encryption without bootstrapping

  2015cited by this paper
• FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second

  2015cited by this paper
• cuHE: A Homomorphic Encryption Accelerator Library

  2015influential reference
• Low Depth Circuits for Efficient Homomorphic Sorting

  2015cited by this paper
• A Comparison of the Homomorphic Encryption Schemes FV and YASHE

  2014influential reference
• Public Key Cryptography

  2014cited by this paper
• Homomorphic AES Evaluation using NTRU

  2014influential reference
• Bandwidth Efficient PIR from NTRU

  2014cited by this paper
• (Leveled) Fully Homomorphic Encryption without Bootstrapping

  2014cited by this paper
• Private Computation on Encrypted Genomic Data

  2014cited by this paper
• Private Predictive Analysis on Encrypted Medical Data

  2014cited by this paper
• Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme

  2013influential reference
• Estimating Key Sizes for High Dimensional Lattice-Based Systems

  2013cited by this paper
• Homomorphic Evaluation of the AES Circuit

  2012cited by this paper
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption

  2012influential reference
• Fully homomorphic SIMD operations

  2012cited by this paper
• ML Confidential: Machine Learning on Encrypted Data

  2012cited by this paper
• Efficient Fully Homomorphic Encryption from (Standard) LWE

  2011cited by this paper
• Making NTRU as Secure as Worst-Case Problems over Ideal Lattices

  2011influential reference
• Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits

  2011cited by this paper
• Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages

  2011cited by this paper
• Can homomorphic encryption be practical?

  2011cited by this paper
• Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes

  2010cited by this paper
• Faster Fully Homomorphic Encryption

  2010cited by this paper
• Fully Homomorphic Encryption over the Integers

  2010cited by this paper
• Fully homomorphic encryption using ideal lattices

  2009cited by this paper
• A fully homomorphic encryption scheme

  2009cited by this paper
• NTRU: A Ring-Based Public Key Cryptosystem

  1998influential reference

• Flattening NTRU for Evaluation Key Free Homomorphic Encryption

  2020cites this paper
• Marble: Making Fully Homomorphic Encryption Accessible to All

  2018cites this paper
• Revisiting Lattice Attacks on Overstretched NTRU Parameters

  2017cites this paper
• Comparison between Subfield and Straightforward Attacks on NTRU

  2016cites this paper