Providing Trusted Paths Using Untrusted Components Andre L. M. dos Santos Georgia Institute of Technology

Slides:



Advertisements
Similar presentations
Chapter 10 Real world security protocols
Advertisements

Lecture 6 User Authentication (cont)
Last Class: The Problem BobAlice Eve Private Message Eavesdropping.
CS470, A.SelcukCryptographic Authentication1 Cryptographic Authentication Protocols CS 470 Introduction to Applied Cryptography Instructor: Ali Aydin Selcuk.
CSC 774 Advanced Network Security
Defeating Malicious Terminals in an Electronic Voting System Daniel Hanley Andre dos Santos Jeff King Georgia Tech Information Security Center.
Distribution and Revocation of Cryptographic Keys in Sensor Networks Amrinder Singh Dept. of Computer Science Virginia Tech.
Digital Watermarking for Telltale Tamper Proofing and Authentication Deepa Kundur, Dimitrios Hatzinakos Presentation by Kin-chung Wong.
Hardware Cryptographic Coprocessor Peter R. Wihl Security in Software.
Information Hiding: Watermarking and Steganography
Analysis of Direct Anonymous Attestation (DAA) Sudip Regmi Ilya Pirkin.
1 Secure Credit Card Transactions on an Untrusted Channel Source: Information Sciences in review Presenter: Tsuei-Hung Sun ( 孫翠鴻 ) Date: 2010/9/24.
Authentication attacks, causes and solutions Analyzing man in the middle and dictionary attacks against SSL/TLS and password based authentication systems.
Breaking an Animated CAPTCHA Scheme
Intro To Secure Comm. Exercise 2. Problem  You wish for your users to access a remote server via user and password.  All of the users have modems and.
1 Chapter 11: Authentication Basics Passwords. 2 Establishing Identity Authentication: binding of identity to subject One or more of the following –What.
CAPTCHA Presented By Sayani Chandra (Roll )
G Robert Grimm New York University Using Encryption for Authentication in Computer Networks.
CMSC 414 Computer (and Network) Security Lecture 2 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 19 Jonathan Katz.
Trustworthy User Interface Design: Dynamic Security Skins Rachna Dhamija and J.D. Tygar University of California, Berkeley TIPPI Workshop June 13, 2005.
CMSC 414 Computer and Network Security Lecture 6 Jonathan Katz.
Applied Cryptography for Network Security
Authentication in Ubiquitous Computing Laurent BUSSARD and Yves ROUDIER Institut Eurecom Workshop on Security in Ubiquitous Computing UBICOMP 2002, Goteborg.
Modelling and Analysing of Security Protocol: Lecture 5 BAN logic Tom Chothia CWI.
CMSC 414 Computer (and Network) Security Lecture 24 Jonathan Katz.
1 Securing Passwords Against Dictionary Attacks Base on an article by Benny Pinkas & Tomas Sander 2002 Presented by Tomer Conforti.
Parts of a Computer.
Digital Watermarking Parag Agarwal
Authentication Approaches over Internet Jia Li
Computer Security Tran, Van Hoai Department of Systems & Networking Faculty of Computer Science & Engineering HCMC University of Technology.
Information Security for Managers (Master MIS)
Part 2  Access Control 1 CAPTCHA Part 2  Access Control 2 Turing Test Proposed by Alan Turing in 1950 Human asks questions to another human and a computer,
Protecting Web 2.0 Services from Botnet Exploitations Cybercrime and Trustworthy Computing Workshop (CTC), 2010 Second Nguyen H Vo, Josef Pieprzyk Department.
Introduction to Secure Messaging The Open Group Messaging Forum April 30, 2003.
EMBEDDED SECURITY EEN 417 Fall /6/13, Dr. Eric Rozier, V1.0, ECE Thanks to Edward Lee and Sanjit Seshia of UC Berkeley.
The Battle Against Phishing: Dynamic Security Skins Rachna Dhamija and J.D. Tygar U.C. Berkeley.
1 Chapter 11: Authentication Basics Passwords. 2 Establishing Identity Authentication: binding of identity to subject One or more of the following –What.
IMAGINATION: A Robust Image-based CAPTCHA Generation System Ritendra Datta, Jia Li, and James Z. Wang The Pennsylvania State University – University Park.
Preventing Automated Use of STMP Reservation System Using CAPTCHA.
Presented by: Suparita Parakarn Kinzang Wangdi Research Report Presentation Computer Network Security.
Password Mistyping in Two-Factor Authenticated Key Exchange Vladimir KolesnikovCharles Rackoff Bell LabsU. Toronto ICALP 2008.
Lecture 7 Page 1 CS 236, Spring 2008 Challenge/Response Authentication Authentication by what questions you can answer correctly –Again, by what you know.
CSCE 522 Identification and Authentication. CSCE Farkas2Reading Reading for this lecture: Required: – Pfleeger: Ch. 4.5, Ch. 4.3 Kerberos – An Introduction.
Attacks Overview Nguyen Cao Dat 1. BK TP.HCM Outline  Cryptographic Attacks ▫ Frequency analysis ▫ Brute force attack ▫ Meet-in-the-middle attack ▫ Birthday.
Ingredients of Information Security. - Who has access the asset? - Is the asset correct? - Is the asset accessible? …uncorrupted? …authentic?
Secure Conjunctive Keyword Search Over Encrypted Data Philippe Golle Jessica Staddon Palo Alto Research Center Brent Waters Princeton University.
CS453: Introduction to Information Security for E-Commerce Prof. Tom Horton.
Securing Passwords Against Dictionary Attacks Presented By Chad Frommeyer.
Traditional Security Issues Confidentiality –Prevent unauthorized access or reading of information Integrity –Insure that writing or operations are allowed.
Identification Authentication. 2 Authentication Allows an entity (a user or a system) to prove its identity to another entity Typically, the entity whose.
1 Running Experiments for Your Term Projects Dana S. Nau CMSC 722, AI Planning University of Maryland Lecture slides for Automated Planning: Theory and.
Authentication What you know? What you have? What you are?
A Security Framework with Trust Management for Sensor Networks Zhiying Yao, Daeyoung Kim, Insun Lee Information and Communication University (ICU) Kiyoung.
TRUSTED FLOW: Why, How and Where??? Moti Yung Columbia University.
Network Security Celia Li Computer Science and Engineering York University.
CSCE 201 Identification and Authentication Fall 2015.
CAP Malware and Software Vulnerability Analysis Term Project Proposal - Spring 2009 Professor: Dr. Zou Team members: Andrew Mantel & Peter Matthews.
Lecture 7 Page 1 CS 236 Online Challenge/Response Authentication Authentication by what questions you can answer correctly –Again, by what you know The.
Threshold password authentication against guessing attacks in Ad hoc networks ► Chai, Zhenchuan; Cao, Zhenfu; Lu, Rongxing ► Ad Hoc Networks Volume: 5,
David Evans CS588: Security and Privacy University of Virginia Computer Science Lecture 15: From Here to Oblivion.
 Encryption provides confidentiality  Information is unreadable to anyone without knowledge of the key  Hashing provides integrity  Verify the integrity.
SECURITY. Security Threats, Policies, and Mechanisms There are four types of security threats to consider 1. Interception 2 Interruption 3. Modification.
1 Digital Water Marks. 2 History The Italians where the 1 st to use watermarks in the manufacture of paper in the 1270's. A watermark was used in banknote.
Topic 36: Zero-Knowledge Proofs
Introduction Artificial Intelligent.
Recent Developments on Multimedia and Secure Networking Technologies
Chair Professor Chin-Chen Chang Feng Chia University
Strong Password Authentication Protocols
Recent Developments on Multimedia and Secure Networking Technologies
Presentation transcript:

Providing Trusted Paths Using Untrusted Components Andre L. M. dos Santos Georgia Institute of Technology

Electronic Voting Assumptions: –There is a framework for electronic voting All the crypto is embedded in the framework. –Smart cards, USB tokens, or any other portable tamper resistant device adds security to electronic voting. Problem: –Would a tamper proof smart card solve all problems of electronic voting?

Do You Know to Whom are you Voting ?

What is the problem? The devices that are used for direct I/O with a human needs to be tamper proof. –So, not only the card needs to be tamper proof …. I vote for John Hommer’s Vote is for Bob Or NOT ????

Hard AI Problems Informally, something that humans can do easily but computers can't. CAPTCHA -- Completely Automated Turing Test to Tell Computers and Humans Apart Generate random message, transform it, ask human to repeat it Transformation problem: –Subset of hard AI problems that transform a message –Example: distort text of message so that only humans can read it

KHAP: Keyed Hard AI Problems A transformation problem that includes a shared secret key Instances generated with different keys are distinguishable Computers can't steal keys from messages Formalisms ( t=T(m,k) is (α, β, γ, δ, ε, ζ)-keyed transformation) –the probability that a human can extract m from t is at least α –the probability that a human with knowledge of k can correctly verify whether k was used to create t is at least β –there does not exist a computer program that runs in time ζ such that the probability of the program extracting m from t is greater than γ –there does not exist a computer program that runs in time ζ such that the probability of the program extracting k from t is greater than δ –let A be a computer program that modifies t to include m’ ≠ m; there does not exist an A that runs in time ζ such that the probability of a human failing to detect the modification is greater than ε

Protocol

3-D Keyed Transformation Render text and objects in a 3-D scene to 2-D image (raytrace) Randomize parameters (lighting, position, rotation, size, colors) Human can read text from 2-D image Key is appearance of objects Human looks for particular objects in scene Scene is hard to modify in a meaningful way (shadows, reflections, finding objects) Provide authenticity (presence of keys) and integrity (modifications can be detected by human)

E-Voting using 3-D Images

Considerations How does a human confirm a message? –Disconnect, or not, trusted platform When should you connect your platform? –Confirmation word How does a low computing power device performs the transformation? –Can use (semi) trusted servers connected using an anonymizing network –Needs to worry about covert channels What is the best transformation? –Others examples are speech and text.

Considerations Replays and Human Professors –Time stamps –Aging –Spatial relationships Easy to guess keys –Cute puppy dog! –May be easier to avoid

Conclusions This is a general approach for interacting with trusted computers Many features of electronic voting systems help the use of this approach Easy to use –Avoid computation, memory aids: ask humans to do what they do best –Some problems are intuitive (e.g., recognizing voice)