Welcome to the InfoSci Platform
Secure Robust Hash Functions and Their Applications in Non-interactive Communications

Secure Robust Hash Functions and Their Applications in Non-interactive Communications

Qiming Li, Sujoy Roy
Copyright: © 2010 |Volume: 2 |Issue: 4 |Pages: 12
ISSN: 1941-6210|EISSN: 1941-6229|EISBN13: 9781613502495|DOI: 10.4018/jdcf.2010100104
Cite Article Cite Article

MLA

Li, Qiming, and Sujoy Roy. "Secure Robust Hash Functions and Their Applications in Non-interactive Communications." IJDCF vol.2, no.4 2010: pp.51-62. http://doi.org/10.4018/jdcf.2010100104

APA

Li, Q. & Roy, S. (2010). Secure Robust Hash Functions and Their Applications in Non-interactive Communications. International Journal of Digital Crime and Forensics (IJDCF), 2(4), 51-62. http://doi.org/10.4018/jdcf.2010100104

Chicago

Li, Qiming, and Sujoy Roy. "Secure Robust Hash Functions and Their Applications in Non-interactive Communications," International Journal of Digital Crime and Forensics (IJDCF) 2, no.4: 51-62. http://doi.org/10.4018/jdcf.2010100104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

A robust hash function allows different parties to extract a consistent key from a common fuzzy source, e.g., an image gone through noisy channels, which can then be used to establish a cryptographic session key among the parties without the need for interactions. These functions are useful in various communication scenarios, where the security notions are different. The authors study these different security notions in this paper and focus on forgery attacks, where the objective of the attack is to compute the extracted key (hash value) of a given message. This paper will examine information-theoretical security against forgery under chosen message attacks. The authors prove that it is not possible due to the entropy of the hash value of a given message can be reduced arbitrarily when sufficient message/hash pairs have been observed. In this regard, the authors give a computationally secure scheme, where it is computationally infeasible to compute the hash value even when its entropy may not be high.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.