Authenticated DHCP IETF DHC Working Group Interim Meeting

Thursday and Friday June 4-5, 1998

(Back to dhcp.org home)

Thanks to Kim Kinnear for recording these minutes...


Meeting Minutes:

Attendees:

Peter Ford Microsoft   peterf@microsoft.com
Kim Kinnear American Internet (781) 276-4587 kinnear@american.com
Glenn Waters Bay Networks (613) 722-1921 gwaters@baynetworks.com
Rob Stevens Join Systems (650) 321-4006 robs@join.com
Bill Arbaugh University of Pennsylvania (410) 465-3432 waa@dsl.cis.upenn.edu
Baiju Patel Intel (503) 264-2422 baiju.v.patel@intel.com
Carl Smith Sun (650) 786-5181 cs@eng.sun.com
Thomas Narten IBM (919) 254-7798  
Stewart Kwan Microsoft (425) 936-0564 skwan@microsoft.com
Munil Shah Microsoft    
Olafur Gudmundsson TIS (301) 854-5794 ogud@tis.com
Robert Watson TIS   robert+ietf@cyrus.watson.org
Ralph Droms Bucknell University (717) 524-1145 droms@bucknell.edu
Mike Dooley Quadritek Systems   mdooley@quadritek.com
Greg Rabil Quadritek Systems    
Arun Kapur Quadritek Systems    


Scenarios and Requirements:

Morning Session: Thursday 6/4/98


Scenarios:

Requirements:

Non-requirements: What we're not going to solve.

Possible Future DHCP Capabilities: These are capabilities that we may want to someday extend the DHCP protocol suite to support as well as capabilities that we need to make sure that any DHCP authentication solution doesn't make these capabilities impossible.


Presentations of Proposals

Afternoon Session: Thursday 6/4/98

Shared Secret Authentication of DHCP Messages
Ralph Droms

DHC Security Requirements
Olafur Gudmundsson

The Problem:

Consequences:

Inside the Client:

Client Considerations:

Server Considerations:

Security Needs:

Issues:

DHCP Authentication
Bill Arbaugh Angelos, D. Keromytis, Distributed Systems Laboratory

Overview of Approach:

Recovery Protocol:

     Client Pca					         Server Pca

	DISCOVER -> cnonce, C client ->		    Vca( Cclient)
	                                            Vcnonce(M)
						                   Y = g^y mod p

	<----------  Y, snonce, cnonce, Cs <- DHCPOFFER

	Vca( Cs)
	cnonce == anonce
	Vs( M )
	X = g^x mod p
	k = Y^x mod p

	DHCPREQUEST ---------->  X, snonce, Y ----->	
						                  Y == Y
						                  snonce == snonce
						                  Vclient( M )
						                  K = X^y mod p

	<-----  Packet, SHA1MACk(Packet) <---- DHCPACK

Prototype:

Conclusion:

Issues:

DHCP Authentication
Baiju Patel


DHCP Functions - These things work now, and MUST continue to work


Threats:


Security Requirements:

Requirements:

Usage:

Usage:

Options:

IPSEC based solution:


IPSEC Securing DHCP:

Phase 1:

Phase 2:

Phase 3:

Flexible Security
-----------------:

Either the client or the server can choose to go from
Phase 1 to Phase 2 -- if neither of them choose to do this,
it runs just like it does today.

SDHCP server considerations:

Relay Agent Authentication:

IF (and this isn't clear) authenticating the relay agent is
important, then the server should trust the relay agent.

Baiju doesn't see any reason or way to authenticate the relay
agent to the client.

SDHCP Client Considerations:

Do not bring up full networking capabilities unless:

What about TFTP?



Conversation:

Peter F: You either need to have a way to handle revoked keys
or short lifetimes.

Baiju: Or ... you authenticate the sender.


Denial of Service:

DHCP V6 Refresher
Ralph Droms


Solicit Advertise


    -> Server
   /
  /
client <--------> Relay Agent <----> Server
  \
   \
    -> Server

Request/Reply


    -> Server
   /
  /
client <--------> Relay Agent <- Server


        Server


Authenticator Option



Evaluation of Proposals

Late Afternoon Session: Thursday 6/4/98

Proposals


Big Questions

  1. Relay agent <-> Client Authentication appears to be a non-issue
  2. DHCPv6 Relay Agent authentication needs study
  3. How does a client transfer from one server to another in the REBINDING case. This is an issue with either today's two-server DHCP redundancy situation, and an issue with any inter-server or failover protocol-based DHCP redundancy solution in the future.


Wrapup

Friday Morning, June 5, 1998

Goals for Today

Target Space

  1. "Global" -- any client can walk up to arbitrary domain, things work.

    Implemented by:

  2. "Somewhat global" -- any client can walk up to arbitrary domain to which it has had a prior relation.
  3. How do the client and server agree on which key/credentials to use:
  4. "Single domain" -- client can only work in a single domain.

    Implemented by:

Desired requirements

Things to solve