348 search results - page 18 / 70 » Secure Computation on the Web: Computing without Simultaneou... |
106
click to vote
ISI
2007
Springer
14 years 11 months ago
2007
Springer
Privacy-preserving data mining is an important issue in the areas of data mining and security. In this paper, we study how to conduct association rule mining, one of the core data...
WWW
2004
ACM
16 years 12 days ago
2004
ACM
A scalable approach to trust negotiation is required in Web service environments that have large and dynamic requester populations. We introduce Trust-Serv, a model-driven trust n...
DSN
2008
IEEE
15 years 6 months ago
2008
IEEE
Unlike other diversity-based approaches, N-variant systems thwart attacks without requiring secrets. Instead, they use redundancy (to require an attacker to simultaneously comprom...
IPPS
2005
IEEE
15 years 5 months ago
2005
IEEE
Interactive communication services as telephony and video-conferences use the infrastructure of existing LANs and the Internet more and more. The advantages are obvious. For examp...
102
click to vote
TCC
2009
Springer
16 years 8 days ago
2009
Springer
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...