Cryptanalysis of Secure Message Transmission Protocols with Feedback

In the context of secure point-to-point message transmission in networks with minimal connectivity, previous studies showed that feedbacks from the receiver to the sender can be used to reduce the requirements of network connectivity. We observe that the way how feedbacks were used in previous work does not guarantee perfect privacy to the transmitted message, when the adversary performs a Guessing Attack. In this paper, we shall describe our new Guessing Attack to some existing protocols (in fact, we are the first to point out a flaw in the protocols of Desmedt-Wang's Eurocrypt'02 paper and of Patra-Shankar-Choudhary-Srinathan-Rangan's CANS'07 paper), and propose a scheme defending against a general adversary structure. In addition, we also show how to achieve almost perfectly secure message transmission with feedbacks when perfect reliability or perfect privacy is not strictly required.

[1]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[2]  K. Srinathan,et al.  Unconditionally reliable message transmission in directed networks , 2008, SODA '08.

[3]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[4]  Tal Rabin,et al.  Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.

[5]  Kaoru Kurosawa,et al.  Truly Efficient $2$-Round Perfectly Secure Message Transmission Scheme , 2009, IEEE Transactions on Information Theory.

[6]  C. Pandu Rangan,et al.  Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited , 2008, SCN.

[7]  G. R. Blakley,et al.  Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[8]  K. Srinathan,et al.  Optimal Perfectly Secure Message Transmission , 2004, CRYPTO.

[9]  R. J. McEliece,et al.  On sharing secrets and Reed-Solomon codes , 1981, CACM.

[10]  K. Srinathan,et al.  On perfectly secure communication over arbitrary networks , 2002, PODC '02.

[11]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[12]  Yongge Wang,et al.  Perfectly Secure Message Transmission Revisited , 2002, IEEE Transactions on Information Theory.

[13]  Tal Rabin,et al.  Robust sharing of secrets when the dealer is honest or cheating , 1994, JACM.

[14]  C. Pandu Rangan,et al.  Brief announcement: perfectly secure message transmission in directed networks re-visited , 2009, PODC '09.

[15]  Ronald Cramer,et al.  Asymptotically Optimal Two-Round Perfectly Secure Message Transmission , 2006, CRYPTO.

[16]  Matthew K. Franklin,et al.  Secure Communication in Minimal Connectivity Models , 1998, Journal of Cryptology.

[17]  Yongge Wang,et al.  A Complete Characterization of Tolerable Adversary Structures for Secure Point-to-Point Transmissions Without Feedback , 2005, ISAAC.

[18]  Vassos Hadzilacos,et al.  Issues of fault tolerance in concurrent computations (databases, reliability, transactions, agreement protocols, distributed computing) , 1985 .

[19]  Ueli Maurer,et al.  Player Simulation and General Adversary Structures in Perfect Multiparty Computation , 2000, Journal of Cryptology.

[20]  Moti Yung,et al.  Perfectly secure message transmission , 1993, JACM.

[21]  K. Srinathan,et al.  Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary , 2007, CANS.

[22]  K. Srinathan,et al.  Possibility and complexity of probabilistic reliable communication in directed networks , 2006, PODC '06.

[23]  F. MacWilliams,et al.  Codes which detect deception , 1974 .

[24]  David Chaum,et al.  Multiparty unconditionally secure protocols , 1988, STOC '88.

[25]  Danny Dolev,et al.  The Byzantine Generals Strike Again , 1981, J. Algorithms.

[26]  Mitsuru Ito,et al.  Secret sharing scheme realizing general access structure , 1989 .