| Formal security analysis of basic network-attached storage |
| Full text |
Pdf
(261 KB)
|
| Source
|
Workshop on Formal Methods in Security Engineering
archive
Proceedings of the 2005 ACM workshop on Formal methods in security engineering
table of contents
Fairfax, VA, USA
SESSION: Session 2
table of contents
Pages: 43 - 52
Year of Publication: 2005
ISBN:1-59593-231-3
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 2, Downloads (12 Months): 68, Citation Count: 0
|
|
|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
 |
2
|
|
 |
3
|
|
 |
4
|
Martín Abadi , Cédric Fournet , Georges Gonthier, Authentication primitives and their compilation, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.302-315, January 19-21, 2000, Boston, MA, USA
[doi> 10.1145/325694.325734]
|
| |
5
|
|
| |
6
|
M. Abadi and A.D. Gordon. A calculus for cryptographic protocols: The spi calculus. Technical Report SRC-RR-149, Digital Systems Research Center, Palo Alto CA, January 1998.
|
| |
7
|
B. Blanchet. Automatic Proof of Strong Secrecy for Security Protocols. In IEEE Symposium on Security and Privacy, pages 86--100, May 2004.
|
| |
8
|
M. Burrows, M. Abadi, and R. Needham. A logic of authentication. Proceedings of the Royal Society of London A, 426:233--271, 1989. A preliminary version appeared as Digital Equipment Corporation Systems Research Center report No.39, February 1989.
|
| |
9
|
G.A. Gibson, D.P. Nagle, K. Amiri, F.W. Chang, E. Feinberg, H.G.C. Lee, B. Ozceri, E. Riede, and D. Rochberg. A case for network-attached secure disks. Technical Report CMU. CS-96-142, 1996.
|
| |
10
|
|
| |
11
|
H. Gobioff, G. Gibson, and J. Tygar. Security for network attached storage devices. Technical Report CMU-CS-97-185, Carnegie Mellon University, October 1997.
|
| |
12
|
|
| |
13
|
A. Kennedy. Untrustworthy programming anguages. Talk at the Joint Queen Mary/Imperial College Seminar series, May 2005. Slides available at http://research.microsoft.com/~akenn/sec/index.htm.
|
| |
14
|
|
 |
15
|
|
| |
16
|
|
| |
17
|
R. Milner. Fully abstract models of typed lambda-calculi. Theoretical Computer Science, 4(1):1--22, 1977.
|
| |
18
|
R. Milner. The polyadic pi-calculus: a tutorial. In F.L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification, pages 203--246. Springer-Verlag, 1993.
|
| |
19
|
R.D. Nicola and M.C.B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34(1--2):83--133, Nov. 1984.
|
| |
20
|
|
| |
21
|
Y. Zhu and Y. Hu. SNARE: A strong security scheme for network-attached storage. In SRDS'03: Proceedings of the 22nd Symposium on Reliable Distributed Systems, pages 250--259. IEEE Computer Society, 2003.
|
|