Cheater Detection Scheme for Dynamic Secret Key Generation

Authors(3) :-Sunil Dalal, Sangeeta Bhan, Susobhan Das

Any secret sharing scheme is considered to be strong if the complexity of cryptanalysis is very high. In cryptography the brutal attack is the type of attack in which all the possible keys of the algorithm are tried for obtaining the secret. Various types of cryptanalytic methods for a given scheme are compared with complexity of the brute force attack. If the complexity of various cryptanalytic attacks is of the same order as that of brute force attack, then the system is said to be computationally strong. In our method of dynamic multi-secret sharing the security analysis mainly depends upon the application of hash function to calculate C matrix and modular arithmetic over primitive element. In this paper, two methods are proposed which remove the need of secret share distribution by the dealer using secure channel and to find out the cheater in the group.

Authors and Affiliations

Sunil Dalal
Department of Information Technology BGSB University, Rajouri, J&K, India
Sangeeta Bhan
Computer Science and Engineering, Delhi Technological University, Delhi, India
Susobhan Das
Department of Information Technology BGSB University, Rajouri, J&K, India

Secret Key, Cheater Detection, Cryptanalysis.

  1. Atul Kahate, Cryptography and network security, second edition, India: Tata McGraw-Hill.
  2. Shamir Adi, “How to share a secret”, Communication of ACM, vol. 22(11), pp. 612- 613, November 1979.
  3. Blakely G., “Safeguarding cryptographic keying”, In Proc. Of AFIPS, National computer conference, 1979.
  4. Lin Han-Yu and Yeh Yi-Shiung, “Dynamic Multi-Secret Sharing Scheme”, Int. J. Contemp. Math. Sciences, Vol. 3, no.1, pp. 37-42, 2008.
  5. William Stallings, Cryptography and Network Security, third edition, India: Pearson Education.
  6. Bogdnav Dan, “How to securely perform computation on secret share data” ,Master’s thesis, University of Tartu, 2007.
  7. Menezes, P. Oorschot, S. Vanstone, Handbook of applied cryptography, CRC Press.
  8. Hallberg, Networking a beginning guide, TMH.
  9. Diffie W., Hellman M., “New directions in cryptography”, IEEE Transactions, on Information Theory, IT-22 (6), pp. 644-654, 1976.
  10. He J., Dawson E., “Multistage secret sharing based on one-way function”, Electronics Letters, vol. 30 (19), pp. 1591-1592, 1994.

Publication Details

Published in : Volume 4 | Issue 1 | March-April 2018
Date of Publication : 2018-04-25
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 22-27
Manuscript Number : CSEIT411804
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

Sunil Dalal, Sangeeta Bhan, Susobhan Das, "Cheater Detection Scheme for Dynamic Secret Key Generation", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 4, Issue 1, pp.22-27, March-April-2018.
Journal URL :

Article Preview