Sciweavers

31 search results - page 1 / 7
» Secure Distortion Computation Among Untrusting Parties Using...
Sort
View
ICIP
2009
IEEE
14 years 5 months ago
Secure Distortion Computation Among Untrusting Parties Using Homomorphic Encryption
Alice and Bob possess sequences xn and yn respectively and would like to compute d(xn , yn ) where d(., .) is a distortion measure. However, Alice and Bob do not trust each other ...
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
ASIACRYPT
2004
Springer
13 years 9 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
CCS
2010
ACM
13 years 4 months ago
TASTY: tool for automating secure two-party computations
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...
Wilko Henecka, Stefan Kögl, Ahmad-Reza Sadegh...
ISI
2005
Springer
13 years 9 months ago
Private Mining of Association Rules
This paper introduces a new approach to a problem of data sharing among multiple parties, without disclosing the data between the parties. Our focus is data sharing among two parti...
Justin Z. Zhan, Stan Matwin, LiWu Chang