N.V. Narendra Kumar
R.K. Shyamasundar
ABSTRACT
Security protocols are essential for establishing trustworthiness of electronic transactions over open networks. Currently used languages and logics for protocol specifications do not facilitate/force the designer to make explicit goals, intentional assumptions or the preceding history across interactions among the stakeholders. Readers-Writers Flow Model (RWFM) is a novel model for information flow control, and has a label structure that explicitly specifies the permissible readers and influencers of a message. RWFM labels succinctly capture the history of a message. In this paper, we sketch an approach to enrich protocol specifications with RWFM labels that overcomes the problem of incomplete protocol specifications, and captures the intensional specifications in a natural way. Our approach tracks information flows in a protocol and makes explicit: (i) the assumptions and goals at each stage of the protocol, (ii) the construction of new messages from components of previous messages, and (iii) the knowledge of roles at various stages. We believe that our approach leads to a robust protocol specification language, including security/cryptographic protocols, that shall be of immense aid to the designer, user and the implementer of protocols.
- M. Abadi. Security protocols and their properties. In Foundations of Secure Computation, NATO Science Series, pages 39--60. IOS Press, 2000.Google Scholar
- M. Abadi and R. Needham. Prudent engineering practice for cryptographic protocols. IEEE Trans. Softw. Eng., 22(1):6--15, Jan. 1996. Google ScholarDigital Library
- D. E. Denning. A lattice model of secure information flow. Commun. ACM, 19(5):236--243, 1976. Google ScholarDigital Library
- G. Lowe. An attack on the needham-schroeder public-key authentication protocol. Inf. Process. Lett., 56(3):131--133, Nov. 1995. Google ScholarDigital Library
- N. V. Narendra Kumar and R. K. Shyamasundar. Realizing purpose-based privacy policies succinctly via information-flow labels. In IEEE 4th BdCloud, pages 753--760, 2014. Google ScholarDigital Library
- R. M. Needham and M. D. Schroeder. Using encryption for authentication in large networks of computers. Commun. ACM, 21(12):993--999, Dec. 1978. Google ScholarDigital Library
- T. Y. C. Woo and S. S. Lam. A lesson on authentication protocol design. SIGOPS Oper. Syst. Rev., 28(3):24--37, July 1994. Google ScholarDigital Library
Index Terms
- POSTER: Dynamic Labelling for Analyzing Security Protocols
Recommendations
Security analysis of efficient (Un-) fair non-repudiation protocols
AbstractAn approach to protocol analysis using asynchronous product automata (APA) and the simple homomorphism verification tool (SHVT) is demonstrated on several variants of the well known Zhou–Gollmann fair non-repudiation protocol and on two more ...
Finite-state analysis of two contract signing protocols
Optimistic contract signing protocols allow two parties to commit to a previously agreed upon contract, relying on a third party to abort or confirm the contract if needed. These protocols are relatively subtle, since there may be interactions between ...
Multi-Stage Key Exchange and the Case of Google's QUIC Protocol
CCS '14: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications SecurityThe traditional approach to build a secure connection is to run a key exchange protocol and, once the key has been established, to use this key afterwards in a secure channel protocol. The security of key exchange and channel protocols, and to some ...
Comments