Our IMAP is based on the computational assumption that ICR hash functions exist. It performs better than message authentication protocols that are based on computational assumptions. That is, while achieving the same level of security, the amount of information sent over the authenticated channel in our IMAP is smaller than the most secure IMAP and Non-interactive Message Authentication Protocol (NIMAP) in the literature. In other words, if we send the same amount of information over the authenticated channel, we can allow much stronger adversaries compared to the existing protocols in the literature.
Moreover, our IMAP benefits from a simple structure and works under fewer security assumptions compared to other IMAPs in the literature. The efficient and easy-to-use structure of our IMAP makes it very practical in real world ad hoc network scenarios.
Category / Keywords: cryptographic protocols / two-channel cryptography, ad hoc networks, authentication, hash functions Date: received 11 Jan 2007, last revised 7 Sep 2007 Contact author: amashata at uwaterloo ca Available format(s): PDF | BibTeX Citation Note: This paper has gone under a lot of changes and revisions. The proposed IMAP is different from the one suggested in the first version of the paper, and subsequently the security proofs are different. Version: 20070907:155943 (All versions of this report) Short URL: ia.cr/2007/012 Discussion forum: Show discussion | Start new discussion