Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001.
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE

0769511473

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Non-interference, who needs it?

Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001. ◽

10.1109/csfw.2001.930149 ◽

2005 ◽

Cited By ~ 19

Author(s):

P. Ryan ◽

J. McLean ◽

J. Millen ◽

V. Gligor

Download Full-text

Relating cryptography and cryptographic protocols

Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001. ◽

10.1109/csfw.2001.930140 ◽

2005 ◽

Author(s):

A. Scedrov

Keyword(s):

Cryptographic Protocols

Download Full-text

Privacy-preserving cooperative scientific computations

Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001. ◽

10.1109/csfw.2001.930152 ◽

2005 ◽

Cited By ~ 18

Author(s):

Wenliang Du ◽

M.J. Atallah

Keyword(s):

Privacy Preserving ◽

Scientific Computations

Download Full-text

A logical reconstruction of SPKI

Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001. ◽

10.1109/csfw.2001.930136 ◽

2005 ◽

Cited By ~ 7

Author(s):

J.Y. Halpern ◽

R. van der Meyden

Keyword(s):

Logical Reconstruction

Download Full-text

Markov chains, classifiers, and intrusion detection

Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001. ◽

10.1109/csfw.2001.930147 ◽

2005 ◽

Cited By ~ 45

Author(s):

S. Jha ◽

K. Tan ◽

R.A. Maxion

Keyword(s):

Intrusion Detection ◽

Markov Chains

Download Full-text

A generic approach to the security of multi-threaded programs

Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001. ◽

10.1109/csfw.2001.930142 ◽

2005 ◽

Cited By ~ 20

Author(s):

H. Mantel ◽

A. Sabelfeld

Download Full-text

Protocol insecurity with finite number of sessions is NP-complete

Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001. ◽

10.1109/csfw.2001.930145 ◽

2005 ◽

Cited By ~ 74

Author(s):

M. Rusinowitch ◽

M. Turuani

Keyword(s):

Finite Number ◽

Np Complete

Download Full-text

Proving secrecy is easy enough

Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001. ◽

10.1109/csfw.2001.930139 ◽

2005 ◽

Cited By ~ 7

Author(s):

V. Cortier ◽

J. Millen ◽

H. Ruess

Download Full-text

Logical relations for encryption

Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001. ◽

10.1109/csfw.2001.930151 ◽

2005 ◽

Cited By ~ 11

Author(s):

E. Sumii ◽

B.C. Pierce

Download Full-text

An efficient cryptographic protocol verifier based on prolog rules

Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001. ◽

10.1109/csfw.2001.930138 ◽

2005 ◽

Cited By ~ 253

Author(s):

B. Blanchet

Keyword(s):

Cryptographic Protocol

Download Full-text

Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001.Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

Non-interference, who needs it?

Relating cryptography and cryptographic protocols

Privacy-preserving cooperative scientific computations

A logical reconstruction of SPKI

Markov chains, classifiers, and intrusion detection

A generic approach to the security of multi-threaded programs

Protocol insecurity with finite number of sessions is NP-complete

Proving secrecy is easy enough

Logical relations for encryption

An efficient cryptographic protocol verifier based on prolog rules

Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001.
Latest Publications