Client server computing in mobile environments part 2

Post on 08-Dec-2014

289 views 0 download

Tags:

description

Client server computing in mobile environments. Versatile, Message based, Modular Infrastructure intended to improve usability, flexibility, interoperability and scalability as compared to Centralized, Mainframe, time sharing computing. Intended to reduce Network Traffic. Communication is using RPC or SQL

Transcript of Client server computing in mobile environments part 2

Three-Party Authentication using Three-Party Authentication using Quantum Key Distribution ProtocolsQuantum Key Distribution Protocols

By,By,

xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx

Guided By : Mr. xxxxxxxxxxx.,

Abstract

This project presents Quantum Key Distribution Protocols (QKDPs) to safeguard security in large networks, by using DES algorithm for encryption and decryption of .txt file.

In this project, secure communication between the sender and the receiver is being made possible through a trusted center by using secret key authentication.

Abstract continued…

The Trusted Center distributes a quantum key to both the sender and the receiver after the verification of the secret key.

The sender encrypts the data and sends to the receiver side only after obtaining the quantum key from the Trusted Center.

Similarly the decryption process occurs. RSA algorithm is being used for quantum key distribution. Finally the input .txt file is retrieved on the receiver side.

Existing System

In classical cryptography, three-party key distribution

protocols utilize challenge response mechanisms or

timestamps to prevent replay attacks .

However, challenge response mechanisms require at

least two communication rounds between the TC and

participants.

Demerits of Existing System

The timestamp approach needs the assumption of clock

synchronization which is not practical in distributed

systems.

Furthermore, classical cryptography cannot detect the

existence of passive attacks such as eavesdropping.

Proposed System In quantum cryptography, quantum key distribution protocols

(QKDPs) employ quantum mechanisms to distribute session keys

and public discussions to check for eavesdroppers and verify the

correctness of a session key.

However, public discussions require additional communication

rounds between a sender and receiver and cost precious qubits. By

contrast, classical cryptography provides convenient techniques that

enable efficient key verification and user authentication.

The advantages of both the classical and quantum cryptography are

utilized in the proposed QKDP.

Working Principle In Proposed System, the sender and the receiver preshared their

secret key to the Trusted Center (TC). In Trusted Center session key is generated by using secret key

and random string then quantum key is generated through qubit generation.

To generate the quantum key using the qubit and the session key which depends on the qubit combination such as,

1. If the value is 0 and 0, then 1/0.707(p[0]+p[1])

2. If the value is 1 and 0, then 1/0.707(p[0]-p[1])

3. If the value is 0 and 1, then p[0]

4. If the value is 1 and 1, then p[1]

System Requirements

Hardware Requirements Processor - Intel Pentium III RAM capacity - 128 MB Hard Disk - 40 GB

Software Requirements Operating System - Windows XP Front End - Visual C# .Net Back End - SQL Server 2000

List of modulesList of modules

1. Sender Module.

2. Trusted Center Module and

3. Receiver Module.

Module Description

Sender Module

This module has three sub-modules. They are,

1. Registration

2. Login

3. Send data

Modules Continued…

Trusted Center Module

Secret Key Verification

Session Key Generation

Qubit Generation

Quantum Key Generation

Key Distribution

Modules Continued…

Receiver Module

This module has three sub-modules. They are,

1. Registration

2. Login

3. Receive data

Use case Diagram – Quantum key Generation

Algorithms Algorithms

For Encryption & Decryption, DES algorithm is used.

For key Generation RSA algorithm is used, the

algorithms are explained as,

DES algorithmDES algorithm

RSA algorithmRSA algorithmKey Generation

1. Select p ,q where both p and q both prime, p≠q

2. Calculate n=p*q

3. Calculate Ø(n)=(p-1)(q-1)

4. Select integer e where gcd (Ø(n),e)=1; 1<e<Ø(n)

5. Calculate d where d= e^-1 mod Ø(n)

6. Public key KU={e ,n}

7. Private key KR={d ,n}

Registration form - Sender

Secret key Generation - Sender

After Registration - Sender

Login form - Sender

Trusted Center

Registration form- Receiver

Secret Key Generation - Receiver

After Registration - Receiver

Login form - Receiver

Quantum Key Generation (After both sender and receiver logged in)

Path name of the .txt file and the Ip address of the local

system

Data to be Encrypted

After Encryption

Data to be decrypted

After Decryption

Original Data

Conclusion Compared with classical three-party key distribution

protocols, the proposed QKDPs easily resist replay and passive attacks.

Compared with other QKDPs, the proposed schemes efficiently achieve key verification and user authentication and preserve a long-term secret key between the TC and each user.

Additionally, the proposed QKDPs have fewer communication rounds than other protocols. Although the requirement of the quantum channel can be costly in practice, it may not be costly in the future.

Moreover, the proposed QKDPs have been shown secure under the random oracle model. By combining the advantages of classical cryptography with quantum cryptography, this work presents a new direction in designing QKDPs.

Future Enhancements

The whole project can be enhanced for secure communication between two systems in a local area network through the trusted center which can be a third system in the local area network.

The communication round between the sender and the receiver becomes one by applying this project as well as secret key authentication is being provided by the trusted center which in turn generates the quantum key.

References G. Li, “Efficient Network Authentication Protocols:

Lower Bounds and Optimal Implementations,” Distributed Computing, vol. 9, no. 3, pp. 131-145, 1995.

A. Kehne, J. Schonwalder, and H. Langendorfer, “A Nonce-Based Protocol for Multiple Authentications,” ACM Operating Systems Rev., vol. 26, no. 4, pp. 84-89, 1992.

M. Bellare and P. Rogaway, “Provably Secure Session Key Distribution: The Three Party Case,” Proc. 27th ACM Symp. Theory of Computing, pp. 57-66, 1995.

THANK YOU