Sciweavers

52 search results - page 3 / 11
» On the practical importance of communication complexity for ...
Sort
View
ICDCS
2007
IEEE
13 years 10 months ago
Testing Security Properties of Protocol Implementations - a Machine Learning Based Approach
Security and reliability of network protocol implementations are essential for communication services. Most of the approaches for verifying security and reliability, such as forma...
Guoqiang Shu, David Lee
IACR
2011
127views more  IACR 2011»
12 years 4 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
CCS
2007
ACM
13 years 10 months ago
A k-anonymous communication protocol for overlay networks
Anonymity is increasingly important for network applications concerning about censorship and privacy. The existing anonymous communication protocols generally stem from mixnet and...
Pan Wang, Peng Ning, Douglas S. Reeves
CSSE
2006
IEEE
13 years 4 months ago
Experimental analysis of a privacy-preserving scalar product protocol
The recent investigation of privacy-preserving data mining has been motivated by the growing concern about the privacy of individuals when their data is stored, aggregated, and mi...
Zhiqiang Yang, Rebecca N. Wright, Hiranmayee Subra...
PKC
2009
Springer
164views Cryptology» more  PKC 2009»
14 years 5 months ago
Asynchronous Multiparty Computation: Theory and Implementation
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
Ivan Damgård, Jesper Buus Nielsen, Martin Ge...