How to Authenticate Unknown Principals without Trusted Parties - PowerPoint PPT Presentation

About This Presentation
Title:

How to Authenticate Unknown Principals without Trusted Parties

Description:

How to Authenticate Unknown Principals without Trusted Parties ... Defeats passive attacks. Uncertainty depends only on the probability of a MitM on the link ... – PowerPoint PPT presentation

Number of Views:36
Avg rating:3.0/5.0
Slides: 14
Provided by: ietf
Learn more at: https://www.ietf.org
Category:

less

Transcript and Presenter's Notes

Title: How to Authenticate Unknown Principals without Trusted Parties


1
How to Authenticate Unknown Principals without
Trusted Parties
  • Based on a presentation originally given at
  • Tenth Cambridge Protocol Workshop,
  • April 17th, 2002, Cambridge, UK
  • Jari Arkko, Pekka Nikander
  • Ericsson NomadicLab, Finland

2
Presentation Outline
  • Introduction
  • Weak authentication toolbox
  • Weak authentication methods
  • Modelling the impacts
  • Conclusions

3
Introduction to Weak Authentication
  • Weak Authentication (WA) means cryptographic
    authentication between previously unknown parties
    without relying on trusted third parties.
  • In some applications, imperfect security may be
    sufficient
  • Need to analyse attack probabilities and economic
    impacts
  • These factors can be taken in account in protocol
    design
  • Our approach is to try 1. understand the
    potential mechanisms for weak authentication, 2.
    categorize them, and 3. build models for their
    analysis

4
Weak Authentication Toolbox
  • Spatial separation
  • Ensure peer is reachable via a specific
    communications path
  • Physical contact / network path / quality of path
  • Single path / multiple paths
  • Temporal separation
  • Ensure peer is still the same peer
  • Session / Inter-Session
  • Asymmetric cost wars
  • Scanning cost / attack cost / cost of revealing
    location
  • Application semantics
  • Cryptographic semantics of identifiers
  • Transitive and combined methods

5
Toolbox Dimensions
Time
6. Proven same peer as contacted us earlier
5. Still same peer from a different location
4. Still same peer
1. One time use
3. Physical contact
2. Over a specific path
Location
6
Weak Authentication Methods (1/2)
  • Challenge-Response (CR) Spatial
  • E.g. SIP null authentication or Mobile IPv6
    Return Routability
  • Does node X receive packets sent to address A?
  • Anonymous Encryption (AE) Temporal, Cost
  • Unauthenticated Diffie-Hellman
  • The remainder of the session is encrypted and
    integrity protected

7
Weak Authentication Methods (2/2)
  • Leap of Faith (LoF) Temporal, Spatial, Cost
  • At first usage, an unauthenticated key agreement
  • Subsequent connections authenticated using these
    keys
  • E.g. SSH, HIP
  • Cryptographically Generated Addresses Spatial,
    Application
  • Part of an address is a hash of a public key
  • IPv6 Address ltrouting prefixgt hash(PK)
  • Private key can be used to prove I am the
    owner of the particular IPv6 Address

8
Anonymous Encryption (AE)
  • Defeats passive attacks
  • Uncertainty depends only on the probability of a
    MitM on the link

9
Economic Analysis of AE
  • The previous analysis considers only an
    individual - what if everyone used AE?
  • Economic assumptions
  • Cost of scanning 0.1
  • Cost of eavesdrop 1.0
  • Cost of MitM 10.0
  • One interesting person per million

10
AE Individual Use vs. Global Use
  • Conclusion while not useful for a single
    individual, techniques like this can raise the
    costs for an attacker, on a global scale
  • Depends on the assumptions -- if the attacker
    doesnt care who to attack the result is very
    different

11
Challenge-Response
  • Factors
  • Spatial separation ability to see challenge
  • Freshness
  • Simple model
  • P(MitM on a specific path) 0.1
  • Number of paths N
  • No challenges gt
  • P(attacker on some path) 1
  • Challenges gt
  • P(MitM on a specific path) 0.1

12
Leap of Faith
  • Factors
  • Temporal separation
  • Spatial separation
  • Simple model
  • P(a MitM on a specific link) 0.9
  • Different MitMs N2
  • 1. use gt
  • P(attack) 0.9
  • 2. use gt
  • P(attack) 0.9 1/2 0.45
  • k. use gt
  • P(attack) Pk (1/N)k
  • Note that if one link is known to be MitM free,
    then attacks no more possible

13
Uncertainty and CGA
  • LoF ensures that a node continues to be the same
    node as it was originally assumed to be
  • E.g., 10.0.0.1 is the mail server
  • CGA can be used to ensure the same thing in
    stronger manner, and without keeping memory
  • In both cases it still remains to be necessary to
    ensure that the client knows the address of the
    server

14
Conclusions
  • In some application, imperfect security is good
    enough
  • Uncertainties related to Weak Authentication and
    economic impacts for attackers can be surprising
  • Understand the above in the context of the
    application, and then design protocols
Write a Comment
User Comments (0)
About PowerShow.com