Reviewers

82

Asiya N Khan

HOD CSE of computer science and Engineering

HOD in CSE, Database, Data structure, Big Data, Hadoop, Data Science, Artificial Intelligence, Machine Learning

Solapur ,Maharashtra,India

84

Mardanali Chand Shaikh

Professor in Mechanical Engineering

Non-conventional Energy(Wind Power), Thermal Engineering, Refrigeration and Air Conditioning, Heat and Mass Transfer.

SOLAPUR,Maharashtra,India

86

Nirmala Devi Danabala

Associate Professor

Chemical Speciation, Cloud Point Extraction

VISAKHAPATNAM,Andhra Pradesh,India

88

gedam kamalakar

researcher

He is the Editor of International Journal of Contemporary Issue (IJCI) Online Journal. He has written three books and his edited four books. He is the Editorial Board Member & reviewer for nearly two dozen UGC Care, Peer-Reviewed and Refereed Journals of National and International. He has presented papers in more than two dozen International and National Conferences and seminars; He has one a dozen International Journals Publications and nearly 29 Publication, at National level. He has seven Book Reviews to his credit.

hyderabad,Andhra Pradesh,India

90

SINGARAVELAN

PROFESSOR

My research domain is, How can we provide security, when message transmission is done in network. It can be achieved by group key management when we transmitting data from node to node. By using RSA algorithm, this can be achieved.

TRICHYRAPPALLI,Tamil Nadu,India

92

Md Hanif Tahsin

Medical Officer

Natural medicine, Natural plants, natural medicinal plants, Natural Environment Science research, climate change research in nature.

Munshiganj,Munshiganj zila,Bangladesh

94

SINGARAVELAN

PROFESSOR

Key-trees provide an efficient solution for private authentication in the symmetric key setting. However, the level of privacy provided by key-tree based systems decreases considerably if some members are compromised. This loss of privacy can be minimized by the careful design of the tree. Based on the results presented in this chapter, we can conclude that a good practical design principle is to maximize the branching factor at the first level of the tree such that the resulting tree still respects the constraint on the maximum authentication delay in the system. Once the branching factor at the first level is maximized, the tree can be further optimized by maximizing the branching factors at the successive levels, but the improvement achieved in this way is not really signify cant; what really counts is the branching factor at the first level. In the second part of this chapter, I proposed a novel group based private authentication scheme. I analyzed the proposed scheme and quantified the level of privacy that it provides. I compared the group based scheme to the key-tree based scheme originally proposed by Molnar and Wagner, and later optimized by me in the first half of this chapter. I showed that the group based scheme provides a higher level of privacy than the key-tree based scheme. In addition, the complexity of the group based scheme for the verifier can be set to be the same as in the key-tree based scheme, while the complexity for the prover is always smaller in the latter scheme.

TRICHYRAPPALLI,Tamil Nadu,India

96

Premkumar M

Assistant Professor

Mathematics, Pure and Applied Mathematics

Trichy,Tamil Nadu,India

98

Dr Noohi Khan

Assistant professor

My research work is basically based on Complex valued harmonic Univalent and multivalent Functions and their applications and various properties of harmonic univalent and multivalent functions.A continuous complex valued function f=u+iv defined in a simply connected complex domain D is said to be harmonic in D if both u and v are real harmonic in D. Let F and G be analytic in D so that F(0)=G(0)=0, I have almost twenty publications based on the properties of Harmonic univalent and multivalent functions.First we define the class conditions for these functions ,by using class conditions we find the coefficient inequality of that class and then obtain the necessary and sufficient conditions for that class.With the help of coefficient inequality we obtain properties like extreme points,distortion bounds,convex combinations,radius of starlikeness,radius of convexity ,neighbourhood property for the class which we define for harmonic functions.We also obtain the covolution condition and covering theorems for that class. We also used different operators in my research papers such as linear operator for harmonic univalent and multivalent functions ,Salagean operator for harmonic univalent and multivalent functions,Hardmard products etc for defining the class conditions .The theory of analytic functions , harmonic univalent function,harmonic multivalent functions has wide application in many physical problem: problems as in heat conduction, electrostatic potential and fluid flows, and theory of fractals constitute practical examples.

Lucknow,Uttar Pradesh,India

100

RAKESH TIWLE

Associate Professor

i am working in the novel drug delivery system to treat cancer disease

durg ,Madhya Pradesh,India