90 search results - page 10 / 18 » Improved Primitives for Secure Multiparty Integer Computatio... |
CANS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We consider generic Garbled Circuit (GC)-based techniques for Secure Function Evaluation (SFE) in the semi-honest model. We describe efficient GC constructions for additi...
ACSAC
2001
IEEE
13 years 11 months ago
2001
IEEE
The growth of the Internet opens up tremendous opportunities for cooperative computation, where the answer depends on the private inputs of separate entities. Sometimes these comp...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
Secure multiparty computation allows parties to jointly compute a function of their private inputs without revealing anything but the output. Theoretical results [2] provide a gen...
EUROCRYPT
2008
Springer
13 years 9 months ago
2008
Springer
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
EUROCRYPT
2007
Springer
13 years 11 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...