Networking and Communication Engineering

Appala Naidu Tentu ¹, V. Kamakshi Prasad ², V. Ch. Venkaiah ³

Affiliations
1 Jawaharlal Nehru Technological University, Hyderabad, IN
2 Department of Computer Science Engineering, JNTU, Hyderabad, IN
3 School of Computer and Information Science (SCIS), University of Hyderabad, IN

Abstract

We have proposed secret sharing scheme that uses the Mignotte's sequence proposed in our previous paper in [15]. Another secret sharing scheme that uses the Asmuth-Bloom’s sequence are proposed in this paper.  The proposed secret sharing scheme is based on the Chinese Remainder Theorem (CRT). Novelty of the proposed scheme is that the shares of the participants are reusable that means even for the every new secret the shares are same. Also only one share needs to be kept by each participant even for the multi-secret sharing scheme. Further, the scheme is verifiable means that verifying the honesty of the participants in the reconstruction phase. Correctness and complexity is discussed at the end.

Keywords

Multi-Stage, CRT, Mignotte's Sequence, Asmuth-Bloom Sequence, Secret Sharing Scheme.

Full Text

     

P. V. Siva Kumar ¹, Rajasekhara Rao Kurra ², Appala Naidu Tentu ³

Affiliations
1 Department of Computer Science, VNRVJIET, Hyderabad, IN
2 Sri Prakash College of Engineering, Tuni, IN
3 CR Rao AIMSCS, University of Hyderabad Campus, Hyderabad, IN

Abstract

Security is the main issue for Mobile Ad-hoc Networks MANETs). Due to unreliable wireless media, host mobility providing secure communications is a challenge. One of the important issues when applying cryptography to MANETs is how to allocate the role of the trusted authority between the nodes. Threshold cryptography provides the way to convey a shared key to a node without the aid of key infrastructure and is suitable for a secret key sharing in a MANETs. Generally, in order to have a secure communication between two (or more) parties, a secure association must be established by sharing a secret. In this paper, we propose a verifiable multi-secret sharing protocol based on an identity based signature scheme, which uses identities of the node’s available in the network. This scheme uses advantages of an identity based signature scheme and hash function for the verifiability, which we do not require much computation. It checks either dealer or participant’s honest, means dealer may distribute a fake share to a certain participant or a corrupted participant may provide a fake share to other participants in reconstruction. In previous proposed schemes [6],[13],[19], they have used one-way function, RSA, Discrete logarithm functions to keep share information in public. Their idea was choosing above mentioned functions is mostly for the purpose of verification of shares. In our scheme, we did not use any exponentiation functions, but we have used two variable one-way function for the purpose of share calculation not for the verification. Our scheme resists dealer and participants cheating behavior efficiently.

Keywords

Secret Sharing, Multi Secret Sharing, Verifiable, Threshold Scheme, Hash Function, MANETs.

Full Text