Sciweavers

6696 search results - page 1144 / 1340
» Securing social networks
Sort
View
ACSAC
2004
IEEE
15 years 10 months ago
Reasoning About Complementary Intrusion Evidence
This paper presents techniques to integrate and reason about complementary intrusion evidence such as alerts generated by intrusion detection systems (IDSs) and reports by system ...
Yan Zhai, Peng Ning, Purush Iyer, Douglas S. Reeve...
ACSAC
2006
IEEE
15 years 10 months ago
Data Sandboxing: A Technique for Enforcing Confidentiality Policies
When an application reads private / sensitive information and subsequently communicates on an output channel such as a public file or a network connection, how can we ensure that ...
Tejas Khatiwala, Raj Swaminathan, V. N. Venkatakri...
COMPSAC
2004
IEEE
15 years 10 months ago
Services-Oriented Dynamic Reconfiguration Framework for Dependable Distributed Computing
Web services (WS) received significant attention recently because services can be searched, bound, and executed at runtime over the Internet. This paper proposes a dynamic reconfi...
Wei-Tek Tsai, Weiwei Song, Raymond A. Paul, Zhibin...
FPL
2004
Springer
119views Hardware» more  FPL 2004»
15 years 10 months ago
Reconfigurable Instruction Set Extension for Enabling ECC on an 8-Bit Processor
Pervasive networks with low-cost embedded 8-bit processors are set to change our day-to-day life. Public-key cryptography provides crucial functionality to assure security which is...
Sandeep S. Kumar, Christof Paar
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
15 years 9 months ago
On Expected Constant-Round Protocols for Byzantine Agreement
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
Jonathan Katz, Chiu-Yuen Koo
« Prev « First page 1144 / 1340 Last » Next »