@article {15070,
	title = {A New Framework for Password-Based Authenticated Key Exchange},
	journal = {ACM CCCS 2010},
	year = {2010},
	month = {2010///},
	abstract = {Protocols for password-based authenticated key exchange (PAKE) allowtwo users who share only a short, low-entropy password to agree on a cryptographically strong session key. The challenge in designing such protocols is that they must be immune to off-line dictionary attacks in which an eavesdropping adversary exhaustively enumerates the dictionary of likely passwords in an attempt to match a password to the set of observed transcripts.
To date, few general frameworks for constructing PAKE protocols in the standard model are known. Here, we abstract and generalize a protocol by Jiang and Gong to give a new methodology for realizing PAKE without random oracles, in the common reference string model. In addition to giving a new approach to the problem, the resulting construction offers several advantages over prior work. We also describe an extension of our protocol that is secure within the universal composability~(UC) framework and, when instantiated using El Gamal encryption, is more efficient than a previous protocol of Canetti et al.
},
	keywords = {Cryptographic protocols, password-based key exchange},
	url = {http://eprint.iacr.org/2010/147},
	author = {Groce,Adam and Katz, Jonathan}
}
@inbook {19635,
	title = {Efficient Robust Private Set Intersection},
	booktitle = {Applied Cryptography and Network Security},
	series = {Lecture Notes in Computer Science},
	year = {2009},
	month = {2009/01/01/},
	pages = {125 - 142},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {Computing Set Intersection privately and efficiently between two mutually mistrusting parties is an important basic procedure in the area of private data mining. Assuring robustness, namely, coping with potentially arbitrarily misbehaving (i.e., malicious) parties, while retaining protocol efficiency (rather than employing costly generic techniques) is an open problem. In this work the first solution to this problem is presented.},
	keywords = {Coding and Information Theory, Computer Communication Networks, Cryptographic protocols, Data Encryption, Data Structures, Cryptology and Information Theory, Information Systems Applications (incl.Internet), Privacy Preserving Data Mining, Secure Two-party Computation, Set Intersection, Systems and Data Security},
	isbn = {978-3-642-01956-2, 978-3-642-01957-9},
	url = {http://link.springer.com/chapter/10.1007/978-3-642-01957-9_8},
	author = {Dana Dachman-Soled and Malkin, Tal and Raykova, Mariana and Yung, Moti},
	editor = {Abdalla, Michel and Pointcheval, David and Fouque, Pierre-Alain and Vergnaud, Damien}
}
@conference {12076,
	title = {Bootstrapping security associations for routing in mobile ad-hoc networks},
	booktitle = {IEEE Global Telecommunications Conference, 2003. GLOBECOM {\textquoteright}03},
	volume = {3},
	year = {2003},
	month = {2003/12/01/5},
	pages = {1511- 1515 vol.3 - 1511- 1515 vol.3},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {To date, most solutions proposed for secure routing in mobile ad-hoc networks (MANETs), assume that secure associations between pairs of nodes can be established on-line; e.g., by a trusted third party, by distributed trust establishment. However, establishing such security associations, with or without trusted third parties, requires reliance on routing layer security. In this paper, we eliminate this apparent cyclic dependency between security services and secure routing in MANETs and show how to bootstrap security for the routing layer. We use the notion of statistically unique and cryptographically verifiable (SUCV) identifiers to implement a secure binding between IP addresses and keys that is independent of any trusted security service. We illustrate our solution with the dynamic source routing (DSR) protocol and compare it with other solutions for secure routing.},
	keywords = {ad hoc networks, bootstrapping security association, Cryptographic protocols, dynamic source routing protocol, Fabrics, Intelligent networks, IP address, IP key, IP networks, Message authentication, mobile ad-hoc network, mobile radio, Protection, Public key, public key cryptography, routing layer security reliability, routing protocols, secure routing, Security, security service, statistically unique cryptographically verification, telecommunication security},
	isbn = {0-7803-7974-8},
	doi = {10.1109/GLOCOM.2003.1258490},
	author = {Bobba,R. B and Eschenauer,L. and Gligor,V. and Arbaugh, William A.}
}
