Patent
Cryptographic processing method and cryptographic processing device
Ikuya Morikawa,Masaya Yasuda +1 more
- 20 Aug 2015
4
TL;DR: In this paper, a computer generates a third encrypted polynomial that corresponds to a result of encrypting a third poynomial by use of a result resulting from multiplying a first encrypted polynomial by a second encrypted poymomial, and outputs cryptographic information that represents the third encrypted polymonomial.
read more
Abstract: A computer generates a third encrypted polynomial that corresponds to a result of encrypting a third polynomial by use of a result of multiplying a first encrypted polynomial by a second encrypted polynomial, and outputs cryptographic information that represents the third encrypted polynomial. The first encrypted polynomial is a polynomial obtained by encrypting a first polynomial that corresponds to a first vector, and the second encrypted polynomial is a polynomial obtained by encrypting a second polynomial that corresponds to a second vector. The third polynomial includes a first term that has a coefficient based on an inner product of the first vector and the second vector and a second term other than the first term, in which a coefficient of the second term is masked.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Method and system for generating / decrypting ciphertext, and method and system for searching ciphertexts in a database
Shu Qin Ren,Benjamin Hong Meng Tan,Khin Mi Mi Aung,Sivaraman Sundaram +3 more
- 23 Apr 2015
TL;DR: In this article, a method for generating a ciphertext based on an exclusive-or (xor) operation on the encrypted data with a cipher pad was proposed. But the cipher pad is generated using an xor-homomorphic function of a first key using a second key generated based on encrypted data.
12
Patent
Homomorphic Encryption with Optimized Encoding
Kim Laine,Nathan Dowlin,Ran Gilad-Bachrach,Michael Naehrig,John Wernsing,Kristin E. Lauter +5 more
- 05 Nov 2015
TL;DR: In this article, the authors describe techniques and/or systems to improve homomorphic encryption to improve processing speed and storage requirements, using a client device to encode data to be sent to a remote server, to be operated on while maintaining confidentiality of data.
11
Patent
Homomorphic encryption with optimized parameter selection
Kim Laine,Nathan Dowlin,Ran Gilad-Bachrach,Michael Naehrig,John Wernsing,Kristin E. Lauter +5 more
- 05 Nov 2015
TL;DR: In this article, the authors describe techniques and/or systems to improve homomorphic encryption to improve processing speed and storage requirements, which can be used on a client device to encode data to be sent to a remote server to be operated on while maintaining confidentiality of data.
7
Patent
Privacy-preserving genomic prediction
Kim Laine,Nicolo Fusi,Ran Gilad-Bachrach,Kristin E. Lauter +3 more
- 21 May 2019
TL;DR: In this paper, the authors describe techniques and/or systems for improving the performance of genomic prediction using homomorphic encryption, where the genomic data corresponding to a genetic profile of an individual can be batch encoded into a plurality of polynomials, homomorphically encrypted, and provided to a service provider for evaluation.
5
References
Fully homomorphic encryption using ideal lattices
Craig Gentry
- 31 May 2009
TL;DR: This work proposes a fully homomorphic encryption scheme that allows one to evaluate circuits over encrypted data without being able to decrypt, and describes a public key encryption scheme using ideal lattices that is almost bootstrappable.
Can homomorphic encryption be practical
Michael Naehrig,Kristin E. Lauter,Vinod Vaikuntanathan +2 more
- 21 Oct 2011
TL;DR: A proof-of-concept implementation of the recent somewhat homomorphic encryption scheme of Brakerski and Vaikuntanathan, whose security relies on the "ring learning with errors" (Ring LWE) problem, and a number of application-specific optimizations to the encryption scheme, including the ability to convert between different message encodings in a ciphertext.
Implementing Gentry's fully-homomorphic encryption scheme
Craig Gentry,Shai Halevi +1 more
- 15 May 2011
TL;DR: In this article, the authors describe a working implementation of a variant of Gentry's fully homomorphic encryption scheme (STOC 2009), similar to the variant used in an earlier implementation effort by Smart and Vercauteren (PKC 2010).
Patent
Cyclotomic polynomial construction of discrete logarithm cryptosystems over finite fields
Arjen K. Lenstra
- 26 Sep 1997
TL;DR: In this article, cyclotomic polynomials are used to construct subgroups of multiplicative groups of finite fields that allow very efficient implementation of discrete logarithm based public key cryptosystems.
81
Patent
Compact fuzzy private matching using a fully-homomorphic encryption scheme
Ioan Calapodescu,Saghar Estehghari,Johan Clier +2 more
- 15 May 2014
TL;DR: In this article, a homomorphic encryption scheme is proposed for data matching, in which two sets of encrypted data elements are converted to respective sets of vectors and each vector is encrypted with a public key.
34
Related Papers (5)
Masaya Yasuda,Takeshi Shimoyama,Jun Kogure +2 more
- 30 Jul 2014
Masaya Yasuda,Takeshi Shimoyama,Jun Kogure +2 more
- 12 Dec 2013