@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 {18267,
	title = {Robust and secure image hashing},
	journal = {Information Forensics and Security, IEEE Transactions on},
	volume = {1},
	year = {2006},
	month = {2006/06//},
	pages = {215 - 230},
	abstract = {Image hash functions find extensive applications in content authentication, database search, and watermarking. This paper develops a novel algorithm for generating an image hash based on Fourier transform features and controlled randomization. We formulate the robustness of image hashing as a hypothesis testing problem and evaluate the performance under various image processing operations. We show that the proposed hash function is resilient to content-preserving modifications, such as moderate geometric and filtering distortions. We introduce a general framework to study and evaluate the security of image hashing systems. Under this new framework, we model the hash values as random variables and quantify its uncertainty in terms of differential entropy. Using this security framework, we analyze the security of the proposed schemes and several existing representative methods for image hashing. We then examine the security versus robustness tradeoff and show that the proposed hashing methods can provide excellent security and robustness.},
	keywords = {content-preserving, cryptography;, differential, distortions;, entropy;, Filtering, Fourier, functions;, hash, hashing;, image, modifications;, processing;, secure, theory;, transform;, transforms;},
	isbn = {1556-6013},
	doi = {10.1109/TIFS.2006.873601},
	author = {Swaminathan,A. and Mao,Yinian and M. Wu}
}
@conference {18280,
	title = {Security of feature extraction in image hashing},
	booktitle = {Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP {\textquoteright}05). IEEE International Conference on},
	volume = {2},
	year = {2005},
	month = {2005/03//},
	pages = {ii/1041 - ii/1044 Vol. 2 - ii/1041 - ii/1044 Vol. 2},
	abstract = {Security and robustness are two important requirements for image hash functions. We introduce "differential entropy" as a metric to quantify the amount of randomness in image hash functions and to study their security. We present a mathematical framework and derive expressions for the proposed security metric for various common image hashing schemes. Using the proposed security metric, we discuss the trade-offs between security and robustness in image hashing.},
	keywords = {cryptography;, differential, digital, entropy;, extraction;, feature, functions;, hash, hashing;, image, metric;, processing;, randomness;, robustness;, Security, signature;, signatures;},
	doi = {10.1109/ICASSP.2005.1415586},
	author = {Swaminathan,A. and Mao,Yinian and M. Wu}
}
@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 {18278,
	title = {Security evaluation for communication-friendly encryption of multimedia},
	booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on},
	volume = {1},
	year = {2004},
	month = {2004/10//},
	pages = {569 - 572 Vol. 1 - 569 - 572 Vol. 1},
	abstract = {This paper addresses the access control issues unique to multimedia, by using a joint signal processing and cryptographic approach to multimedia encryption. Based on three atomic encryption primitives, we present a systematic study on how to strategically integrate different atomic operations to build a video encryption system. We also propose a set of multimedia-specific security metrics to quantify the security against approximation attacks and to complement the existing notion of generic data security. The resulting system can provide superior performance to both generic encryption and its simple adaptation to video in terms of a joint consideration of security, bitrate overhead, and communication friendliness.},
	keywords = {access, approximation, atomic, attacks;, bitrate, coding;, communication-friendly, communication;, control;, cryptography;, data, encryption, encryption;, generic, joint, method;, metrics;, multimedia, multimedia-specific, overhead;, primitives;, processing/cryptographic, Security, security;, signal, system;, Telecommunication, video},
	doi = {10.1109/ICIP.2004.1418818},
	author = {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.}
}
@conference {18182,
	title = {Communication-friendly encryption of multimedia},
	booktitle = {Multimedia Signal Processing, 2002 IEEE Workshop on},
	year = {2002},
	month = {2002/12//},
	pages = {292 - 295},
	abstract = {This paper discusses encryption operations that selectively encrypt content-carrying segments of multimedia data stream. We propose and analyze three techniques that work in different domains, namely, a syntax-aware selective bitstream encryption tool with bit stuffing, a generalized index mapping encryption tool with controlled overhead and an intra-bitplane encryption tool compatible with fine granularity scalable coding. The designs of these proposed encryption operations take into consideration the inherent structure and syntax of multimedia sources and have improved friendliness to communications, compression and computation.},
	keywords = {bit, bitstream, coding;, Communication, communication;, compression, compression;, COMPUTATION, controlled, cryptography;, data, encryption, encryption;, fine, friendliness;, granularity, image, index, intrabitplane, MAPPING, multimedia, operation;, overhead;, scalable, selective, sources, stream;, stuffing;, syntax-aware, syntax;, tool;},
	doi = {10.1109/MMSP.2002.1203303},
	author = {M. Wu and Mao,Yinian}
}
@article {12307,
	title = {Scalable secure group communication over IP multicast},
	journal = {Selected Areas in Communications, IEEE Journal on},
	volume = {20},
	year = {2002},
	month = {2002/10//},
	pages = {1511 - 1527},
	abstract = {We introduce and analyze a scalable rekeying scheme for implementing secure group communications Internet protocol multicast. We show that our scheme incurs constant processing, message, and storage overhead for a rekey operation when a single member joins or leaves the group, and logarithmic overhead for bulk simultaneous changes to the group membership. These bounds hold even when group dynamics are not known a priori. Our rekeying algorithm requires a particular clustering of the members of the secure multicast group. We describe a protocol to achieve such clustering and show that it is feasible to efficiently cluster members over realistic Internet-like topologies. We evaluate the overhead of our own rekeying scheme and also of previously published schemes via simulation over an Internet topology map containing over 280 000 routers. Through analysis and detailed simulations, we show that this rekeying scheme performs better than previous schemes for a single change to group membership. Further, for bulk group changes, our algorithm outperforms all previously known schemes by several orders of magnitude in terms of actual bandwidth usage, processing costs, and storage requirements.},
	keywords = {access, algorithm;, authentication;, Bandwidth, communication;, CONTROL, costs;, cryptography;, dynamics;, group, group;, Internet, Internet-like, Internet;, IP, logarithmic, map;, membership;, message, Multicast, multicast;, network, overhead;, PROCESSING, protocol, protocols;, rekeying, requirements;, routers;, routing;, scalable, secure, security;, server;, simulation;, storage, Telecommunication, topologies;, Topology, topology;, transport, usage;},
	isbn = {0733-8716},
	doi = {10.1109/JSAC.2002.803986},
	author = {Banerjee,S. and Bhattacharjee, Bobby}
}
