Sciweavers

6164 search results - page 710 / 1233
» Teaching Computer Security
Sort
View
AAECC
2006
Springer
133views Algorithms» more  AAECC 2006»
15 years 7 months ago
On the low hamming weight discrete logarithm problem for nonadjacent representations
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
James A. Muir, Douglas R. Stinson
IJNSEC
2006
112views more  IJNSEC 2006»
15 years 7 months ago
An Access Control System with Time-constraint Using Support Vector Machines
Access control is an important issue in information security. It is a necessary mechanism for protecting data in a computer system. In this paper, we apply support vector machines...
Chin-Chen Chang, Iuon-Chang Lin, Chia-Te Liao
JALC
2006
61views more  JALC 2006»
15 years 7 months ago
Random Polynomial-Time Attacks and Dolev-Yao Models
In this paper we present an extension of Dolev-Yao models for security protocols with a notion of random polynomial-time (Las Vegas) computability. First we notice that Dolev-Yao ...
Mathieu Baudet
184
Voted
JSW
2008
101views more  JSW 2008»
15 years 7 months ago
Broadcast Authentication with Practically Unbounded One-way Chains
A protocol for assuring the authenticity of information broadcasted over long periods of time is proposed. The protocol is based on time synchronization and uses one-way chains con...
Bogdan Groza
FGCS
2002
89views more  FGCS 2002»
15 years 6 months ago
The Legion support for advanced parameter-space studies on a grid
Parameter-space studies involve running a single application several times with different parameter sets. Since the jobs are mutually independent, many computing resources can be r...
Anand Natrajan, Marty A. Humphrey, Andrew S. Grims...