搜索结果: 151-165 共查到“军事学 Homomorphic encryption”相关记录208条 . 查询时间(0.085 秒)
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 ...
Homomorphic encryption from codes
public-key cryptography / homomorphic encryption code-based cryptosystems
2012/6/14
We propose a new homomorphic encryption scheme based on the hardness of decoding under independent random noise from certain affine families of codes. Unlike in previous lattice-based homomorphic encr...
Homomorphic encryption from codes
public-key cryptography / homomorphic encryption code-based cryptosystems
2012/3/22
We propose a new homomorphic encryption scheme based on the hardness of decoding under independent random noise from certain affine families of codes. Unlike in previous lattice-based homomorphic encr...
Homomorphic encryption from codes
public-key cryptography / homomorphic encryption code-based cryptosystems
2012/3/21
We propose a new homomorphic encryption scheme based on the hardness of decoding under independent random noise from certain affine families of codes. Unlike in previous lattice-based homomorphic encr...
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)...
Improving Additive and Multiplicative Homomorphic Encryption Schemes Based on Worst-Case Hardness Assumptions}
homomorphic encryption secure function evaluation lattices
2012/6/14
In CRYPTO 2010, Aguilar et al. proposed a somewhat homomorphic encryption scheme, i.e. an encryption scheme allowing to compute a limited amount of sums and products over encrypted data, with a securi...
Improving Additive and Multiplicative Homomorphic Encryption Schemes Based on Worst-Case Hardness Assumptions}
homomorphic encryption secure function evaluation lattices
2012/3/22
In CRYPTO 2010, Aguilar et al. proposed a somewhat homomorphic encryption scheme, i.e. an encryption scheme allowing to compute a limited amount of sums and products over encrypted data, with a securi...
Improving Additive and Multiplicative Homomorphic Encryption Schemes Based on Worst-Case Hardness Assumptions}
homomorphic encryption secure function evaluation lattices
2012/3/21
In CRYPTO 2010, Aguilar et al. proposed a somewhat homomorphic encryption scheme, i.e. an encryption scheme allowing to compute a limited amount of sums and products over encrypted data, with a securi...
Parallel Homomorphic Encryption
homomorphic encryption local random reductions parallel computing
2012/6/14
In the problem of private outsourced computation, a client wishes to delegate the evaluation of a function f on a private input x to an untrusted worker without the latter learning anything about x an...
Parallel Homomorphic Encryption
homomorphic encryption local random reductions parallel computing MapReduce Hadoop cluster-computing cloud computing
2012/3/22
In the problem of private outsourced computation, a client wishes to delegate the evaluation of a function f on a private input x to an untrusted worker without the latter learning anything about x an...