Cryptography for Backup Navigation

Slides:

Advertisements

Similar presentations

Chapter 3 Public Key Cryptography and Message authentication.

Advertisements

A Crash Course in Modern Crypto Tools Dan Boneh Stanford University.

Dan Boneh Message integrity Message Auth. Codes Online Cryptography Course Dan Boneh.

Securing Critical Unattended Systems with Identity Based Cryptography A Case Study Johannes Blömer, Peter Günther University of Paderborn Volker Krummel.

An Introduction to Pairing Based Cryptography Dustin Moody October 31, 2008.

MAC Raushan. DES simple fiestel network 3131 PlainText Blocks 2*4=8bits 31 f f =0011 xor 0011=0000 = 0 f(r,k)=(2*r+k^2)%8 f(1,5)=(2*1+5^2)%8=3 xor 3 3.

Encryption Public-Key, Identity-Based, Attribute-Based.

Digital Signatures and Hash Functions. Digital Signatures.

1 Introduction CSE 5351: Introduction to cryptography Reading assignment: Chapter 1 of Katz & Lindell.

CS 483 – SD SECTION BY DR. DANIYAL ALGHAZZAWI (4) Information Security.

Dan Boneh Message Integrity A Parallel MAC Online Cryptography Course Dan Boneh.

LOGO Multi-user Broadcast Authentication in Wireless Sensor Networks ICU Myunghan Yoo.

CS555Spring 2012/Topic 161 Cryptography CS 555 Topic 16: Key Management and The Need for Public Key Cryptography.

Symmetric Key Distribution Protocol with Hybrid Crypto Systems Tony Nguyen.

Key Establishment Techniques: Key Distribution and Key Agreement

Multicast Security May 10, 2004 Sam Irvine Andy Nguyen.

WS Algorithmentheorie 03 – Randomized Algorithms (Public Key Cryptosystems) Prof. Dr. Th. Ottmann.

SPINS: Security Protocols for Sensor Networks Adrian Perrig, Robert Szewczyk, Victor Wen, David Culler, J.D. Tygar Research Topics in Security in the context.

SPINS: Security Protocols for Sensor Networks Adrian Perrig Robert Szewczyk Victor Wen David Culler Doug TygarUC Berkeley.

WS Algorithmentheorie 03 – Randomized Algorithms (Public Key Cryptosystems) Prof. Dr. Th. Ottmann.

Fall 2010/Lecture 311 CS 426 (Fall 2010) Public Key Encryption and Digital Signatures.

Key Distribution CS 470 Introduction to Applied Cryptography

Lecture 4 Cryptographic Tools (cont) modified from slides of Lawrie Brown.

C HAPTER 13 Asymmetric Key Cryptography Slides adapted from "Foundations of Security: What Every Programmer Needs To Know" by Neil Daswani, Christoph Kern,

Computer Science Public Key Management Lecture 5.

Introduction to Public Key Cryptography

Dan Boneh Stream ciphers The One Time Pad Online Cryptography Course Dan Boneh.

1 Public-Key Cryptography and Message Authentication Ola Flygt Växjö University, Sweden

An Efficient Identity-based Cryptosystem for

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.

CMSC 414 Computer and Network Security Lecture 6 Jonathan Katz.

1 Anonymous Roaming Authentication Protocol with ID-based Signatures Lih-Chyau Wuu Chi-Hsiang Hung Department of Electronic Engineering National Yunlin.

Crypto Bro Rigby. History

James Higdon, Sameer Sherwani

Overview of Key Establishment Techniques: Key Distribution, Key Agreement and PKI Wade Trappe.

Networks Management and Security Lecture 3.

Midterm Review Cryptography & Network Security

CS526: Information Security Prof. Sam Wagstaff September 16, 2003 Cryptography Basics.

Cryptographic Hash Functions Message Authentication Digital Signatures.

EE515/IS523 Think Like an Adversary Lecture 4 Crypto in a Nutshell Yongdae Kim.

Basic Cryptography 1. What is cryptography? Cryptography is a mathematical method of protecting information –Cryptography is part of, but not equal to,

Cryptography Wei Wu. Internet Threat Model Client Network Not trusted!!

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

Class 5 Channels and Preview CIS 755: Advanced Computer Security Spring 2014 Eugene Vasserman

Computer Security: Principles and Practice First Edition by William Stallings and Lawrie Brown Lecture slides by Lawrie Brown Chapter 2 – Cryptographic.

ISEP / Fakulta Elektrotecknika 1 Project Of Telecommunication Subject: Describe following “ MAC - Message Authentication Code " modes: Describe following.

KEY MANAGEMENT; OTHER PUBLIC-KEY CRYPTOSYSTEMS - Chapter 10 KEY MANAGEMENT; OTHER PUBLIC-KEY CRYPTOSYSTEMS - Chapter 10 KEY MANAGEMENT DIFFIE-HELLMAN KEY.

PUBLIC-KEY CRYPTOGRAPH IT 352 : Lecture 2- part3 Najwa AlGhamdi, MSc – 2012 /1433.

Cryptography Chapter 7 Part 3 Pages 812 to 833. Symmetric Cryptography Security Services – Only confidentiality, not authentication or non- repudiation.

Chapter 3 (B) – Key Management; Other Public Key Cryptosystems.

Cryptography 1 Crypto Cryptography 2 Crypto  Cryptology  The art and science of making and breaking “secret codes”  Cryptography  making “secret.

Pairing Based Cryptography Standards Terence Spies VP Engineering Voltage Security

Public Key Algorithms Lesson Introduction ●Modular arithmetic ●RSA ●Diffie-Hellman.

Chapter 4: Public Key Cryptography

Secure Messenger Protocol using AES (Rijndael) Sang won, Lee

Dan Boneh Basic key exchange Trusted 3 rd parties Online Cryptography Course Dan Boneh.

Dan Boneh Introduction Course Overview Online Cryptography Course Dan Boneh.

IT 221: Introduction to Information Security Principles Lecture 5: Message Authentications, Hash Functions and Hash/Mac Algorithms For Educational Purposes.

@Yuan Xue CS 285 Network Security Secure Socket Layer Yuan Xue Fall 2013.

CPIS 312 Chapter Four: PUBLIC KEY CRYPTO. Index 2 A.Introduction A.1 Asymmetric Key Cryptography- Introduction A.2 General ideas about the Public Key.

Asymmetric-Key Cryptography

Public Key Encryption and Digital Signatures

Basic Network Encryption

SPINS: Security Protocols for Sensor Networks

Introduction to Symmetric-key and Public-key Cryptography

SPINS: Security Protocols for Sensor Networks

Chapter -7 CRYPTOGRAPHIC HASH FUNCTIONS

Basic Network Encryption

Syed Rafiul Hussain*, Mitziu Echeverria†, Ankush Singla*,

Presentation transcript:

Cryptography for Backup Navigation Dan Boneh Stanford University

Introduction Focus of this talk: Data integrity (not confidentiality) An overview of identity-based cryptography Applications to ADS-B and DME

Data integrity 1: MAC k k Verify tag: Generate tag: F(k, m) = `tag’ Message m tag Verify tag: F(k, m) = `tag’ ? Generate tag: tag  F(k, m) Difficulty with MACs: key management both sides must have the same secret key

Example MAC: (E) CBC-MAC     E(k,) E(k,) E(k,) E(k,) E(k1,) key := (k, k1) message := (m[0], …, m[L]) tag

Problem: broadcast Integrity k k Sta1 msg tag k Sta2 k Sta3 The problem: Sta3 can forge messages to all others (note: TESLA)

Data integrity 2: Dig. Signatures PK SK Bob1 msg sig PK Bob2 sig S( SK, m) SK: secret key PK: public key PK Bob3 Ensures broadcast integrity Difficulty: (1) message needs to include PK and certificate [ msg, sig, PK, cert ] (2) revocation V( PK, m, sig) = `yes’ ? (100s of bytes)

Modern Signatures [BLS’01] Pairings <X,Y>: ,: <X, Y> = <X, Y> Signatures: fix an element g Secret Key:  Public Key: g Sign( SK, M): sig = H(M) (20 bytes) Verify( PK=g, M, sig=H(M) ): test if <g , sig> = <PK, H(M)> <g, H(M)> <g , H(M)>

Performance MACs: built from fast block ciphers Time for short messages (<1KB): 1s Length: 32 to 128 bits Signatures: built from algebraic functions sign/verify time for short messages: 10ms Length: 20 bytes [BLS’01]

identity-based crypto

Identity-based Crypto The basic idea [Shamir 1984] A cryptosystem where anything is a public key Examples: 24-bit plane ID , pilot name , current date Practical systems: [BF 2001, …] Based on new tools: pairings on elliptic curves Commercially deployed (e.g. Voltage Security) master-key my ID is “652A4B” here is your secret key: SK PKG

ex 1: identity-based key exchange my ID is ID1 SKID1 SKID2 my ID is ID2 shared key = F(ID2, SKID1) shared key = F(ID1, SKID2) SKID1 and SKID2 generated at manufacturing time Updated periodically during maintenance Automatic revocation: ID = (plane-ID , month, year)

Application to DME or ADS-B (MLAT) Ping-pong protocol K1 K2 K3 ID1, data, MAC ID2, data, MAC ID3, data, MAC ID1 SK1 ID ID2 SK2 ID SKID K1, K2, K3 verify MACs ID3 SK3  Symmetric MACs with minimal overhead

Repeated authentication Initial setup requires computing a MAC key time  20ms Subsequent messages can be authenticated using established key:  1s / msg

identity-based signatures: ADS-B [ID, data, sig] SKID ID master-key verify sig using ID no need for plane to transmit PK or certificate PKG

Performance ID-based crypto: built from pairings on elliptic curves Time: dominated by pairing computation software: 20ms (1GhZ x86) hardware: 90s (FPGA) ID-based signature length: 40 bytes open problem: 20-byte ID-based sigs

THE END