621 search results - page 7 / 125 » Efficient Secure Multi-party Computation |
EUROCRYPT
2007
Springer
14 years 1 months ago
2007
Springer
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
ICALP
2010
Springer
13 years 11 months ago
2010
Springer
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...
EUROCRYPT
2007
Springer
14 years 1 months ago
2007
Springer
ASIACRYPT
2000
Springer
14 years 1 months ago
2000
Springer
PROVSEC
2009
Springer
14 years 4 months ago
2009
Springer
Secure set-intersection computation is one of important problems in secure multiparty computation with various applications. We propose a general construction for secure 2-party se...