Sciweavers

59 search results - page 7 / 12
» Fast Computation on Encrypted Polynomials and Applications
Sort
View
FAST
2003
13 years 9 months ago
Data Staging on Untrusted Surrogates
We show how untrusted computers can be used to facilitate secure mobile data access. We discuss a novel architecture, data staging, that improves the performance of distributed ï¬...
Jason Flinn, Shafeeq Sinnamohideen, Niraj Tolia, M...
CVPR
1999
IEEE
14 years 8 months ago
Algebraic Curves That Work Better
An algebraic curve is defined as the zero set of a polynomial in two variables. Algebraic curves are practical for modeling shapes much more complicated than conics or su...
David B. Cooper, Jean-Philippe Tarel, Tolga Tasdiz...
SPDP
1993
IEEE
13 years 11 months ago
Fast Rehashing in PRAM Emulations
In PRAM emulations, universal hashing is a well-known method for distributing the address space among memory modules. However, if the memory access patterns of an application ofte...
J. Keller
SP
2002
IEEE
141views Security Privacy» more  SP 2002»
13 years 7 months ago
Collaborative Filtering with Privacy
Server-based collaborative filtering systems have been very successful in e-commerce and in direct recommendation applications. In future, they have many potential applications in...
John F. Canny
ICICS
2003
Springer
14 years 27 days ago
Secure Route Structures for the Fast Dispatch of Large-Scale Mobile Agents
Abstract. For the application of large-scale mobile agents in a distributed environment, where a large number of computers are connected together to enable the large-scale sharing ...
Yan Wang 0002, Chi-Hung Chi, Tieyan Li