310 search results - page 17 / 62 » An Efficient Protocol for Fair Secure Two-Party Computation |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We present a new technique for verifying correspondences in security protocols. In particular, correspondences can be used to formalize authentication. Our technique is fully auto...
TCC
2009
Springer
15 years 10 months ago
2009
Springer
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
ICALP
2010
Springer
14 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
15 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...
IACR
2011
13 years 9 months ago
2011
Companies, organizations, and individuals often wish to share information to realize valuable social and economic goals. Unfortunately, privacy concerns often stand in the way of ...