Sciweavers

321 search results - page 32 / 65
» Secure Multiparty Computation of Approximations
Sort
View
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
14 years 4 months ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...
JOC
2010
123views more  JOC 2010»
13 years 5 months ago
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
Abstract. In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computati...
Yonatan Aumann, Yehuda Lindell
CCS
2009
ACM
14 years 5 months ago
Towards secure dataflow processing in open distributed systems
Open distributed systems such as service oriented architecture and cloud computing have emerged as promising platforms to deliver software as a service to users. However, for many...
Juan Du, Wei Wei, Xiaohui Gu, Ting Yu
ASIACRYPT
1999
Springer
14 years 3 months ago
Approximation Hardness and Secure Communication in Broadcast Channels
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have...
Yvo Desmedt, Yongge Wang
PKC
2007
Springer
124views Cryptology» more  PKC 2007»
14 years 4 months ago
Practical and Secure Solutions for Integer Comparison
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...
Juan A. Garay, Berry Schoenmakers, José Vil...