Sciweavers

52 search results - page 10 / 11
» A Taxonomy of Rational Attacks
Sort
View
SEC
1996
13 years 9 months ago
Intention modelling: approximating computer user intentions for detection and prediction of intrusions
This paper introduces and describes an innovative modelling approach which utilises models that are synthesised through approximate calculations of user actions and extensive repr...
Thomas Spyrou, John Darzentas
ALGORITHMICA
2006
149views more  ALGORITHMICA 2006»
13 years 8 months ago
Partial Lifting and the Elliptic Curve Discrete Logarithm Problem
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from ellip...
Qi Cheng, Ming-Deh A. Huang
CORR
2002
Springer
95views Education» more  CORR 2002»
13 years 7 months ago
Value Based Argumentation Frameworks
In many cases of disagreement it is impossible to demonstrate that either party is wrong. The role of argument in such cases is to persuade rather than refute. Following Perelman, ...
Trevor J. M. Bench-Capon
SECURWARE
2008
IEEE
14 years 2 months ago
ToLeRating UR-STD
A new emerging paradigm of Uncertain Risk of Suspicion, Threat and Danger, observed across the field of information security, is described. Based on this paradigm a novel approac...
Jan Feyereisl, Uwe Aickelin
ANTS
2000
Springer
133views Algorithms» more  ANTS 2000»
14 years 5 days ago
Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
Ming-Deh A. Huang, Ka Lam Kueh, Ki-Seng Tan