Sciweavers

5665 search results - page 123 / 1133
» Introduction to Computer Security
Sort
View
ASIACRYPT
2004
Springer
14 years 2 months ago
Strong Conditional Oblivious Transfer and Computing on Intervals
We consider the problem of securely computing the Greater Than (GT) predicate and its generalization – securely determining membership in a union of intervals. We approach these ...
Ian F. Blake, Vladimir Kolesnikov
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 9 months ago
Privacy-Preserving Protocols for Eigenvector Computation
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...
Manas A. Pathak, Bhiksha Raj
PERCOM
2006
ACM
14 years 8 months ago
The Master Key: A Private Authentication Approach for Pervasive Computing Environments
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...
Feng Zhu, Matt W. Mutka, Lionel M. Ni
CRYPTO
2001
Springer
95views Cryptology» more  CRYPTO 2001»
14 years 1 months ago
Robustness for Free in Unconditional Multi-party Computation
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/...
Martin Hirt, Ueli M. Maurer
CSFW
2007
IEEE
14 years 3 months ago
Computationally Sound Mechanized Proofs of Correspondence Assertions
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
Bruno Blanchet