@conference {15137,
	title = {A new framework for efficient password-based authenticated key exchange},
	booktitle = {Proceedings of the 17th ACM conference on Computer and communications security},
	series = {CCS {\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {516 - 525},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Protocols for password-based authenticated key exchange (PAKE) allow two 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 off ers 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 = {exchange, key, password-based},
	isbn = {978-1-4503-0245-6},
	doi = {10.1145/1866307.1866365},
	url = {http://doi.acm.org/10.1145/1866307.1866365},
	author = {Groce,Adam and Katz, Jonathan}
}
@conference {15104,
	title = {Overcoming the Hole in the Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage},
	booktitle = {Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on},
	year = {2010},
	month = {2010/10//},
	pages = {501 - 510},
	abstract = {In recent years, there has been a major effort to design cryptographic schemes that remain secure even when arbitrary information about the secret key is leaked (e.g., via side-channel attacks). We explore the possibility of achieving security under emphcontinual leakage from the emphentire secret key by designing schemes in which the secret key is updated over time. In this model, we construct public-key encryption schemes, digital signatures, and identity-based encryption schemes that remain secure even if an attacker can leak a constant fraction of the secret memory (including the secret key) in each time period between key updates. We also consider attackers who may probe the secret memory during the updates themselves. We stress that we allow unrestricted leakage, without the assumption that {\textquotedblleft}only computation leaks information{\textquotedblright}. Prior to this work, constructions of public-key encryption schemes secure under continual leakage were not known even under this assumption.},
	keywords = {continual, cryptography;, cryptography;public-key, encryption, key, key;digital, leakage;cryptographic, memory, schemes;digital, schemes;public-key, schemes;secret, signatures;identity-based, signatures;public},
	doi = {10.1109/FOCS.2010.55},
	author = {Brakerski,Z. and Kalai,Y.T. and Katz, Jonathan and Vaikuntanathan,V.}
}
@conference {15105,
	title = {Round Complexity of Authenticated Broadcast with a Dishonest Majority},
	booktitle = {Foundations of Computer Science, 2007. FOCS {\textquoteright}07. 48th Annual IEEE Symposium on},
	year = {2007},
	month = {2007/10//},
	pages = {658 - 668},
	abstract = {Broadcast among n parties in the presence of t ges n/3 malicious parties is possible only with some additional setup. The most common setup considered is the existence of a PKI and secure, digital signatures, where so-called authenticated broadcast is achievable for any t lt; n. It is known that t + 1 rounds are necessary and sufficient for deterministic protocols achieving authenticated broadcast. Recently, however, randomized protocols running in expected constant rounds have been shown for the case of t lt; n/2. It has remained open whether randomization can improve the round complexity when an honest majority is not present. We address this question and show upper/lower bounds on how much randomization can help: ldr For t les n/2 + k, we. show a randomized broadcast protocol that runs in expected O(k<sup>2</sup>) rounds. In particular, we obtain expected constant-round pivtocols for t = n/2 + O(1). ldr On the negative side, we show that even randomized protocols require Omega(2n/(n-t)) rounds. This in particular rules out expected constant-round protocols when the fraction of honest parties is sub-constant.},
	keywords = {broadcast, complexity;cryptographic, complexity;deterministic, cryptography;, key, majority;randomized, PKI;authenticated, protocols;broadcasting;computational, protocols;digital, round, signatures;dishonest, signatures;public},
	doi = {10.1109/FOCS.2007.44},
	author = {Garay,J. A and Katz, Jonathan and Koo,Chiu-Yuen and Ostrovsky,R.}
}
@article {18287,
	title = {Unicity Distance of Robust Image Hashing},
	journal = {Information Forensics and Security, IEEE Transactions on},
	volume = {2},
	year = {2007},
	month = {2007/09//},
	pages = {462 - 467},
	abstract = {An image hash is a randomized compact representation of image content and finds applications in image authentication, image and video watermarking, and image similarity comparison. Usually, an image-hashing scheme is required to be robust and secure, and the security issue is particularly important in applications, such as multimedia authentication, watermarking, and fingerprinting. In this paper, we investigate the security of image hashing from the perspective of unicity distance, a concept pioneered by Shannon in one of his seminal papers. Using two recently proposed image-hashing schemes as representatives, we show that the concept of unicity distance can be adapted to evaluate the security of image hashing. Our analysis shows that the secret hashing key, or its equivalent form, can be estimated with high accuracy when the key is reused several dozen times. The estimated unicity distance determines the maximum number of key reuses in the investigated hashing schemes. A countermeasure of randomized key initialization is discussed to avoid key reuse and strengthen the security of robust image hashing.},
	keywords = {authentication;image, authentication;randomized, coding;image, compact, comparison;multimedia, content;image, data;, distance;watermarking;image, fingerprinting;image, hashing;unicity, image, initialization;robust, key, of, representation;randomized, representation;security, similarity},
	isbn = {1556-6013},
	doi = {10.1109/TIFS.2007.902260},
	author = {Mao,Yinian and M. Wu}
}
@article {18431,
	title = {Software process improvement in small organizations: a case study},
	journal = {Software, IEEE},
	volume = {22},
	year = {2005},
	month = {2005/12//nov},
	pages = {68 - 75},
	abstract = {The Capability Maturity Model for software has become a major force in software development process improvement. We looked at the role of process improvement in the context of a small organization. Although the Capability Maturity Model integration is replacing the CMM, we focused on the older CMM. We had to look at more than which CMM key process areas apply to small businesses. Our overall goal was to institute good software development practices, we used the language of the CMM to gain the management{\textquoteright}s cooperation. Applying these practices is essential to managing growth, yet undertaking this effort without prior experience could impede a small company{\textquoteright}s innovative nature. This case study{\textquoteright}s purpose was to investigate the success factors of a software process improvement effort for a small software development organization.},
	keywords = {area;, aspects;, capability, CMM, development, improvement;, key, management;, Maturity, model;, organisational, organization;, process, small, software},
	isbn = {0740-7459},
	doi = {10.1109/MS.2005.162},
	author = {Dangle,K.C. and Larsen,P. and Shaw,M. and Zelkowitz, Marvin V}
}
@conference {18202,
	title = {Dynamic join-exit amortization and scheduling for time-efficient group key agreement},
	booktitle = {INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies},
	volume = {4},
	year = {2004},
	month = {2004/03//},
	pages = {2617 - 2627 vol.4 - 2617 - 2627 vol.4},
	abstract = {We propose a time-efficient contributory key agreement framework for secure communications in dynamic groups. The proposed scheme employs a special join-tree/exit-tree topology in the logical key tree and effectively exploits the efficiency of amortized operations. We derive the optimal parameters and design an activation algorithm for the join and exit trees. We also show that the asymptotic average time cost per user join and leave event is theta;(log (log n)), where n is the group size. Our experiment results on both simulated user activities and the real MBone data have shown that the proposed scheme outperforms the existing tree-based schemes.},
	keywords = {agreement;, asymptotic, average, communication;, complexity;, computational, cost;, cryptography;, dynamic, group, join-tree/exit-tree, key, logical, Multicast, network, secure, security;, special, Telecommunication, TIME, time-efficient, topology;, tree;},
	doi = {10.1109/INFCOM.2004.1354681},
	author = {Mao,Yinian and Sun,Yan and M. Wu and Liu,K. J.R}
}
@conference {18225,
	title = {Image hashing resilient to geometric and filtering operations},
	booktitle = {Multimedia Signal Processing, 2004 IEEE 6th Workshop on},
	year = {2004},
	month = {2004/10/01/sept},
	pages = {355 - 358},
	abstract = {Image hash functions provide compact representations of images, which is useful for search and authentication applications. In this work, we have identified a general three step framework and proposed a new image hashing scheme that achieves a better overall performance than the existing approaches under various kinds of image processing distortions. By exploiting the properties of discrete polar Fourier transform and incorporating cryptographic keys, the proposed image hash is resilient to geometric and filtering operations, and is secure against guessing and forgery attacks.},
	keywords = {compact, cryptographic, cryptography;, discrete, distortion;, Filtering, Fourier, function;, geometric, hash, image, key, key;, operation;, polar, PROCESSING, public, representation;, theory;, transform;, transforms;},
	doi = {10.1109/MMSP.2004.1436566},
	author = {Swaminathan,A. and Mao,Yinian and M. Wu}
}
@conference {15096,
	title = {Toward secure key distribution in truly ad-hoc networks},
	booktitle = {Applications and the Internet Workshops, 2003. Proceedings. 2003 Symposium on},
	year = {2003},
	month = {2003/01//},
	pages = {342 - 346},
	abstract = {Ad-hoc networks - and in particular wireless mobile ad-hoc networks $have unique characteristics and constraints that make traditional cryptographic mechanisms and assumptions inappropriate. In particular it may not be warranted to assume pre-existing shared secrets between members of the network or the presence of a common PKI. Thus, the issue of key distribution in ad-hoc networks represents an important problem. Unfortunately, this issue has been largely ignored; as an example, most protocols for secure ad-hoc routing assume that key distribution has already taken place. Traditional key distribution schemes either do not apply in an ad-hoc scenario or are not efficient enough for small, resource-constrained devices. We propose to combine efficient techniques from identity-based (ID-based) and threshold cryptography to provide a mechanism that enables flexible and efficient key distribution while respecting the constraints of ad-hoc networks. We also discuss the available mechanisms and their suitability for the proposed task.},
	keywords = {ad, ad-hoc, cryptography;, distribution;, hoc, identity-based, key, mobile, network, networks;, routing;, secure, security;, Telecommunication, threshold, wireless},
	doi = {10.1109/SAINTW.2003.1210183},
	author = {Khalili,A. and Katz, Jonathan and Arbaugh, William A.}
}
