@conference {19026,
	title = {Authentication in the clouds: a framework and its application to mobile users},
	series = {CCSW {\textquoteright}10},
	year = {2010},
	month = {2010},
	pages = {1 - 6},
	publisher = {ACM},
	organization = {ACM},
	abstract = {Cloud computing is a natural fit for mobile security. Typical handsets have input constraints and practical computational and power limitations, which must be respected by mobile security technologies in order to be effective. We describe how cloud computing can address these issues. Our approach is based on a flexible framework for supporting authentication decisions we call TrustCube (to manage the authentication infrastructure) and on a behavioral authentication approach referred to as implicit authentication (to translate user behavior into authentication scores). The combination results in a new authentication paradigm for users of mobile technologies, one where an appropriate balance between usability and trust can be managed through flexible policies and dynamic tuning.},
	keywords = {Authentication, Cloud computing, Mobile computing},
	isbn = {978-1-4503-0089-6},
	url = {http://doi.acm.org/10.1145/1866835.1866837},
	author = {Chow, Richard and Jakobsson, Markus and Masuoka, Ryusuke and Molina,Jesus and Niu, Yuan and Elaine Shi and Song,Zhexuan}
}
@conference {19597,
	title = {Dynamic Provable Data Possession},
	booktitle = {CCS {\textquoteright}09 Proceedings of the 16th ACM Conference on Computer and Communications Security },
	series = {CCS {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {213 - 222},
	publisher = {ACM},
	organization = {ACM},
	abstract = {We consider the problem of efficiently proving the integrity of data stored at untrusted servers. In the provable data possession (PDP) model, the client preprocesses the data and then sends it to an untrusted server for storage, while keeping a small amount of meta-data. The client later asks the server to prove that the stored data has not been tampered with or deleted (without downloading the actual data). However, the original PDP scheme applies only to static (or append-only) files. We present a definitional framework and efficient constructions for dynamic provable data possession (DPDP), which extends the PDP model to support provable updates to stored data. We use a new version of authenticated dictionaries based on rank information. The price of dynamic updates is a performance change from O(1) to O(logn) (or O(nεlog n), for a file consisting of n blocks, while maintaining the same (or better, respectively) probability of misbehavior detection. Our experiments show that this slowdown is very low in practice (e.g. 415KB proof size and 30ms computational overhead for a 1GB file). We also show how to apply our DPDP scheme to outsourced file systems and version control systems (e.g. CVS).},
	keywords = {authenticated data structures, Authentication, integrity checking, outsourced storage, proof of retrievability, provable data possession, skip list},
	isbn = {978-1-60558-894-0},
	url = {http://doi.acm.org/10.1145/1653662.1653688},
	author = {Erway, Chris and K{\"u}p\cc{\"u}, Alptekin and Charalampos Papamanthou and Tamassia, Roberto}
}
@article {15127,
	title = {Efficient and secure authenticated key exchange using weak passwords},
	journal = {Journal of the ACM (JACM)},
	volume = {57},
	year = {2009},
	month = {2009/11//},
	pages = {3:1{\textendash}3:39 - 3:1{\textendash}3:39},
	abstract = {Mutual authentication and authenticated key exchange are fundamental techniques for enabling secure communication over public, insecure networks. It is well known how to design secure protocols for achieving these goals when parties share high-entropy cryptographic keys in advance of the authentication stage. Unfortunately, it is much more common for users to share weak, low-entropy passwords which furthermore may be chosen from a known space of possibilities (say, a dictionary of English words). In this case, the problem becomes much more difficult as one must ensure that protocols are immune to off-line dictionary attacks in which an adversary exhaustively enumerates all possible passwords in an attempt to determine the correct one. We propose a 3-round protocol for password-only authenticated key exchange, and provide a rigorous proof of security for our protocol based on the decisional Diffie-Hellman assumption. The protocol assumes only public parameters{\textemdash}specifically, a {\textquotedblleft}common reference string{\textquotedblright}{\textemdash}which can be {\textquotedblleft}hard-coded{\textquotedblright} into an implementation of the protocol; in particular, and in contrast to some previous work, our protocol does not require either party to pre-share a public key. The protocol is also remarkably efficient, requiring computation only (roughly) 4 times greater than {\textquotedblleft}classical{\textquotedblright} Diffie-Hellman key exchange that provides no authentication at all. Ours is the first protocol for password-only authentication that is both practical and provably-secure using standard cryptographic assumptions.},
	keywords = {Authentication, cryptography, passwords},
	isbn = {0004-5411},
	doi = {10.1145/1613676.1613679},
	url = {http://doi.acm.org/10.1145/1613676.1613679},
	author = {Katz, Jonathan and Ostrovsky,Rafail and Yung,Moti}
}
@conference {19598,
	title = {Authenticated Hash Tables},
	booktitle = {CCS {\textquoteright}08 Proceedings of the 15th ACM Conference on Computer and Communications Security },
	series = {CCS {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {437 - 448},
	publisher = {ACM},
	organization = {ACM},
	abstract = {Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so that the client can save space or achieve load balancing. Authenticating the hash table functionality, i.e., verifying the correctness of queries answered by the server and ensuring the integrity of the stored data, is crucial because the server, lying outside the administrative control of the client, can be malicious. We design efficient and secure protocols for optimally authenticating membership queries on hash tables: for any fixed constants 0 < ε < 1 and κ > 1/ε, the server can provide a proof of integrity of the answer to a (non-)membership query in constant time, requiring O(nε/logκε--1 n) time to treat updates, yet keeping the communication and verification costs constant. This is the first construction for authenticating a hash table with constant query cost and sublinear update cost. Our solution employs the RSA accumulator in a nested way over the stored data, strictly improving upon previous accumulator-based solutions. Our construction applies to two concrete data authentication models and lends itself to a scheme that achieves different trade-offs---namely, constant update time and O(nε/logκε n) query time for fixed ε > 0 and κ > 0. An experimental evaluation of our solution shows very good scalability.},
	keywords = {Authentication, hash tables, rsa accumulator, verification},
	isbn = {978-1-59593-810-7},
	url = {http://doi.acm.org/10.1145/1455770.1455826},
	author = {Charalampos Papamanthou and Tamassia, Roberto and Triandopoulos, Nikos}
}
@conference {18548,
	title = {Authenticated out-of-band communication over social links},
	booktitle = {Proceedings of the first workshop on Online social networks},
	series = {WOSN {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {61 - 66},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Many existing host-based applications rely on their own authentication mechanisms and peer discovery services. Although social networking sites already provide mechanisms for users both to discover other users (e.g., by logging on to the social network Web site) and to communicate securely with each other (e.g., using instant messages within the social networking site), today{\textquoteright}s applications have no way to exploit the relationships and trust that are inherent in these networks. This paper proposes Authenticatr, a framework that allows applications to use the authentication and peer discovery mechanisms inherent in social networking sites to bootstrap their own authenticated communication channels. We describe motivating applications, detail the interface that Authenticatr exposes to applications, and discuss practical considerations and security threats.},
	keywords = {Authentication, Security, social networks},
	isbn = {978-1-60558-182-8},
	doi = {10.1145/1397735.1397749},
	url = {http://doi.acm.org/10.1145/1397735.1397749},
	author = {Ramachandran,Anirudh V. and Feamster, Nick}
}
@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.}
}
@conference {18235,
	title = {Joint security robustness enhancement for quantization embedding},
	booktitle = {Image Processing, 2003. ICIP 2003. Proceedings. 2003 International Conference on},
	volume = {2},
	year = {2003},
	month = {2003/09//},
	pages = {II - 483-6 vol.3 - II - 483-6 vol.3},
	abstract = {This paper studies joint security and robustness enhancement of quantization based data embedding for multimedia authentication applications. We present analysis showing that through a lookup table (LUT) of nontrivial run that maps quantized multimedia features randomly to binary data, the detection error probability can be considerably smaller than the traditional quantization embedding. We quantify the security strength of LUT embedding and enhance its robustness through distortion compensation. Introducing a joint security and capacity measure, we show that the proposed distortion compensated LUT embedding provides joint enhancement of security and robustness over the traditional quantization embedding.},
	keywords = {applications;, Authentication, authentication;, binary, communication;, data, data;, embedding;, error, joint, lookup, lookup;, message, multimedia, probability;, security;, statistics;, table, table;, watermarking;},
	doi = {10.1109/ICIP.2003.1246722},
	author = {Wu,M.}
}
@article {14653,
	title = {A secure PLAN},
	journal = {IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews},
	volume = {33},
	year = {2003},
	month = {2003/08//},
	pages = {413 - 426},
	abstract = {Active networks, being programmable, promise greater flexibility than current networks. Programmability, however, may introduce safety and security risks. This correspondence describes the design and implementation of a security architecture for the active network PLANet. Security is obtained with a two-level architecture that combines a functionally restricted packet language, PLAN, with an environment of general-purpose service routines governed by trust management. In particular, a technique is used which expands or contracts a packet{\textquoteright}s service environment based on its level of privilege, termed namespace-based security. The design and implementation of an active-network firewall and virtual private network is used as an application of the security architecture. Measurements of the system show that the addition of the firewall imposes an approximately 34\% latency overhead and as little as a 6.7\% space overhead to incoming packets.},
	keywords = {active networks, active-network firewall, Authentication, Authorization, Contracts, cryptography, Environmental management, Extraterrestrial measurements, functionally restricted packet language, general-purpose service routines, Internet, latency overhead, namespace-based security, packet switching, PLANet, Planets, privilege level, programmable networks, Safety, safety risks, secure PLAN, security of data, security risks, trust management, two-level architecture, virtual private network, Virtual private networks, Web and internet services},
	isbn = {1094-6977},
	doi = {10.1109/TSMCC.2003.817347},
	author = {Hicks, Michael W. and Keromytis,A. D and Smith,J. M}
}
@conference {14654,
	title = {A secure PLAN (extended version)},
	booktitle = {DARPA Active NEtworks Conference and Exposition, 2002. Proceedings},
	year = {2002},
	month = {2002///},
	pages = {224 - 237},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Active networks promise greater flexibility than current networks, but threaten safety and security by virtue of their programmability. We describe the design and implementation of a security architecture for the active network PLANet (Hicks et al., 1999). Security is obtained with a two-level architecture that combines a functionally restricted packet language, PLAN (Hicks et al., 1998), with an environment of general-purpose service routines governed by trust management (Blaze et al., 1996). In particular, we employ a technique which expands or contracts a packet{\textquoteright}s service environment based on its level of privilege, termed namespace-based security. As an application of our security architecture, we present the design and implementation of an active-network firewall. We find that the addition of the firewall imposes an approximately 34\% latency overhead and as little as a 6.7\% space overhead to incoming packets},
	keywords = {active internetwork, active networks, active-network firewall, Authentication, authorisation, Authorization, Cities and towns, Computer networks, Computer science, cryptography, functionally restricted packet language, general-purpose service routines, Information security, internetworking, IP networks, latency overhead, namespace-based security, PLAN, PLANet, Planets, programmability, Safety, security architecture, telecommunication security, trust management, two-level architecture, Web and internet services},
	isbn = {0-7695-1564-9},
	doi = {10.1109/DANCE.2002.1003496},
	author = {Hicks, Michael W. and Keromytis,A. D and Smith,J. M}
}
@conference {18170,
	title = {Attacks on digital watermarks},
	booktitle = {Signals, Systems, and Computers, 1999. Conference Record of the Thirty-Third Asilomar Conference on},
	volume = {2},
	year = {1999},
	month = {1999/10//},
	pages = {1508 -1512 vol.2 - 1508 -1512 vol.2},
	abstract = {Two methods for attacking watermarks in images and videos have been proposed. The first attack is to remove robust watermarks by iterative block dropping and concealment. Our study suggests that the block size chosen by a robust watermark embedding system should be large enough to circumventing concealment based attacks. The second attacking method is to forge valid watermarks for authentication systems based on fragile-watermarking. Double watermarking is then proposed as one possible countermeasure.},
	keywords = {attacks;copy, Authentication, authentication;video, based, block, coding;, coding;iterative, control;digital, countermeasure;fragile-watermarking;images;iterative, dropping;ownership, EMBEDDING, forging;copyright;image, methods;message, protection;robust, removal;videos;watermarks, size;concealment, system;robust, systems;block, watermark, watermarking, watermarks, watermarks;double},
	doi = {10.1109/ACSSC.1999.832001},
	author = {M. Wu and Liu,Bede}
}
@article {12101,
	title = {A secure active network environment architecture: realization in SwitchWare},
	journal = {IEEE Network},
	volume = {12},
	year = {1998},
	month = {1998/06//May},
	pages = {37 - 45},
	abstract = {An active network is a network infrastructure which is programmable on a per-user or even per-packet basis. Increasing the flexibility of such network infrastructures invites new security risks. Coping with these security risks represents the most fundamental contribution of active network research. The security concerns can be divided into those which affect the network as a whole and those which affect individual elements. It is clear that the element problems must be solved first, since the integrity of network-level solutions will be based on trust in the network elements. In this article we describe the architecture and implementation of a secure active network environment (SANE), which we believe provides a basis for implementing secure network-level solutions. We guarantee that a node begins operation in a trusted state with the AEGIS secure bootstrap architecture. We guarantee that the system remains in a trusted state by applying dynamic integrity checks in the network element{\textquoteright}s runtime system, using a novel naming system, and applying node-to-node authentication when needed. The construction of an extended LAN is discussed},
	keywords = {access protocols, AEGIS secure bootstrap architecture, architecture, Authentication, Collaboration, Communication switching, dynamic integrity checks, extended LAN, Functional programming, implementation, integrity, Intelligent networks, IP networks, Local area networks, network infrastructure, network infrastructures, network operating systems, network-level solutions, node, node-to-node authentication, packet switching, Proposals, ramming system, SANE, secure active network environment architecture, security of data, Switches, SwitchWare, trusted state, Web and internet services},
	isbn = {0890-8044},
	doi = {10.1109/65.690960},
	author = {Alexander,D. S and Arbaugh, William A. and Keromytis,A. D and Smith,J. M}
}
@article {12079,
	title = {The SwitchWare active network architecture},
	journal = {IEEE Network},
	volume = {12},
	year = {1998},
	month = {1998/06//May},
	pages = {29 - 36},
	abstract = {Active networks must balance the flexibility of a programmable network infrastructure against the safety and security requirements inherent in sharing that infrastructure. Furthermore, this balance must be achieved while maintaining the usability of the network. The SwitchWare active network architecture is a novel approach to achieving this balance using three layers: active packets, which contain mobile programs that replace traditional packets; active extensions, which provide services on the network elements and can be dynamically loaded; and a secure active router infrastructure, which forms a high-integrity base on which the security of the other layers depends. In addition to integrity checking and cryptography-based authentication, security in our architecture depends heavily on verification techniques from programming languages, such as strong type checking},
	keywords = {active extensions, active packets, Authentication, Computer languages, Computer networks, cryptography, cryptography-based authentication, high-integrity base, integrity checking, IP networks, LAN interconnection, mobile programs, network operating systems, packet switching, programmable network infrastructure, programming languages, Protocols, Safety, safety requirements, scalability, secure active router infrastructure, Security, security requirements, services, strong type checking, Switches, SwitchWare active network architecture, telecommunication network routing, Tin, usability, verification techniques},
	isbn = {0890-8044},
	doi = {10.1109/65.690959},
	author = {Alexander,D. S and Arbaugh, William A. and Hicks, Michael W. and Kakkar,P. and Keromytis,A. D and Moore,J. T and Gunter,C. A and Nettles,S. M and Smith,J. M}
}
