Title
Fully Deniable Message Authentication Protocols Preserving Confidentiality
Abstract
Although the objective of secure communication can be achieved by using cryptographic tools, the undeniability that results from cryptographic properties may create a potential threat to the sender of the message. Unfortunately, most existing deniable protocols only provide 1-out-of-2 deniability. When both parties (the sender and the receiver) are allowed to deny generating the message, a dispute might occur between these two parties. The 1-out-of-2 deniable protocol can result in an unfair resolution of the dispute. Therefore, we propose a new model of deniability, called 1-out-of-∞ deniability, that can provide full deniability. The 1-out-of-∞ deniability protocol allows the originator of the message to deny that he or she generated the message, since there are an infinite number of possible message generators; at the same time, all transmitted messages can be protected and authenticated between the sender and the intended receiver. Our design can be implemented by using any public-key cryptography technique. We also analyze the correctness of the proposed protocols based on logical rules, and two practical examples are given to illustrate our design.
Year
DOI
Venue
2011
10.1093/comjnl/bxr081
Comput. J.
Keywords
Field
DocType
full deniability,deniable message authentication protocols,deniability protocol,proposed protocol,deniable protocol,cryptographic property,preserving confidentiality,intended receiver,existing deniable protocol,transmitted message,cryptographic tool,possible message generator
Deniable encryption,Authentication,Confidentiality,Message authentication code,Computer science,Cryptography,Computer security,Correctness,Communication source,Secure communication,Distributed computing
Journal
Volume
Issue
ISSN
54
10
0010-4620
Citations 
PageRank 
References 
4
0.40
12
Authors
4
Name
Order
Citations
PageRank
Lein Harn1689222.27
Chia-Yin Lee21299.58
Changlu Lin311714.00
Chin Chen Chang47849725.95