Sciweavers

113 search results - page 1 / 23
» Threshold Fully Homomorphic Encryption and Secure Computatio...
Sort
View
IACR
2011
89views more  IACR 2011»
12 years 4 months ago
Threshold Fully Homomorphic Encryption and Secure Computation
Steven Myers, Mona Sergi, Abhi Shelat
IACR
2011
196views more  IACR 2011»
12 years 4 months ago
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
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...
Gilad Asharov, Abhishek Jain, Daniel Wichs
EUROCRYPT
2006
Springer
13 years 8 months ago
Efficient Binary Conversion for Paillier Encrypted Values
We consider the framework of secure n-party computation based on threshold homomorphic cryptosystems as put forth by Cramer,
Berry Schoenmakers, Pim Tuyls
ASIACRYPT
2004
Springer
13 years 10 months ago
Practical Two-Party Computation Based on the Conditional Gate
Abstract. We present new results in the framework of secure multiparty computation based on homomorphic threshold cryptosystems. We introduce the conditional gate as a special type...
Berry Schoenmakers, Pim Tuyls
STOC
2012
ACM
236views Algorithms» more  STOC 2012»
11 years 7 months ago
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
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 c...
Adriana López-Alt, Eran Tromer, Vinod Vaiku...