@conference {14696,
	title = {Fable: A Language for Enforcing User-defined Security Policies},
	booktitle = {IEEE Symposium on Security and Privacy, 2008. SP 2008},
	year = {2008},
	month = {2008/05/18/22},
	pages = {369 - 383},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This paper presents FABLE, a core formalism for a programming language in which programmers may specify security policies and reason that these policies are properly enforced. In FABLE, security policies can be expressed by associating security labels with the data or actions they protect. Programmers define the semantics of labels in a separate part of the program called the enforcement policy. FABLE prevents a policy from being circumvented by allowing labeled terms to be manipulated only within the enforcement policy; application code must treat labeled values abstractly. Together, these features facilitate straightforward proofs that programs implementing a particular policy achieve their high-level security goals. FABLE is flexible enough to implement a wide variety of security policies, including access control, information flow, provenance, and security automata. We have implemented FABLE as part of the LINKS web programming language; we call the resulting language SELlNKS. We report on our experience using SELlNKS to build two substantial applications, a wiki and an on-line store, equipped with a combination of access control and provenance policies. To our knowledge, no existing framework enables the enforcement of such a wide variety of security policies with an equally high level of assurance.},
	keywords = {Access control, Automata, Collaborative work, Communication system security, Computer languages, computer security, Data security, enforcement policy, FABLE, Government, high-level security goals, information flow, Information security, Language-based security, programming languages, Programming profession, provenance, security automata, security labels, security of data, user-defined security policies, verified enforcement, Web programming language},
	isbn = {978-0-7695-3168-7},
	doi = {10.1109/SP.2008.29},
	author = {Swamy,N. and Corcoran,B.J. and Hicks, Michael W.}
}
@article {12094,
	title = {Wireless Network Security and Interworking},
	journal = {Proceedings of the IEEE},
	volume = {94},
	year = {2006},
	month = {2006/02//},
	pages = {455 - 466},
	abstract = {A variety of wireless technologies have been standardized and commercialized, but no single technology is considered the best because of different coverage and bandwidth limitations. Thus, interworking between heterogeneous wireless networks is extremely important for ubiquitous and high-performance wireless communications. Security in interworking is a major challenge due to the vastly different security architectures used within each network. The goal of this paper is twofold. First, we provide a comprehensive discussion of security problems and current technologies in 3G and WLAN systems. Second, we provide introductory discussions about the security problems in interworking, the state-of-the-art solutions, and open problems.},
	keywords = {3G mobile communication, 3G systems, Authentication, Bandwidth, Communication system security, computer network security, computer security, Data security, internetworking, Land mobile radio cellular systems, Paper technology, security architectures, security of data, telecommunication security, wireless communication, wireless communications, Wireless LAN, wireless network security, Wireless networks, wireless technologies, WLAN systems},
	isbn = {0018-9219},
	doi = {10.1109/JPROC.2005.862322},
	author = {Shin,M. and Ma,J. and Mishra,A. and Arbaugh, William A.}
}
@article {12080,
	title = {Proactive key distribution using neighbor graphs},
	journal = {IEEE Wireless Communications},
	volume = {11},
	year = {2004},
	month = {2004/02//},
	pages = {26 - 36},
	abstract = {User mobility in wireless data networks is increasing because of technological advances, and the desire for voice and multimedia applications. These applications, however, require that handoffs between base stations (or access points) be fast to maintain the quality of the connections. In this article we introduce a novel data structure, the neighbor graph, that dynamically captures the mobility topology of a wireless network. We show how neighbor graphs can be utilized to obtain a 99 percent reduction in the authentication time of an IEEE 802.11 handoff (full EAP-TLS) by proactively distributing necessary key material one hop ahead of the mobile user. We also present a reactive method for fast authentication that requires only firmware changes to access points and hence can easily be deployed on existing wireless networks.},
	keywords = {access points, Authentication, authentication time, Base stations, Communication system security, Delay, graph theory, GSM, IEEE 802.11 handoff, Land mobile radio cellular systems, Message authentication, mobile radio, Multiaccess communication, neighbor graph, Network topology, Roaming, telecommunication security, Telephone sets, user mobility, Wi-Fi networks, wireless data networks, Wireless LAN, Wireless networks},
	isbn = {1536-1284},
	doi = {10.1109/MWC.2004.1269714},
	author = {Mishra,A. and Min Ho Shin and Petroni,N. L. and Clancy,T. C and Arbaugh, William A.}
}
@article {12088,
	title = {The dangers of mitigating security design flaws: a wireless case study},
	journal = {IEEE Security \& Privacy},
	volume = {1},
	year = {2003},
	month = {2003/02//Jan},
	pages = {28 - 36},
	abstract = {Mitigating design flaws often provides the only means to protect legacy equipment, particularly in wireless local area networks. A synchronous active attack against the wired equivalent privacy protocol demonstrates how mitigating one flaw or attack can facilitate another.},
	keywords = {Communication system security, computer security, cryptography, design flaw mitigation, Dictionaries, legacy equipment, privacy, Protection, Protocols, security design flaws, security of data, synchronous active attack, telecommunication security, Telecommunication traffic, wired equivalent privacy protocol, Wireless LAN, wireless local area networks, Wireless networks},
	isbn = {1540-7993},
	doi = {10.1109/MSECP.2003.1176993},
	author = {Petroni,N. L. and Arbaugh, William A.}
}
