321 search results - page 20 / 65 » Secure Multiparty Computation of Approximations |
SAC
2006
ACM
14 years 4 months ago
2006
ACM
Increasingly pervasive computing throws up scenarios where users may wish to achieve some degree of security in their interaction with other people or equipment, in contexts where...
IACR
2011
12 years 10 months ago
2011
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
AINA
2011
IEEE
13 years 2 months ago
2011
IEEE
—The advent of distributed and ad-hoc-connected systems such as in Ambient Intelligence applications confronts developers with the question on how to specify QoS- and security po...
PKC
2007
Springer
14 years 4 months ago
2007
Springer
Damg˚ard et al. [11] showed a novel technique to convert a polynomial sharing of secret a into the sharings of the bits of a in constant rounds, which is called the bit-decomposit...
CRYPTO
2009
Springer
14 years 5 months ago
2009
Springer
Collusion-free protocols prevent subliminal communication (i.e., covert channels) between parties running the protocol. In the standard communication model, if one-way functions ex...