On message recognition protocols: recoverability and explicit confirmation
Author(s) -
Ian Goldberg,
Atefeh Mashatan,
Douglas R. Stinson
Publication year - 2010
Publication title -
international journal of applied cryptography
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.246
H-Index - 15
eISSN - 1753-0571
pISSN - 1753-0563
DOI - 10.1504/ijact.2010.038305
Subject(s) - computer science , stateless protocol , communication source , protocol (science) , computer network , computer security , cryptographic protocol , digital signature , theoretical computer science , cryptography , network packet , hash function , medicine , alternative medicine , pathology
We look at message recognition protocols (MRPs) and prove that there is a one-to-one correspondence between stateless non-interactive MRPs and digital signature schemes. Next, we examine the Jane Doe protocol and note its inability to recover in case of a certain adversarial disruption. We propose a variant of this protocol which is equipped with a resynchronisation technique that allows users to resynchronise whenever they wish. Moreover, we propose another protocol which self-recovers in case of an intrusion. This protocol incorporates the resynchronisation technique within itself. Further, we enumerate all possible attacks against this protocol and show that none of the attacks can occur. Finally, we prove the security of the new protocol and its ability to self-recover once the disruption has stopped. Finally, we propose an MRP which provides explicit confirmation to the sender on whether or not the message was accepted by the receiver.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom