1843 search results - page 159 / 369 » Securing Class Initialization |
158
click to vote
CSFW
1996
IEEE
15 years 10 months ago
1996
IEEE
: This paper examines some of the theoretical foundations of the distributable change detection method introduced by Forrest et al. in [10], including fundamental bounds on some of...
176
click to vote
CCS
2006
ACM
15 years 10 months ago
2006
ACM
Let us have an NLFSR with the feedback function g(x) and an LFSR with the generating polynomial f(x). The function g(x) is a Boolean function on the state of the NLFSR and the LFS...
164
Voted
ALT
2010
Springer
15 years 8 months ago
2010
Springer
: In many prediction problems, including those that arise in computer security and computational finance, the process generating the data is best modeled as an adversary with whom ...
178
click to vote
ESORICS
2010
Springer
15 years 7 months ago
2010
Springer
We present a formal, symbolic definition of election verifiability for electronic voting protocols in the context of the applied pi calculus. Our definition is given in terms of bo...
137
click to vote
IJSN
2006
15 years 6 months ago
2006
: Detectors are system components that identify whether the system is in a particular state. Detectors can be used to ensure arbitrary safety properties for systems, that is, they ...