Sciweavers

6167 search results - page 1051 / 1234
» Can Refinement be Automated
Sort
View
CJ
2007
106views more  CJ 2007»
13 years 10 months ago
A Proof of Revised Yahalom Protocol in the Bellare and Rogaway (1993) Model
Although the Yahalom protocol, proposed by Burrows, Abadi, and Needham in 1990, is one of the most prominent key establishment protocols analyzed by researchers from the computer s...
Kim-Kwang Raymond Choo
CN
2007
137views more  CN 2007»
13 years 10 months ago
Defending against hitlist worms using network address space randomization
Worms are self-replicating malicious programs that represent a major security threat for the Internet, as they can infect and damage a large number of vulnerable hosts at timescal...
Spyros Antonatos, Periklis Akritidis, Evangelos P....
CN
2007
148views more  CN 2007»
13 years 10 months ago
A rigorous approach to orchestrating grid services
Although conceived for web services, it is shown how BPEL (Business Process Execution Language) can be used to orchestrate a collection of grid services. This is achieved using th...
Kenneth J. Turner, Koon Leai Larry Tan
CN
2007
90views more  CN 2007»
13 years 10 months ago
SweetBait: Zero-hour worm detection and containment using low- and high-interaction honeypots
As next-generation computer worms may spread within minutes to millions of hosts, protection via human intervention is no longer an option. We discuss the implementation of SweetB...
Georgios Portokalidis, Herbert Bos
IPM
2008
155views more  IPM 2008»
13 years 10 months ago
Determining the informational, navigational, and transactional intent of Web queries
In this paper, we define and present a comprehensive classification of user intent for Web searching. The classification consists of three hierarchical levels of informational, na...
Bernard J. Jansen, Danielle L. Booth, Amanda Spink
« Prev « First page 1051 / 1234 Last » Next »