5484 search results - page 98 / 1097 » Almost-Everywhere Secure Computation |
149
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. In this paper, we present a protocol for computing the principal eigenvector of a collection of data matrices belonging to multiple semi-honest parties with privacy const...
142
click to vote
PERCOM
2006
ACM
16 years 3 months ago
2006
ACM
We propose a novel entity authentication approach for pervasive computing environments. A person uses a single device, the Master Key, which aggregates all his digital forms of ac...
116
Voted
CRYPTO
2001
Springer
15 years 8 months ago
2001
Springer
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
131
Voted
CSFW
2007
IEEE
15 years 10 months ago
2007
IEEE
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
123
click to vote
IEICET
2008
15 years 3 months ago
2008
For AES 128 security level there are several natural choices for pairing-friendly elliptic curves. In particular, as we will explain, one might choose curves with k = 9 or curves w...