搜索结果: 76-90 共查到“军事学 Fully Homomorphic Encryption”相关记录96条 . 查询时间(0.028 秒)
Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
public-key cryptography / fully-homomorphic encryption cryptanalysis
2012/3/26
At EUROCRYPT '10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common divisors problems, which w...
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...
Fully Homomorphic Encryption without Bootstrapping
fully homomorphic encryption cryptography
2012/3/28
We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual contribution in our work...
Efficient Fully Homomorphic Encryption from (Standard) LWE
public-key cryptography / fully homomorphic encryption learning with errors
2012/3/27
We present a fully homomorphic encryption scheme that is based solely on the (standard) learning with errors (LWE) assumption. Applying known results on LWE, the security of our scheme is based on the...
Cloud-Assisted Multiparty Computation from Fully Homomorphic Encryption
Cloud-Assisted Multiparty Computation Fully Homomorphic Encryption
2012/8/28
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:
Efficient Fully Homomorphic Encryption from (Standard) LWE
public-key cryptography fully homomorphic encryption learning with errors
2011/7/25
We present a fully homomorphic encryption scheme that is based solely on the (standard) learning with errors (LWE) assumption.
Cryptanalysis of the Smart-Vercauteren and Gentry-Halevi’s Fully Homomorphic Encryption
Fully Homomorphic Encryption Cryptanalysis Principal Ideal Lattice
2011/7/25
In this paper, we first analyze the security of the fully homomorphic encryption schemes based on principal ideal lattice in [SV10, GH11] by using block lattice reduction algorithm.
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...
Fully Homomorphic Encryption, Approximate Lattice Problem and LWE
Fully Homomorphic Encryption, Approximate Lattice Problem Approximate Principal Ideal Lattice Problem LWE, Approximate GCD Integer Factoring
2012/3/29
In this paper, we first introduce a new concept of approximate lattice problem (ALP), which is an extension of learning with errors (LWE). Next, we propose two ALP-based public key encryption schemes....
Fully Homomorphic Encryption without Bootstrapping
fully homomorphic encryption learning with error RLWE
2011/6/9
We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance, bases security on weaker assumptions, and does not require Gentry's bootstrapping proc...
Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
foundations / Fully-homomorphic encryption
2011/6/9
All currently known fully homomorphic encryption (FHE) schemes use the same blueprint from [Gentry 2009]: First construct a somewhat homomorphic encryption (SWHE) scheme, next "squash" the decryption ...
Self-loop-based Modification of Smart and Vercauteren’s Fully Homomorphic Encryption
Fully Homomorphic Encryption Polynomial Coset Problem Sparse Subset Sum Problem
2011/3/11
This paper modifies the Smart and Vercauteren’s fully homomorphic encryption scheme [SV10] by applying self-loop bootstrappable technique. The security of the modified scheme only depends on the hardn...
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...
Fully Homomorphic Encryption and Ring-LWE over the Integers
Fully Homomorphic Encryption Principal Ideal Lattice Ring-LWE over theIntegers
2011/3/11
This paper constructs a new fully homomorphic encryption scheme by applying self-loop bootstrappable technique. The security of our scheme depends on the hardness of the decision problem of a hidden p...
Minimizing Non-interactive Zero-Knowledge Proofs Using Fully Homomorphic Encryption
Non-interactive zero-knowledge proofs fully homomorphic encryption
2011/1/12
A non-interactive zero-knowledge proof can be used to demonstrate the truth of a statement without revealing anything else. It has been shown under standard cryptographic assumptions that non-interact...