31 search results - page 1 / 7 » Secure Distortion Computation Among Untrusting Parties Using... |
ICIP
2009
IEEE
15 years 10 months ago
2009
IEEE
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 ...
110
click to vote
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...
ASIACRYPT
2004
Springer
15 years 3 months ago
2004
Springer
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...
CCS
2010
ACM
14 years 10 months ago
2010
ACM
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...
ISI
2005
Springer
15 years 3 months ago
2005
Springer
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...