Computer Security and Privacy Autumn 2018 Tadayoshi (Yoshi) Kohno - - PowerPoint PPT Presentation

computer security and privacy
SMART_READER_LITE
LIVE PREVIEW

Computer Security and Privacy Autumn 2018 Tadayoshi (Yoshi) Kohno - - PowerPoint PPT Presentation

CSE 484 / CSE M 584: Computer Security and Privacy Autumn 2018 Tadayoshi (Yoshi) Kohno yoshi@cs.washington.edu Thanks to Dan Boneh, Dieter Gollmann, Dan Halperin, Ada Lerner, John Manferdelli, John Mitchell, Franziska Roesner, Vitaly


slide-1
SLIDE 1

CSE 484 / CSE M 584: Computer Security and Privacy

Autumn 2018 Tadayoshi (Yoshi) Kohno yoshi@cs.washington.edu

Thanks to Dan Boneh, Dieter Gollmann, Dan Halperin, Ada Lerner, John Manferdelli, John Mitchell, Franziska Roesner, Vitaly Shmatikov, Bennet Yee, and many others for sample slides and materials ...

slide-2
SLIDE 2

Announcements / Answers

  • If you’re on the class mailing list, you should

have received an email (about office hours this week).

  • Ethics form: Due next Wednesday (10/3).
  • Homework #1: Due next Friday (10/5) – start

forming groups, feel free to use forum.

9/29/2018 CSE 484 / CSE M 584 2

slide-3
SLIDE 3

Announcements / Answers

  • No quiz section on Thanksgiving Day
  • No lecture on the Wednesday before

Thanksgiving day: Video assignment instead

9/29/2018 CSE 484 / CSE M 584 3

slide-4
SLIDE 4

Last Time + Quiz Section

  • Importance of the security mindset

– Challenging design assumptions – Thinking like an attacker

  • There’s no such thing as perfect security

– But, attackers have limited resources – Make them pay unacceptable costs to succeed!

  • Defining security per context: identify assets,

adversaries, motivations, threats, vulnerabilities, risk, possible defenses

9/29/2018 CSE 484 / CSE M 584 4

slide-5
SLIDE 5

Example: Modern Automobiles

Modern automobiles contain dozens of computers. Those computers control nearly everything in the car, including locks, lights, brakes, the engine, the airbags, etc.

9/29/2018 CSE 484 / CSE M 584 5

Who might want to attack? Why, and how?

slide-6
SLIDE 6

Practicing Security Mindset

  • See worksheet, Q3

9/29/2018 CSE 484 / CSE M 584 6

slide-7
SLIDE 7

SECURITY GOALS (“CIA”) (QUIZ SECTION AND TODAY)

9/29/2018 CSE 484 / CSE M 584 7

slide-8
SLIDE 8

Confidentiality (Privacy)

9/29/2018 CSE 484 / CSE M 584 8

network

  • Confidentiality is concealment of information.

Eavesdropping, packet sniffing, illegal copying

slide-9
SLIDE 9

Integrity

9/29/2018 CSE 484 / CSE M 584 9

network

  • Integrity is prevention of unauthorized changes.

Intercept messages, tamper, release again

slide-10
SLIDE 10

Authenticity

9/29/2018 CSE 484 / CSE M 584 10

network

Unauthorized assumption of another’s identity

  • Authenticity is knowing who you’re talking to.
slide-11
SLIDE 11

Availability

9/29/2018 CSE 484 / CSE M 584 11

network

  • Availability is ability to use information or resources.

Overwhelm or crash servers, disrupt infrastructure

slide-12
SLIDE 12

THREAT MODELING

9/29/2018 CSE 484 / CSE M 584 12

slide-13
SLIDE 13

Threat Modeling (Security Reviews)

  • Assets: What are we trying to protect? How

valuable are those assets?

  • Adversaries: Who might try to attack, and why?
  • Vulnerabilities: How might the system be weak?
  • Threats: What actions might an adversary take to

exploit vulnerabilities?

  • Risk: How important are assets? How likely is

exploit?

  • Possible Defenses

9/29/2018 CSE 484 / CSE M 584 13

slide-14
SLIDE 14

Example: Electronic Voting

  • Popular replacement to

traditional paper ballots

9/29/2018 CSE 484 / CSE M 584 14

slide-15
SLIDE 15

Pre-Election

9/29/2018 CSE 484 / CSE M 584 15

Ballot definition file

Pre-election: Poll workers load “ballot definition files” on voting machine.

Poll worker

slide-16
SLIDE 16

Active Voting

9/29/2018 CSE 484 / CSE M 584 16

Voter token Voter token Interactively vote Ballot definition file

Active voting: Voters obtain single-use tokens from poll workers. Voters use tokens to activate machines and vote.

Voter Poll worker

slide-17
SLIDE 17

Active Voting

9/29/2018 CSE 484 / CSE M 584 17

Encrypted votes Voter token Voter token Interactively vote Ballot definition file

Active voting: Votes encrypted and stored. Voter token canceled.

Voter Poll worker

slide-18
SLIDE 18

Post-Election

9/29/2018 CSE 484 / CSE M 584 18

si.edu si.edu

Voter token Tabulator Voter token Interactively vote Ballot definition file

Post-election: Stored votes transported to tabulation center.

Encrypted votes Recorded votes

Voter Poll worker

slide-19
SLIDE 19

Security and E-Voting (Simplified)

  • Functionality goals:

– Easy to use, reduce mistakes/confusion

  • Security goals:

– Adversary should not be able to tamper with the election outcome

  • By changing votes (integrity)
  • By voting on behalf of someone (authenticity)
  • By denying voters the right to vote (availability)

– Adversary should not be able to figure out how voters vote (confidentiality)

9/29/2018 CSE 484 / CSE M 584 19

slide-20
SLIDE 20

Can You Spot Any Potential Issues?

9/29/2018 CSE 484 / CSE M 584 20

si.edu si.edu

Voter token Tabulator Voter token Interactively vote Ballot definition file Encrypted votes Recorded votes

Voter Poll worker

slide-21
SLIDE 21

Q1 and Q2 on the Worksheet

9/29/2018 CSE 484 / CSE M 584 21

slide-22
SLIDE 22

Potential Adversaries

  • Voters
  • Election officials
  • Employees of voting machine manufacturer

– Software/hardware engineers – Maintenance people

  • Other engineers

– Makers of hardware – Makers of underlying software or add-on components – Makers of compiler

  • ...
  • Or any combination of the above

9/29/2018 CSE 484 / CSE M 584 22

slide-23
SLIDE 23

What Software is Running?

9/29/2018 CSE 484 / CSE M 584 23

Problem: An adversary (e.g., a poll worker, software developer, or company representative) able to control the software or the underlying hardware could do whatever he or she wanted.

slide-24
SLIDE 24

9/29/2018 CSE 484 / CSE M 584 24

slide-25
SLIDE 25

Bad file Tabulator Voter token Interactively vote Ballot definition file Encrypted votes

Problem: Ballot definition files are not authenticated. Example attack: A malicious poll worker could modify ballot definition files so that votes cast for “Mickey Mouse” are recorded for “Donald Duck.”

Recorded votes

Voter Poll worker

slide-26
SLIDE 26

Voter token Interactively vote Ballot definition file

Problem: Smartcards can perform cryptographic operations. But there is no authentication from voter token to terminal. Example attack: A regular voter could make his or her own voter token and vote multiple times.

Tabulator Encrypted votes Recorded votes

Voter Poll worker

slide-27
SLIDE 27

Ballot definition file Tabulator Encrypted votes

Problem: Encryption key (“F2654hD4”) hard-coded into the software since (at least) 1998. Votes stored in the order cast. Example attack: A poll worker could determine how voters vote.

Recorded votes Voter Voter token Interactively vote

Voter Poll worker

slide-28
SLIDE 28

Ballot definition file Tabulator Encrypted votes

Problem: When votes transmitted to tabulator over the Internet

  • r a dialup connection, they are decrypted first; the cleartext

results are sent the the tabulator. Example attack: A sophisticated outsider could determine how voters vote.

Voter token Interactively vote Recorded votes

Voter Poll worker

slide-29
SLIDE 29

Tables Often Help!

slide-30
SLIDE 30

Example Table 1

Attacker “Positions” Machine Manufacturer Poll Worker Voter Power Company Employee Voter Privacy Vote Integrity Voting Machine Availability …

  • What can different parties do? Each cell would have an

action or actions that these parties might try do

  • Note that some parties could collaborate
slide-31
SLIDE 31

Example Table 2

Attack Methods Modify Software Produce Fake Voter Tokens Steal Flash Drive Intercept Network Connections Voter Privacy Vote Integrity Voting Machine Availability …

  • What different attack methods are there? (Columns)
  • Who could mount these different attacks? What are the

attack details (the cells)

  • How easy is it to implement each of these attack

methods?

slide-32
SLIDE 32

Table from Paper

9/29/2018 CSE 484 / CSE M 584 32

https://homes.cs.washington.edu/~yoshi/papers/eVoting/vote.pdf

slide-33
SLIDE 33

TOWARDS DEFENSES

9/29/2018 CSE 484 / CSE M 584 33

slide-34
SLIDE 34

Approaches to Security

  • Prevention

– Stop an attack

  • Detection

– Detect an ongoing or past attack

  • Response

– Respond to attacks

  • The threat of a response may be enough to

deter some attackers

9/29/2018 CSE 484 / CSE M 584 34

slide-35
SLIDE 35

Whole System is Critical

  • Securing a system involves a whole-system view

– Cryptography – Implementation – People – Physical security – Everything in between

  • This is because “security is only as strong as the

weakest link,” and security can fail in many places

– No reason to attack the strongest part of a system if you can walk right around it.

9/29/2018 CSE 484 / CSE M 584 35

slide-36
SLIDE 36

Whole System is Critical

  • Securing a system involves a whole-system view

– Cryptography – Implementation – People – Physical security – Everything in between

  • This is because “security is only as strong as the

weakest link,” and security can fail in many places

– No reason to attack the strongest part of a system if you can walk right around it.

9/29/2018 CSE 484 / CSE M 584 36

slide-37
SLIDE 37

Whole System is Critical

  • Securing a system involves a whole-system view

– Cryptography – Implementation – People – Physical security – Everything in between

  • This is because “security is only as strong as the

weakest link,” and security can fail in many places

– No reason to attack the strongest part of a system if you can walk right around it.

9/29/2018 CSE 484 / CSE M 584 - Fall 2017 37

slide-38
SLIDE 38

Whole System is Critical

  • Securing a system involves a whole-system view

– Cryptography – Implementation – People – Physical security – Everything in between

  • This is because “security is only as strong as the

weakest link,” and security can fail in many places

– No reason to attack the strongest part of a system if you can walk right around it.

9/29/2018 CSE 484 / CSE M 584 - Fall 2017 38