Sciweavers

5484 search results - page 180 / 1097
» Almost-Everywhere Secure Computation
Sort
View
EUROCRYPT
2000
Springer
15 years 8 months ago
Computing Inverses over a Shared Secret Modulus
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...
Dario Catalano, Rosario Gennaro, Shai Halevi
COMCOM
2008
82views more  COMCOM 2008»
15 years 4 months ago
Virtual password using random linear functions for on-line services, ATM machines, and pervasive computing
People enjoy the convenience of on-line services, Automated Teller Machines (ATMs), and pervasive computing, but online environments, ATMs, and pervasive computing may bring many r...
Ming Lei, Yang Xiao, Susan V. Vrbsky, Chung-Chih L...
COMSUR
2007
101views more  COMSUR 2007»
15 years 4 months ago
A survey of covert channels and countermeasures in computer network protocols
Covert channels are used for the secret transfer of information. Encryption only protects communication from being decoded by unauthorised parties, whereas covert channels aim to ...
Sebastian Zander, Grenville J. Armitage, Philip Br...
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
16 years 4 months ago
Privacy preserving regression modelling via distributed computation
Reluctance of data owners to share their possibly confidential or proprietary data with others who own related databases is a serious impediment to conducting a mutually beneficia...
Ashish P. Sanil, Alan F. Karr, Xiaodong Lin, Jerom...
PERCOM
2006
ACM
16 years 4 months ago
Composition Trust Bindings in Pervasive Computing Service Composition
In pervasive computing, devices or peers may implement or compose services using services from other devices or peers, and may use components from various sources. A composition t...
John Buford, Rakesh Kumar, Greg Perkins