Sciweavers

6164 search results - page 753 / 1233
» Teaching Computer Security
Sort
View
JOC
2002
76views more  JOC 2002»
15 years 6 months ago
A Note on Negligible Functions
In theoretical cryptography, one formalizes the notion of an adversary's success probability being "too small to matter" by asking that it be a negligible function ...
Mihir Bellare
PROVSEC
2010
Springer
15 years 4 months ago
Distinguishing Distributions Using Chernoff Information
Abstract. In this paper, we study the soundness amplification by repetition of cryptographic protocols. As a tool, we use the Chernoff Information. We specify the number of attempt...
Thomas Baignères, Pouyan Sepehrdad, Serge V...
IJNSEC
2010
145views more  IJNSEC 2010»
15 years 1 months ago
Formal Specification of Common Criteria Based Access Control Policy Model
One of the major threats that an enterprise Information system networks are facing today is the Insider threat. As part of the Insider Threat study, lack of an effective access co...
Manpreet Singh, Manjeet S. Patterh
DLOG
2011
14 years 10 months ago
Correcting Access Restrictions to a Consequence More Flexibly
Recent research has shown that labeling ontologies can be useful for restricting the access to some of the axioms and their implicit consequences. However, the labeling of the axio...
Eldora, Martin Knechtel, Rafael Peñaloza
IACR
2011
113views more  IACR 2011»
14 years 6 months ago
KISS: A Bit Too Simple
KISS (‘Keep it Simple Stupid’) is an efficient pseudo-random number generator originally specified by G. Marsaglia and A. Zaman in 1993. G. Marsaglia in 1998 posted a C versio...
Greg Rose