Sciweavers

5665 search results - page 80 / 1133
» Introduction to Computer Security
Sort
View
ASIACRYPT
2009
Springer
16 years 24 days ago
Secure Two-Party Computation Is Practical
Abstract. Secure multi-party computation has been considered by the cryptographic community for a number of years. Until recently it has been a purely theoretical area, with few im...
Benny Pinkas, Thomas Schneider, Nigel P. Smart, St...
CRYPTO
2001
Springer
97views Cryptology» more  CRYPTO 2001»
15 years 10 months ago
Minimal Complete Primitives for Secure Multi-party Computation
Abstract. The study of minimal cryptographic primitives needed to implement secure computation among two or more players is a fundamental question in cryptography. The issue of com...
Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Raf...
TCC
2012
Springer
245views Cryptology» more  TCC 2012»
14 years 1 months ago
Secure Two-Party Computation with Low Communication
We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the ...
Ivan Damgård, Sebastian Faust, Carmit Hazay
AINA
2005
IEEE
15 years 11 months ago
A Practical Modelling Notation for Secure Distributed Computation
Mobile code computation has lead to a new paradigm of distributed computation. A mobile process can move from site to site and interact with the resources as a local process. To p...
Yih-Jiun Lee, Peter Henderson
IACR
2011
104views more  IACR 2011»
14 years 5 months ago
Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces
Protocols for generic secure multi-party computation (MPC) come in two forms: they either represent the function being computed as a boolean circuit, or as an arithmetic circuit o...
Seung Geol Choi, Kyung-Wook Hwang, Jonathan Katz, ...