Point-to-Point Privacy Protect the privacy of a point-to-point communication between Alice and Bob assuming that an eavesdropper (Eve) has access to the.

Slides:



Advertisements
Similar presentations
By Md Emran Mazumder Ottawa University Student no:
Advertisements

Transmission Security via Fast Time-Frequency Hopping PI: Eli Yablanovich Co-PIs: Rick Wesel Ingrid Verbauwhede Ming Wu Bahram Jalali UCLA Electrical.
CIS 725 Key Exchange Protocols. Alice ( PB Bob (M, PR Alice (hash(M))) PB Alice Confidentiality, Integrity and Authenication PR Bob M, hash(M) M, PR Alice.
Netprog: Cryptgraphy1 Cryptography Reference: Network Security PRIVATE Communication in a PUBLIC World. by Kaufman, Perlman & Speciner.
1 Introduction CSE 5351: Introduction to cryptography Reading assignment: Chapter 1 of Katz & Lindell.
Key Escrow System “like leaving your key with a neighbour in case of an emergency” SSIN – MIEIC Micael Fernando Fonseca Oliveira.
CMSC 414 Computer and Network Security Lecture 3 Jonathan Katz.
BY MUKTADIUR RAHMAN MAY 06, 2010 INTERODUCTION TO CRYPTOGRAPHY.
Cryptographic Technologies
Chap 3: Key exchange protocols In most systems, we distinguish the short term keys from the long term ones: –A short term key (session key) is used to.
Classic Cryptography: Caesar Wenyuan Xu Department of Computer Science and Engineering University of South Carolina 2008.
Network Security – Part 1 Spring 2005 V.T. Raja, Ph.D., Oregon State University.
CMSC 414 Computer and Network Security Lecture 18 Jonathan Katz.
1 CPSC156: The Internet Co-Evolution of Technology and Society Lectures 19,20, and 21: April 5, 10, and 12, 2007 Cryptographic Primitives.
CMSC 414 Computer and Network Security Lecture 6 Jonathan Katz.
Xiaohua (Edward) Li1 and E. Paul Ratazzi2
Security Module – Part 1 Spring 2006 V.T. Raja, Ph.D., Oregon State University.
Chapter 13: Electronic Commerce and Information Security Invitation to Computer Science, C++ Version, Fourth Edition SP09: Contains security section (13.4)
 8 groups of 2  5 rounds  Basic Definitions  Substitution Cryptosystems  Math  Tricky Questions  Comparing Cryptosystems  10 questions per round.
Secure Electronic Transactions (SET). SET SET is an encryption and security specification designed to protect credit card transactions on the Internet.
Lecture 3: Cryptographic Tools modified from slides of Lawrie Brown.
Techniques for Transmission Security via Fast Hopping in the Time-Frequency Grid PI’s: Eli Yablanovich Rick Wesel Ingrid Verbauwhede Ming Wu Bahram Jalali.
Voice over Internet Services and Privacy. Agenda Problem Description Scope Recommendations.
IP Ports and Protocols used by H.323 Devices Liane Tarouco.
Lecture 19 Page 1 CS 111 Online Symmetric Cryptosystems C = E(K,P) P = D(K,C) E() and D() are not necessarily the same operations.
Introduction (Based on Lecture slides by J. H. Wang)
Network Security – Part 2 (Continued) Lecture Notes for May 8, 2006 V.T. Raja, Ph.D., Oregon State University.
13-1 Last time Security in Networks Network Security Controls Firewalls Honeypots Intrusion Detection Systems.
Symmetric versus Asymmetric Cryptography. Why is it worth presenting cryptography? Top concern in security Fundamental knowledge in computer security.
CSCD 218 : DATA COMMUNICATIONS AND NETWORKING 1
Tyepmg Pic Gvctxskvetlc April 25, The Caesar Cipher (Suetonius) “If Caesar had anything confidential to say, he wrote it in cipher, that is,
Chapter 31 Cryptography And Network Security Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Network Security Lecture 10 Presented by: Dr. Munam Ali Shah.
Network Security Introduction Light stuff – examples with Alice, Bob and Trudy Serious stuff - Security attacks, mechanisms and services.
Wireless LAN Security. Security Basics Three basic tools – Hash function. SHA-1, SHA-2, MD5… – Block Cipher. AES, RC4,… – Public key / Private key. RSA.
1 Cryptography NOTES. 2 Secret Key Cryptography Single key used to encrypt and decrypt. Key must be known by both parties. Assuming we live in a hostile.
V0.0CPSC415 Biometrics and Cryptography1 Placement of Encryption Function Lecture 3.
Cryptography and Network Security (CS435) Part One (Introduction)
. 1. Computer Security Concepts 2. The OSI Security Architecture 3. Security Attacks 4. Security Services 5. Security Mechanisms 6. A Model for Network.
Security Requirements of NVO3 draft-hartman-nvo3-security-requirements-01 S. Hartman M. Wasserman D. Zhang 1.
CRYPTOGRAPHY & NETWORK SECURITY Introduction and Basic Concepts Eng. Wafaa Kanakri Computer Engineering Umm Al-Qura University.
Lecture 2: Introduction to Cryptography
Security Many secure IT systems are like a house with a locked front door but with a side window open -somebody.
Chapter 32 Internet Security Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Internet Safety Presentation by Diahn Hess. Overview Internet Safety Private and personal information Meeting people online Safe interactions Cyberbullying.
National Institute of Science & Technology WIRELESS LAN SECURITY Swagat Sourav [1] Wireless LAN Security Presented By SWAGAT SOURAV Roll # EE
Presentation Road Map 1 Authenticated Encryption 2 Message Authentication Code (MAC) 3 Authencryption and its Application Objective Modes of Operation.
MM Clements Cryptography. Last Week Firewalls A firewall cannot protect against poor server, client or network configuration A firewall cannot.
Chapter 7 – Confidentiality Using Symmetric Encryption.
Transmission Security via Fast Time-Frequency Hopping PI: Eli Yablanovich Co-PIs: Rick Wesel Ingrid Verbauwhede Ming Wu Bahram Jalali UCLA Electrical.
From Coulouris, Dollimore, Kindberg and Blair Distributed Systems: Concepts and Design Edition 5, © Addison-Wesley 2012 Slides for Chapter 11: Security.
Security Review Q&A Session May 1. Outline  Class 1 Security Overview  Class 2 Security Introduction  Class 3 Advanced Security Constructions  Class.
CSCI 391: Practical Cryptology Introduction. Definitions Digital encryption techniques are used to protect data in two ways: to maintain privacy and to.
INFORMATION SECURITY MANAGEMENT P ROTECTION M ECHANISMS - C RYPTOGRAPHY.
Security. Cryptography (1) Intruders and eavesdroppers in communication.
Presented By, Mohammad Anees SSE, Mukka. Contents Cryptography Photon Polarization Quantum Key Distribution BB84 Protocol Security of Quantum Cryptography.
Lesson Introduction ●Authentication protocols ●Key exchange protocols ●Kerberos Security Protocols.
INCS 741: Cryptography Overview and Basic Concepts.
Intro to Cryptography ICS 6D Sandy Irani. Cryptography Intro Alice wants to send a message to Bob so that even if Eve can see the transmitted information,
Database Management Systems, 3ed, R. Ramakrishnan and J. Gehrke1 Database architecture and security Workshop 4.
- Richard Bhuleskar “At the end of the day, the goals are simple: safety and security” – Jodi Rell.
CMSC 414 Computer and Network Security Lecture 2 Jonathan Katz.
Wireless Protocols WEP, WPA & WPA2.
Outline Designing secure protocols Key exchange protocols
Transmission Security via Fast Time-Frequency Hopping
UCLA Electrical Engineering Department
UCLA Electrical Engineering Department
CS 465 Terminology Slides by Kent Seamons Last Updated: Sep 7, 2017.
Secure Electronic Transactions (SET)
Chapter -7 CRYPTOGRAPHIC HASH FUNCTIONS
Presentation transcript:

Point-to-Point Privacy Protect the privacy of a point-to-point communication between Alice and Bob assuming that an eavesdropper (Eve) has access to the encrypted communication and possibly sample original message (plaintext). This type of privacy is typically achieved by applying an encryption standard such as the Advanced Encryption Standard (AES) to the specific communication. Eve Alice Bob

Network Privacy Protect the privacy a network from an eavesdropper (Eve) who can see the signals transmitted on the network. Prevent Eve from –Figuring out who is talking to whom. –Isolating a particular communication to begin a cryptographic attack on a particular conversation –Performing traffic analysis (who is talking to whom on a regular basis, etc) Eve

Security Benefit of UCLA OCDMA UCLA OCDMA can provide point-to-point privacy as an added feature, but this can also be accomplished by well-known traditional techniques. UCLA OCDMA provides network privacy by preventing an eavesdropper from knowing the source of a message from its wavelength or timeslot. Network privacy enhances point-to-point privacy by providing a cryptographic obstacle to the isolation of a conversation that must be overcome before the eavesdropper can mount a cryptographic attack on the point-to-point communication.