Sciweavers

570 search results - page 83 / 114
» Black-box constructions for secure computation
Sort
View
FOCS
2007
IEEE
14 years 2 months ago
Intrusion-Resilient Secret Sharing
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
Stefan Dziembowski, Krzysztof Pietrzak
IMC
2006
ACM
14 years 1 months ago
A multifaceted approach to understanding the botnet phenomenon
The academic community has long acknowledged the existence of malicious botnets, however to date, very little is known about the behavior of these distributed computing platforms....
Moheeb Abu Rajab, Jay Zarfoss, Fabian Monrose, And...
SAC
2006
ACM
14 years 1 months ago
Privacy-preserving SVM using nonlinear kernels on horizontally partitioned data
Traditional Data Mining and Knowledge Discovery algorithms assume free access to data, either at a centralized location or in federated form. Increasingly, privacy and security co...
Hwanjo Yu, Xiaoqian Jiang, Jaideep Vaidya
ASIACRYPT
2008
Springer
13 years 10 months ago
Universally Composable Adaptive Oblivious Transfer
In an oblivious transfer (OT) protocol, a Sender with messages M1, . . . , MN and a Receiver with indices 1, . . . , k [1, N] interact in such a way that at the end the Receiver ...
Matthew Green, Susan Hohenberger
SIGMOD
2001
ACM
165views Database» more  SIGMOD 2001»
14 years 8 months ago
Mining System Audit Data: Opportunities and Challenges
Intrusion detection is an essential component of computer security mechanisms. It requires accurate and efficient analysis of a large amount of system and network audit data. It c...
Wenke Lee, Wei Fan