CSC 774 Advanced Network Security

Slides:



Advertisements
Similar presentations
CSC 774 Advanced Network Security
Advertisements

CS 483 – SD SECTION BY DR. DANIYAL ALGHAZZAWI (4) Information Security.
Data encryption with big prime numbers
Public Key Encryption Algorithm
1 An ID-based multisignature scheme without reblocking and predetermined signing order Chin-Chen Chang, Iuon-Chang Lin, and Kwok-Yan Lam Computer Standards.
How cryptography is used to secure web services Josh Benaloh Cryptographer Microsoft Research.
1 Hidden Exponent RSA and Efficient Key Distribution author: He Ge Cryptology ePrint Archive 2005/325 PDFPDF 報告人:陳昱升.
Fall 2010/Lecture 311 CS 426 (Fall 2010) Public Key Encryption and Digital Signatures.
Computer Science CSC 474Dr. Peng Ning1 CSC 474 Information Systems Security Topic 2.5 Public Key Algorithms.
CSE 597E Fall 2001 PennState University1 Digital Signature Schemes Presented By: Munaiza Matin.
Introduction to Public Key Cryptography
Public Key Model 8. Cryptography part 2.
 Introduction  Requirements for RSA  Ingredients for RSA  RSA Algorithm  RSA Example  Problems on RSA.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Network Security (A Very Brief Introduction)
10/1/2015 9:38:06 AM1AIIS. OUTLINE Introduction Goals In Cryptography Secrete Key Cryptography Public Key Cryptograpgy Digital Signatures 2 10/1/2015.
Cyrtographic Security Identity-based Encryption 1Dennis Kafura – CS5204 – Operating Systems.
Computer Science CSC 774 Advanced Network Security Topic 2.6 ID Based Cryptography #2 Slides by An Liu.
Cryptography and Network Security Chapter 9 - Public-Key Cryptography
Chapter 3 – Public Key Cryptography and RSA (A). Private-Key Cryptography traditional private/secret/single-key cryptography uses one key shared by both.
Fall, Privacy&Security - Virginia Tech – Computer Science Click to edit Master title style Cryptographic Security Identity-Based Encryption.
Encryption on the Internet Jeff Cohen. Keeping Information Secret What information do we want to be secret? –Credit card number –Social security number.
Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.
Lecture 11 Overview. Digital Signature Properties CS 450/650 Lecture 11: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.
Lecture 9 Overview. Digital Signature Properties CS 450/650 Lecture 9: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.
Data encryption with big prime numbers DANIEL FREEMAN, SLU.
Information and Computer Security CPIS 312 Lab 8 1 Asymmetric Key Algorithms RSA Algorithm TRIGUI Mohamed Salim.
Cryptography and Network Security Chapter 13
CS201 Tech-Talk Two: Cryptography Michael Hsu CSULA.
CS480 Cryptography and Information Security Huiping Guo Department of Computer Science California State University, Los Angeles 14. Digital signature.
What is in a name? Identity-based cryptography. How public-key crypto works When you use public key cryptography, you can publish a value (public key)
Revision. Cryptography depends on some properties of prime numbers. One of these is that it is rather easy to generate large prime numbers, but much harder.
Cryptography By: Nick Belhumeur. Overview What is Cryptography? What is Cryptography? 2 types of cryptosystems 2 types of cryptosystems Example of Encryption.
최신정보보호기술 경일대학교 사이버보안학과 김 현성.
Security Outline Encryption Algorithms Authentication Protocols
A Realistic Secure Anonymous E-voting Protocol Based on ElGamal Scheme
Asymmetric-Key Cryptography
Applied Cryptography Main goal
Advanced Computer Networks
Public-Key Cryptography RSA Rivest-Shamir-Adelmann Public-Key System
第四章 數位簽章.
第四章 數位簽章.
Public Key Encryption and Digital Signatures
Chapters 14,15 Security.
Public Key Encryption and the RSA Algorithm
Fundamental Concepts in Security and its Application Cloud Computing
NET 311 Information Security
Cryptography Lecture 26.
Advanced Cryptography Protocols
ElGamal Public-Key Systems over GF(p) & GF(2m)
Security through Encryption
ICS 353: Design and Analysis of Algorithms
Operating Systems Security
Strong Password Authentication Protocols
Best Digital Signature Service in Noida. Electronic Record 1.Very easy to make copies 2.Very fast distribution 3.Easy archiving and retrieval 4.Copies.
NET 311 Information Security
Lecture 6: Digital Signature
Chapters 14,15 Security.
DISSERTATION ON CRYPTOGRAPHY.
Chapter 13 Digital Signature
Chapter 3 - Public-Key Cryptography & Authentication
Cryptography Lecture 18.
Cryptography Lecture 22.
Oblivious Transfer.
A Note on Secure Key Issuing in ID-based Cryptography
Security in Distributed Systems
Cryptography Lecture 25.
Digital Signature Standard (DSS)
Key Exchange, Man-in-the-Middle Attack
Diffie-Hellman Algorithm
LAB 3: Digital Signature
Presentation transcript:

CSC 774 Advanced Network Security Topic 2.6 ID Based Cryptography Slides by An Liu

Basic Idea Use identity as the key for encryption and signature verification. No key directory needed. Trusted key generation center (KGC) Give each user a smart card when user first joins the network. Each user uses the secrete key in smart card for decryption and signature verification. KGC can be closed after all cards are issued.

Basic Idea (Cont’d)

Basic Idea (Cont’d)

Security The security of underlying cryptographic functions. The secrecy at KGC. Identity check before issuing cards to users. The loss, duplication and unauthorized use of cards.

Implementation of Signature Scheme KGC chooses three public parameters. The factorization of n is only known by KGC. n=p∙q, p and q are large primes e, which is relatively prime to φ(n) f, which is one way function The secrete key corresponding identity i is g ge = i (mod n) KGC can compute g easily. Why? ed ≡ 1 (mod φ(n)) id = (ge)d (mod n) = g

Signature Generation and Verification Choose random number r t = re (mod n) s = g ∙ r f(t,m) (mod n) Signature is (t, s) Signature verification se = i ∙ t f(t,m) (mod n) se = ge ∙ r e ∙ f(t,m) (mod n)

Misc Multiplicative relationship between the identities will introduce same relationship between secret key. Expand identity to pseudo-random string r cannot be reused or revealed