搜索结果: 61-75 共查到“军事学 Fully Homomorphic Encryption”相关记录96条 . 查询时间(0.544 秒)
Better Bootstrapping in Fully Homomorphic Encryption
Bootstrapping Fully Homomorphic Encryption
2012/6/14
Gentry's bootstrapping technique is currently the only known method of obtaining a "pure" fully homomorphic encryption (FHE) schemes, and it may offers performance advantages even in cases that do not...
Better Bootstrapping in Fully Homomorphic Encryption
public-key cryptography / Bootstrapping Fully Homomorphic Encryption
2012/3/20
Gentry's bootstrapping technique is currently the only known method of obtaining a "pure" fully homomorphic encryption (FHE) schemes, and it may offers performance advantages even in cases that do not...
Cloud-Assisted Multiparty Computation from Fully Homomorphic Encryption
Cloud-Assisted Multiparty Computation Fully Homomorphic Encryption
2012/6/14
We construct protocols for secure multiparty computation with the help of a computationally powerful party, namely the "cloud''. Our protocols are simultaneously efficient in a number of metrics:
Cloud-Assisted Multiparty Computation from Fully Homomorphic Encryption
Cloud-Assisted Multiparty Computation Fully Homomorphic Encryption
2012/3/20
We construct protocols for secure multiparty computation with the help of a computationally powerful party, namely the "cloud''. Our protocols are simultaneously efficient in a number of metrics: * Ro...
Fully Homomorphic Encryption Based on Approximate Matrix GCD
Fully Homomorphic Encryption Approximate Matrix GCD
2012/6/14
We first introduce approximate matrix GCD problem (AMGCD), and construct public key encryption schemes based on AMGCD. Then, we define a variant of AMGCD and design a new fully homomorphic encryption ...
Fully Homomorphic Encryption Based on Approximate Matrix GCD
Fully Homomorphic Encryption Approximate Matrix GCD Learning with Error Approximate GCD
2012/3/21
We first introduce approximate matrix GCD problem (AMGCD), and construct public key encryption schemes based on AMGCD. Then, we define a variant of AMGCD and design a new fully homomorphic encryption ...
Fully Homomorphic Encryption Based on Approximate Matrix GCD
Fully Homomorphic Encryption Approximate Matrix GCD Learning with Error Approximate GCD
2012/3/22
We first introduce approximate matrix GCD problem (AMGCD), and construct public key encryption schemes based on AMGCD. Then, we define a variant of AMGCD and design a new fully homomorphic encryption ...
Fully Homomorphic Encryption with Polylog Overhead
public-key cryptography / Homomorphic encryption Bootstrapping Batching, Automorphism Galois group Permutation network
2012/3/23
We show that homomorphic evaluation of (wide enough) arithmetic circuits can be accomplished with only polylogarithmic overhead. Namely, we present a construction of fully homomorphic encryption (FHE)...
On the sparse subset sum problem from Gentry-Halevi's implementation of fully homomorphic encryption
public-key cryptography / sparse subset sum lattice reduction dimension reduction method geometric progression homomorphic encryption
2012/3/23
In Gentry's fully homoomrphic cryptosystem, a sparse subset sum problem is used and a big set is included in the public key. In the implementation of a variant of Gentry's scheme, to reduce the size o...
Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
foundations / Fully-homomorphic encryption
2012/3/28
We describe a new approach for constructing fully homomorphic encryption (FHE) schemes. Previous FHE schemes all use the same blueprint from [Gentry 2009]: First construct a somewhat homomorphic encry...
Improved Key Generation For Gentry's Fully Homomorphic Encryption Scheme
slow key generation process Gentry--Halevi key
2012/3/26
A key problem with the original implementation of the Gentry Fully Homomorphic Encryption scheme was the slow key generation process. Gentry and Halevi provided a fast technique for $2$-power cyclotom...
Better Bootstrapping in Fully Homomorphic Encryption
public-key cryptography / Bootstrapping Fully Homomorphic Encryption
2012/8/28
Gentry's bootstrapping technique is currently the only known method of obtaining a "pure" fully homomorphic encryption (FHE) schemes, and it may offers performance advantages even in cases that do not...
Threshold Fully Homomorphic Encryption and Secure Computation
Homomorphic Encryption Threshold Encryption Secure Multi-Party Communication Communication and Round Complexity Proof Of Knowledge
2012/3/26
Cramer, Damg\r{a}rd, and Nielsen~\cite{CDN01} show how to construct an efficient secure multi-party computation scheme using a threshold homomorphic encryption scheme that has four properties i) a hon...
Threshold Fully Homomorphic Encryption and Secure Computation
Homomorphic Encryption Threshold Encryption Secure Multi-Party Communication Communication and Round Complexity Proof Of Knowledge
2012/3/26
Cramer, Damg\r{a}rd, and Nielsen~\cite{CDN01} show how to construct an efficient secure multi-party computation scheme using a threshold homomorphic encryption scheme that has four properties i) a hon...
More Practical Fully Homomorphic Encryption
Fully Homomorphic Encryption Polynomial Coset Problem Factoring Integer Diophantine Equation Problem Approximate GCD SSSP
2012/3/29
In this paper, we first modify the Smart-Vercauteren’s fully homomorphic encryption scheme [SV10] by applying self-loop bootstrappable technique. The security of the modified scheme only depends on th...