CSFW
2000
IEEE
13 years 11 months ago
2000
IEEE
We present a framework in which different notions of security can be defined in a uniform and modular way. Each definition of security is formalized as a security predicate by ass...
CSFW
2000
IEEE
13 years 11 months ago
2000
IEEE
Schneider's work on rank functions [14] provides a formal approach to verification of certain properties of a security protocol. However, he illustrates the approach only wit...
CSFW
2000
IEEE
13 years 11 months ago
2000
IEEE
We propose an approach to support confidentiality for mobile implementations of security-sensitive protocols using Java/JVM. An applet which receives and passes on confidential in...
CSFW
1998
IEEE
13 years 11 months ago
1998
IEEE
In previous work [16], we give a type system that guarantees that well-typed multithreaded programs are possibilistically noninterfering. If thread scheduling is probabilistic, ho...
CSFW
1998
IEEE
13 years 11 months ago
1998
IEEE
CCS
2000
ACM
13 years 11 months ago
2000
ACM
The Internet provides an environment where two parties, who are virtually strangers to each other, can make connections and do business together. Before any actual business starts...
CCS
2000
ACM
13 years 11 months ago
2000
ACM
This paper initiates a study of accountable certificate management methods, necessary to support long-term authenticity of digital documents. Our main contribution is a model for ...
AGENTS
2000
Springer
13 years 11 months ago
2000
Springer
AGENTS
2000
Springer
13 years 11 months ago
2000
Springer
AGENTS
2000
Springer
13 years 11 months ago
2000
Springer
A crowd is not only a group of many individuals. Crowd modelling involves problems that arise only when we focus on crowds. For instance, avoiding collision problems related to a ...