A New Approach of Signing Documents with Symmetric Cryptosystems and an Arbitrator Nol Premasathian Faculty of Science King Mongkut’s.

Slides:

Advertisements

Similar presentations

The Diffie-Hellman Algorithm

Advertisements

Chapter 10 Encryption: A Matter of Trust. Awad –Electronic Commerce 1/e © 2002 Prentice Hall 2 OBJECTIVES What is Encryption? Basic Cryptographic Algorithm.

1 Key Exchange Solutions Diffie-Hellman Protocol Needham Schroeder Protocol X.509 Certification.

E W H A W U New Nominative Proxy Signature Scheme for Mobile Communication April Seo, Seung-Hyun Dept. of Computer Science and.

DIGITAL SIGNATURES and AUTHENTICATION PROTOCOLS - Chapter 13

DIGITAL SIGNATURES and AUTHENTICATION PROTOCOLS - Chapter 13 DIGITAL SIGNATURES and AUTHENTICATION PROTOCOLS - Chapter 13 Digital Signatures Authentication.

Public Key Infrastructure A Quick Look Inside PKI Technology Investigation Center 3/27/2002.

Requirements for a Secure Voting System  Only authorized voters can vote  No one can vote more than once  No one can determine for whom anyone else.

Topic 7: Using cryptography in mobile computing. Cryptography basics: symmetric, public-key, hash function and digital signature Cryptography, describing.

1 Digital Signatures & Authentication Protocols. 2 Digital Signatures have looked at message authentication –but does not address issues of lack of trust.

Pretty Good Privacy (PGP). How PGP works PGP uses both public-key cryptography and symmetric key cryptography, and includes a system which binds the public.

Apr 9, 2002Mårten Trolin1 Previous lecture TLS details –Phases Handshake Securing messages –What the messages contain –Authentication The second assignment.

Mar 4, 2003Mårten Trolin1 This lecture Diffie-Hellman key agreement Authentication Certificates Certificate Authorities.

Symmetric Key Distribution Protocol with Hybrid Crypto Systems Tony Nguyen.

Chapter Extension 23 SSL/TLS and //https © 2008 Pearson Prentice Hall, Experiencing MIS, David Kroenke.

CSE 597E Fall 2001 PennState University1 Digital Signature Schemes Presented By: Munaiza Matin.

E- Business Digital Signature Varna Free University Prof. Teodora Bakardjieva.

Overview of Digital Signatures Introduction To Networks and Communications (CS 555) Presented by Bharath Kongara.

Encryption Methods By: Michael A. Scott

Digital Signature Xiaoyan Guo/ Xiaohang Luo/

Security using Encryption Security Features Message Origin Authentication - verifying that the sender is who he or she says they are Content Integrity.

CSCI 6962: Server-side Design and Programming

Csci5233 Computer Security1 Bishop: Chapter 10 Key Management: Digital Signature.

31.1 Chapter 31 Network Security Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Page 1 Secure Communication Paul Krzyzanowski Distributed Systems Except as otherwise noted, the content of this presentation.

Bob can sign a message using a digital signature generation algorithm

Lecture 12 Electronic Business (MGT-485). Recap – Lecture 11 E-Commerce Security Environment Security Threats in E-commerce Technology Solutions.

AQA Computing A2 © Nelson Thornes 2009 Section Unit 3 Section 6.4: Internet Security Digital Signatures and Certificates.

Public-key Cryptography Strengths and Weaknesses Matt Blumenthal.

Copyright Protection Allowing for Fair Use Team 9 David Dobbs William Greenwell Jennifer Kahng Virginia Volk.

Symmetric versus Asymmetric Cryptography. Why is it worth presenting cryptography? Top concern in security Fundamental knowledge in computer security.

Chapter 9: Using and Managing Keys Security+ Guide to Network Security Fundamentals Second Edition.

Protecting Internet Communications: Encryption  Encryption: Process of transforming plain text or data into cipher text that cannot be read by anyone.

Cryptography, Authentication and Digital Signatures

CSCD 218 : DATA COMMUNICATIONS AND NETWORKING 1

4 th lecture.  Message to be encrypted: HELLO  Key: XMCKL H E L L O message 7 (H) 4 (E) 11 (L) 11 (L) 14 (O) message + 23 (X) 12 (M) 2 (C) 10 (K) 11.

Digital Envelopes, Secure Socket Layer and Digital Certificates By: Anthony and James.

Key Management. Session and Interchange Keys  Key management – distribution of cryptographic keys, mechanisms used to bind an identity to a key, and.

Software Security Seminar - 1 Chapter 5. Advanced Protocols 조미성 Applied Cryptography.

Chapter 16 Security Introduction to CS 1 st Semester, 2012 Sanghyun Park.

NDSU Lunchbytes "Are They Really Who They Say They Are?" Digital or Electronic Signature Information Rick Johnson, Theresa Semmens, Lorna Olsen April 24,

Slide 1 © 2004 Reactivity The Gap Between Reliability and Security Eric Gravengaard Reactivity.

11-Basic Cryptography Dr. John P. Abraham Professor UTPA.

Advanced Database Course (ESED5204) Eng. Hanan Alyazji University of Palestine Software Engineering Department.

What is Digital Signature Building confidentiality and trust into networked transactions. Kishankant Yadav

COEN 351 Non-Repudiation. A non-repudiation service provides assurance of the origin or delivery of data in order to protect the sender against false.

Privacy versus Authentication Confidentiality (Privacy) –Interceptors cannot read messages Authentication: proving the sender’s identity –The Problem of.

31.1 Chapter 31 Network Security Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Digital Signatures, Message Digest and Authentication Week-9.

1 Needham-Schroeder A --> S: A,B, N A S --> A: {N A,B,K AB,{K AB,A} KBS } KAS A --> B:{K AB,A} KBS B --> A:{N B } KAB A --> B:{N B -1} KAB.

Public Key Encryption 3 Digital Signatures or The Box within a Box.

Encryption. What is encryption? Encryption is conversion of original data to another data that can be converted back to original data by authorized persons.

DIGITAL SIGNATURE. A digital signature is an authentication mechanism that enables the creator of a message to attach a code that acts as a signature.

Electronic Commerce School of Library and Information Science PGP and cryptography I. What is encryption? Cryptographic systems II. What is PGP? How does.

DIGITAL SIGNATURE(DS) IN VIDEO. Contents  What is Digital Signature(DS)?  General Signature Vs. Digital Signatures  How DS is Different from Encryption?

Discrete Mathematical Structures: Theory and Applications 1 Cryptography (advanced extra curricular topic)  Cryptography (from the Greek words Kryptos,

Mar 28, 2003Mårten Trolin1 This lecture Certificates and key management Non-interactive protocols –PGP SSL/TLS –Introduction –Phases –Commands.

Copyright 2004 MayneStay Consulting Group Ltd. - All Rights Reserved Jan-041 Security using Encryption Security Features Message Origin Authentication.

April 20023CSG11 Electronic Commerce Authentication John Wordsworth Department of Computer Science The University of Reading Room.

Cryptographic Security Aveek Chakraborty CS5204 – Operating Systems1.

Security By Meenal Mandalia. What is ? stands for Electronic Mail. much the same as a letter, only that it is exchanged in a different.

M2 Encryption techniques Gladys Nzita-Mak. What is encryption? Encryption is the method of having information such as text being converted into a format.

Cryptography and Network Security Chapter 13

Unit 3 Section 6.4: Internet Security

Computer Communication & Networks

Security Design.

K E Y Plain text Cipher text Encryption Decryption

Electronic Payment Security Technologies

Secure Diffie-Hellman Algorithm

Presentation transcript:

A New Approach of Signing Documents with Symmetric Cryptosystems and an Arbitrator Nol Premasathian Faculty of Science King Mongkut’s University of Technology Thonburi Bangkok, Thailand

Signing Documents Public Key Public Key Private Key Private Key

Signing Documents (Public Key) No trusted third party needed No trusted third party needed Problems with speed Problems with speed

Signing Documents (Private Key) A trusted third party needed A trusted third party needed Disputes dissolved by the trusted third party Disputes dissolved by the trusted third party

Existing Method The sender shares a private key with the arbitrator (sender’s key). The sender shares a private key with the arbitrator (sender’s key). The arbitrator shares a private key with the receiver (receiver’s key). The arbitrator shares a private key with the receiver (receiver’s key).

Existing Method (continue) The sender encrypts the message with the sender’s key and sends it to the arbitrator. The sender encrypts the message with the sender’s key and sends it to the arbitrator. The arbitrator decrypts the message, encrypts it with the receiver’s key and sends it to the receiver. The arbitrator decrypts the message, encrypts it with the receiver’s key and sends it to the receiver.

Existing Method (continue) The receiver decrypts the message and sends an acknowledgment encrypted with the receiver’s key to the arbitrator. The receiver decrypts the message and sends an acknowledgment encrypted with the receiver’s key to the arbitrator. The arbitrator decrypts the acknowledgment, encrypts it with the sender’s key and sends it to the sender. The arbitrator decrypts the acknowledgment, encrypts it with the sender’s key and sends it to the sender. The arbitrator keeps a record for the message and its acknowledgment. The arbitrator keeps a record for the message and its acknowledgment.

Existing Method (limitation) The arbitrator must keep a record of every sent message. The arbitrator must keep a record of every sent message. The arbitrator perceives the content of the message. The arbitrator perceives the content of the message.

Proposed Method There are three secret keys in the protocol: There are three secret keys in the protocol: Private key between the sender and the receiver (K m ) Private key between the sender and the receiver (K m ) Private key between the sender and the arbitrator (K s ) Private key between the sender and the arbitrator (K s ) Private key between the receiver and the arbitrator (K r ) Private key between the receiver and the arbitrator (K r )

Three transmissions From the sender to the arbitrator From the sender to the arbitrator From the arbitrator to the receiver From the arbitrator to the receiver From the receiver to the sender From the receiver to the sender

The protocol The sender sends K s (H(M)) and K m (M) to the arbitrator. The sender sends K s (H(M)) and K m (M) to the arbitrator. From K s (H(M)), the arbitrator can produce K r (K r (H(M))) and K s (H(K r (K r (H(M))))+H(M)). From K s (H(M)), the arbitrator can produce K r (K r (H(M))) and K s (H(K r (K r (H(M))))+H(M)). The arbitrator sends K m (M), K s (H(M)), K r (K r (H(M))), and K s (H(K r (K r (H(M))))+H(M)) to the receiver. The arbitrator sends K m (M), K s (H(M)), K r (K r (H(M))), and K s (H(K r (K r (H(M))))+H(M)) to the receiver.

The protocol (continue) The receiver verifies H(M) and sends K r (K r (H(M))) and K s (H(K r (K r (H(M))))+H(M)) to the sender to acknowledge the message The receiver verifies H(M) and sends K r (K r (H(M))) and K s (H(K r (K r (H(M))))+H(M)) to the sender to acknowledge the message The sender verify H(M) in K s (H(K r (K r (H(M))))+H(M)) with the original one and verify the validity of the acknowledgment. The sender verify H(M) in K s (H(K r (K r (H(M))))+H(M)) with the original one and verify the validity of the acknowledgment.

Signature and Acknowledgment K s (H(M)) is the signature of the message. K s (H(M)) is the signature of the message. K r (K r (H(M))) is the acknowledgment of the message K r (K r (H(M))) is the acknowledgment of the message

Conclusions The proposed method reduces the number of transmissions from four to three. The proposed method reduces the number of transmissions from four to three. The arbitrator does not perceive the content of the message. The arbitrator does not perceive the content of the message. The arbitrator needs not keep a record. The arbitrator needs not keep a record.