搜索结果: 1-10 共查到“军事学 Fully Homomorphic Encryption over the integers”相关记录10条 . 查询时间(0.093 秒)
Two main computational problems serve as security foundations of current fully homomorphic encryption schemes: Regev's Learning With Errors problem (LWE) and Howgrave-Graham's Approximate Greatest Com...
Scale-Invariant Fully Homomorphic Encryption over the Integers
Fully Homomorphic Encryption Approximate-GCD Homomorphic AES
2016/1/26
At Crypto 2012, Brakerski constructed a scale-invariant fully homomorphic encryption
scheme based on the LWE problem, in which the same modulus is used throughout the evaluation
process, instead of ...
Accelerating Fully Homomorphic Encryption over the Integers with Super-size Hardware Multiplier and Modular Reduction
Fully Homomorphic Encryption FPGA
2014/3/7
A fully homomorphic encryption (FHE) scheme is envisioned as being a key cryptographic tool in building a secure and reliable cloud computing environment, as it allows arbitrarily evaluation of a ciph...
CRT-based Fully Homomorphic Encryption over the Integers
public-key cryptography privacy homomorphism Chinese remainder theorem
2013/2/21
In 1978, Rivest, Adleman and Dertouzos introduced the basic concept of privacy homomorphism that allows computation on encrypted data without decryption. It was elegant work that precedes the recent d...
Batch Fully Homomorphic Encryption over the Integers
public-key cryptography / Fully Homomorphic Encryption Batch Encryption Homomorphic AES
2013/2/21
We extend the fully homomorphic encryption scheme over the integers of van Dijk et al. (DGHV) to batch fully homomorphic encryption, i.e. to a scheme that supports encrypting and homomorphically proce...
Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
public-key cryptography / Fully Homomorphic Encryption
2012/3/26
We describe a compression technique that reduces the public key size of van Dijk, Gentry, Halevi and Vaikuntanathan's (DGHV) fully homomorphic scheme over the integers from \lambda^7 to \lambda^5. Our...
Fully Homomorphic Encryption over the Integers with Shorter Public Keys
public-key cryptography / Fully Homomorphic Encryption
2012/3/26
At Eurocrypt 2010 van Dijk {\sl et al.} described a fully homomorphic encryption scheme over the integers. The main appeal of this scheme (compared to Gentry's) is its conceptual simplicity. This simp...
New Fully Homomorphic Encryption over the Integers
Fully Homomorphic Encryption Approximate Lattice Problem Approximate Principal Ideal Lattice Approximate GCD BDDP SSSP
2012/3/29
We first present a fully homomorphic encryption scheme over the integers, which modifies the fully homomorphic encryption scheme in [vDGHV10]. The security of our scheme is merely based on the hardnes...
New Fully Homomorphic Encryption over the Integers
Fully Homomorphic Encryption Approximate-GCD GCD
2011/3/11
This paper presents a new fully homomorphic encryption scheme over the integers,which is different from the fully homomorphic encryption scheme in [vDGHV10], but the somewhat homomorphic encryption is...
We construct a simple fully homomorphic encryption scheme, using only elementary modular
arithmetic. We use Gentry's technique to construct fully homomorphic scheme from a \boot-
strappable" somewha...