搜索结果: 136-150 共查到“军事学 Homomorphic encryption”相关记录208条 . 查询时间(0.049 秒)
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
homomorphic encryption identity-based encryption
2014/3/12
We describe a comparatively simple fully homomorphic encryption (FHE) scheme based on the learning with errors (LWE) problem. In previous LWE-based FHE schemes, multiplication is a complicated and exp...
Limits of provable security for homomorphic encryption
proofs of security homomorphic encryption
2014/3/12
We show that public-key bit encryption schemes which support weak (i.e., compact) homomorphic evaluation of any sufficiently "sensitive" collection of functions cannot be proved message indistinguisha...
Fully Homomorphic Encryption for Mathematicians
Fully Homomorphic Encryption Mathematicians
2014/3/13
We give an introduction to Fully Homomorphic Encryption for mathematicians. Fully Homomorphic Encryption allows untrusted parties to take encrypted data Enc(m_1),...,Enc(m_t) and any efficiently compu...
Universally Composable Symbolic Analysis for Two-Party Protocols based on Homomorphic Encryption
Cryptographic protocols Security analysis
2014/3/12
We consider a class of two-party function evaluation protocols in which the parties are allowed to use ideal functionalities as well as a set of powerful primitives, namely commitments, homomorphic en...
On Evaluating Circuits with Inputs Encrypted by Different Fully Homomorphic Encryption Schemes
Fully Homomorphic Encryption Multi-Scheme FHE Trivial Encryptions Ciphertext Trees Multiparty Computations
2013/4/18
We consider the problem of evaluating circuits whose inputs are encrypted with possibly different encryption schemes. Let $\mathcal{C}$ be any circuit with input $x_1, \dots, x_t \in \{0,1\}$, and let...
Multi-bit homomorphic encryption based on learning with errors over rings
public-key cryptography
2013/4/18
Basing on Learning with errors over rings (RLWE) assumption, we provide a new multi-bit somewhat homomorphic encryption scheme. We introduce canonical embedding to transform a ring element into a vect...
On-the-Fly Multiparty Computation on the Cloud via Multikey Fully Homomorphic Encryption
On-the-Fly Multiparty Computation
2013/4/18
We propose a new notion of secure multiparty computation aided by a computationally-powerful but untrusted "cloud" server. In this notion that we call on-the-fly multiparty computation (MPC), the clou...
Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
Leveled homomorphic encryption fully homomorphic encryption ring learning with errors
2013/4/18
In 1996, Hoffstein, Pipher and Silverman introduced an efficient lattice based encryption scheme dubbed NTRUEncrypt. Unfortunately, this scheme lacks a proof of security. However, in 2011, Stehle and ...
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...
We propose a general multiparty computation protocol secure against an active adversary corrupting up to $n-1$ of the $n$ players. The protocol may be used to compute securely arithmetic circuits over...
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...
Cryptanalysis of the Smart-Vercauteren and Gentry-Halevi’s Fully Homomorphic Encryption
Fully Homomorphic Encryption Cryptanalysis Principal Ideal Lattice Lattice Reduction
2012/3/27
For the fully homomorphic encryption schemes in [SV10, GH11], this paper presents attacks to solve equivalent secret key and directly recover plaintext from ciphertext for lattice dimensions n=2048 by...
Targeted Malleability: Homomorphic Encryption for Restricted Computations
foundations / Homomorphic encryption non-malleable encryption
2012/3/28
We put forward the notion of targeted malleability: given a homomorphic encryption scheme, in various scenarios we would like to restrict the homomorphic computations one can perform on encrypted data...
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...