For Project Enquiry +91 9791 044 044

AUTHENTICATED KEY EXCHANGE PROTOCOLS FOR PARALLEL

NETWORK FILE SYSTEMS

ABSTRACT

In this paper, we propose a variety of authenticatedkey exchange protocols that are designed to address the issues. We show that our protocols are capable of reducing up toapproximately 54% of the workload of the metadata server andconcurrently supporting forward secrecy and escrow-freeness.All this requires only a small fraction of increased computationoverhead at the client.We proposed three authenticated key exchange protocols forparallel network file system (pNFS). Our protocols offer threeappealing advantages over the existing Kerberos-based pNFSprotocol. First, the metadata server executing our protocolshas much lower workload than that of the Kerberos-basedapproach. Second, two our protocols provide forward secrecy:one is partially forward secure (with respect to multiplesessions within a time period), while the other is fully forwardsecure (with respect to a session). Third, we have designed aprotocol which not only provides forward secrecy, but is alsoescrow-free.

EXISTING SYSTEM	PROPOSED SYSTEM
EXISTING CONCEPT:- Key establishment for secure many-to-many communications. The proliferation of large-scale distributed file systems supporting parallel accessto multiple storage devices. Parallel Network File System (pNFS) makes use of Kerberos to establish parallel session keys between clients and storage devices.	PROPOSED CONCEPT:- Variety of authenticatedkey exchange protocols that are designed to address the existing issues. Protocols are capable of reducing up toapproximately 54% of the workload of the metadata server andconcurrently supporting forward secrecy and escrow-freeness. Metadata server executing our protocols has much lower workload than that of the Kerberos-based approach.
EXISTING ALGORITHM:- Fault-tolerant striping algorithm	PROPOSED ALGORITHM:- Diffie-Hellman key agreement.
ALGORITHM DEFINITION:- File data is distributed across multiple storage devices or nodes to allow concurrent accessby multiple tasks of a parallel application.	ALGORITHM DEFINITION:- Diffie-Hellman key agreement technique to both provide forward secrecy and prevent key escrow. In this protocol, each Si is required to pre-distribute some key material to M at Phase I of the protocol.
DRAWBACKS:- A metadata server facilitating key exchange between the clients and the storage devices has heavy workload that restricts the scalability of the protocol. The protocol does not provide forward secrecy.	ADVANTAGES:- The metadata server executing our protocols has much lower workload than that of the Kerberos-based approach. Two our protocols provide forward secrecy: one is partially forward secure (with respect to multiple sessions within a time period), while the other is fully forward secure (with respect to a session). Protocol which not only provides forward secrecy, but is also escrow-free.