The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - May/June (2011 vol.9)
pp: 26-32
Anupam Datta , Carnegie Mellon University
Jason Franklin , Carnegie Mellon University
Deepak Garg , Carnegie Mellon University
Limin Jia , Carnegie Mellon University
Dilsun Kaynar , Carnegie Mellon University
ABSTRACT
A unified view of a wide range of adversary classes and composition principles for reasoning about security properties of systems are cornerstones of a science of security. They provide a systematic basis for security analysis by explaining and predicting attacks on systems.
INDEX TERMS
adversary models; compositional security; logic-based security; rely-guarantee reasoning
CITATION
Anupam Datta, Jason Franklin, Deepak Garg, Limin Jia, Dilsun Kaynar, "On Adversary Models and Compositional Security", IEEE Security & Privacy, vol.9, no. 3, pp. 26-32, May/June 2011, doi:10.1109/MSP.2010.203
REFERENCES
1. J.M. Wing, "A Call to Action: Look beyond the Horizon," IEEE Security & Privacy, vol. 1, no. 6, 2003, pp. 62–67.
2. D. McCullough, "A Hookup Theorem for Multilevel Security," IEEE Trans. Software Eng., vol. 16, no. 6, 1990, pp. 563–568.
3. R. Canetti, "Universally Composable Security: A New Paradigm for Cryptographic Protocols," Proc. 42nd Ann. Symp. Foundations of Computer Science (FOCS), IEEE CS Press, 2001, pp. 136–145.
4. A. Datta et al., "A Derivation System and Compositional Logic for Security Protocols," J. Computer Security, vol. 13, no. 3, 2005, pp. 423–482.
5. B. Pfitzmann and M. Waidner, "A Model for Asynchronous Reactive Systems and Its Application to Secure Message Transmission," Proc. 21st IEEE Symp. Security and Privacy, IEEE CS Press, 2001, pp. 184–200.
6. C.B. Jones, "Tentative Steps toward a Development Method for Interfering Programs," ACM Trans. Programming Languages and Systems, vol. 5, no. 4, 1983, pp. 596–619.
7. J. Misra and K.M. Chandy, "Proofs of Networks of Processes," IEEE Trans. Software Eng., vol. 7, no. 4, 1981, pp. 417–426.
8. R. Canetti et al., "Composable Security Analysis of OS Services," Cryptology ePrint Archive, Report 2010/213, Int'l Assoc. for Cryptographic Research, 2010; http://eprint.iacr.org/2010213.
9. D. Garg et al., "Compositional System Security in the Presence of Interface-Confined Adversaries," Proc. 26th Conf. Mathematical Foundations of Programming Semantics (MFPS), Elsevier, 2010, pp. 49–71.
10. J. Rushby, "Kernels for Safety?" Safe and Secure Computing Systems, T. Anderson ed., Blackwell Scientific Publications, 1989, pp. 210–220.
11. A. Datta et al., , "A Logic of Secure Systems and Its Application to Trusted Computing," Proc. 30th IEEE Symp. Security and Privacy, IEEE CS Press, 2009, pp. 221–236.
12. A. Roy et al., "Secrecy Analysis in Protocol Composition Logic," Formal Logical Methods for System Security and Correctness, IOS Press, 2008.
13. J. Franklin et al., "Scalable Parametric Verification of Secure Systems: How to Verify Reference Monitors without Worrying about Data Structure Size," Proc. 31st IEEE Symp. Security and Privacy, IEEE CS Press, 2010, pp. 365–379.
14. L.J. Fraim, "SCOMP: A Solution to the Multilevel Security Problem," Computer, vol. 16, no. 7, 1983, pp. 26–34.
31 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool