42 search results - page 1 / 9 » Semi-homomorphic Encryption and Multiparty Computation |
103
Voted
CRYPTO
2012
Springer
12 years 12 months ago
2012
Springer
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
ASIACRYPT
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We develop a new multi-party generalization of Naor-Nissim indirect indexing, making it possible for many participants to simulate a RAM machine with only poly-logarithmi...
108
Voted
IACR
2011
13 years 9 months ago
2011
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
63
Voted
FC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract We propose several variants of a secure multiparty computation protocol for AES encryption. The best variant requires 2200 + 400 255 expected elementary operations in expe...
83
Voted
EUROCRYPT
2011
Springer
14 years 29 days ago
2011
Springer
An additively-homomorphic encryption scheme enables us to compute linear functions of an encrypted input by manipulating only the ciphertexts. We define the relaxed notion of a se...