Internet-Drafts | 6 Mar 2001 12:52
Picon
Favicon

I-D ACTION:draft-ietf-sacred-framework-01.txt

A New Internet-Draft is available from the on-line Internet-Drafts directories.
This draft is a work item of the Securely Available Credentials Working Group of the IETF.

	Title		: Securely Available Credentials-Credential Server 
                          Framework
	Author(s)	: D. Gustafson, M. Nystrom
	Filename	: draft-ietf-sacred-framework-01.txt
	Pages		: 18
	Date		: 05-Mar-01
	
As the number, and more particularly the number of different
types, of devices connecting to the Internet increases, credential
mobility becomes an issue for IETF standardization. This draft
responds to the credential server framework requirements listed in
[SACRED]. It presents a strawman framework and outlines protocols
for securely available credentials.

A URL for this Internet-Draft is:
http://www.ietf.org/internet-drafts/draft-ietf-sacred-framework-01.txt

Internet-Drafts are also available by anonymous FTP. Login with the username
"anonymous" and a password of your e-mail address. After logging in,
type "cd internet-drafts" and then
	"get draft-ietf-sacred-framework-01.txt".

A list of Internet-Drafts directories can be found in
http://www.ietf.org/shadow.html 
or ftp://ftp.ietf.org/ietf/1shadow-sites.txt

Internet-Drafts can also be obtained by e-mail.
(Continue reading)

Stephen Farrell | 6 Mar 2001 12:56
Picon

Re: I-D ACTION:draft-ietf-sacred-framework-01.txt


Folks,

Somehow, Mike Just's name got left off of the announcement. Mike's
been working a lot with Dale and Magnus on this.

Stephen.

Internet-Drafts <at> ietf.org wrote:
> 
> A New Internet-Draft is available from the on-line Internet-Drafts directories.
> This draft is a work item of the Securely Available Credentials Working Group of the IETF.
> 
>         Title           : Securely Available Credentials-Credential Server
>                           Framework
>         Author(s)       : D. Gustafson, M. Nystrom
>         Filename        : draft-ietf-sacred-framework-01.txt
>         Pages           : 18
>         Date            : 05-Mar-01
> 
> As the number, and more particularly the number of different
> types, of devices connecting to the Internet increases, credential
> mobility becomes an issue for IETF standardization. This draft
> responds to the credential server framework requirements listed in
> [SACRED]. It presents a strawman framework and outlines protocols
> for securely available credentials.
> 
> A URL for this Internet-Draft is:
> http://www.ietf.org/internet-drafts/draft-ietf-sacred-framework-01.txt
> 
(Continue reading)

Magnus Nystrom | 13 Mar 2001 08:42

SACRED Agenda for Minneapolis

Dear All,

Since I have not seen or heard any objections to the proposed agenda,
it will now be submitted to the IETF. Should anyone wish to present
something under item 5, please get in touch with me or Stephen.

Looking forward to see you in Minneapolis,
-- Magnus

 Sacred meeting agenda. Thursday March 22, 1 - 3 pm
 --------------------------------------------------

 1. Introduction, Agenda walkthrough     (5 min) WG Chairs
 2. Working Group Status                 (5 min) WG Chairs
 3. Requirements Draft discussion        (20min) A. Arsenault
 4. Framework Draft discussion           (30min) M. Just
 5. Protocol, authentication mechanisms
    and credential formats - proposals
    and discussion                       (55min) WG Chairs
 6. Wrap up                              (5 min) WG Chairs

hermag@excite.com | 25 Mar 2001 11:03
Picon
Favicon

Would you like to recieve information on how to register your pet online for free?

Hello!

Would you like to know how to register your pet online for free?

If you would like to be removed from ever receiving another email please type REMOVE only in the return subject header. We respect your right to privacy.

If you would like to receive more information on how to register your pet for free just reply to this email message with PLEASE SEND INFO only in the subject header.

Thank You

Linn, John | 26 Mar 2001 17:48

DRAFT minutes, SACRED WG, Minneapolis IETF

DRAFT minutes, SACRED WG, Minneapolis IETF
Minutes collected by John Linn (RSA Laboratories)

Magnus Nystrom (RSA Security) and Stephen Farrell (Baltimore), WG co-chairs,
led the Minneapolis IETF SACRED session.

Opening status summary: Relative to posted milestones, the SACRED WG is
currently running about 2 months late. An -01 version of the requirements
Internet-Draft was submitted in January, and an -00 version of the scenarios
document in February.  An -01 version of the framework document has also
been submitted.  Stated meeting goals included the following: move the
requirements document to WG Last-Call, review the framework document, and
discuss specific identified technical topics. 

Al Arsenault (Diversinet) led discussion on the requirements draft, which he
had coauthored with Stephen Farrell. An -00 version had been posted last
fall, and was discussed at the San Diego meeting and in follow-up comments.
The -01 version is now available, and is intended to be responsive to the
comments received.  Changes clarified the overall scope of the effort,
tightened requirement wording (e.g., protocol requirements are now confined
more tightly to protocol issues), removed internal comments, and enhanced
the security considerations section.  Protocol requirements discussion
includes vulnerability examples, general protocol requirements, and
requirements that are specific to server-based vs. direct transfer cases.
RL Bob Morgan (U. Washington) stated that he had contributed to instigating
the scenarios document based on experience with operational requirements,
though was not its author, and solicited review and comments on its content.
It was agreed that the material from the scenarios document should be
considered for integration into the requirements document. Next steps on
requirements document: consider adding scenarios from scenarios document,
create a -02 version and have WG last call, consider the result for
publication as an Informational RFC.

Dale Gustafson (Future Foundation) led discussion on the SACRED framework
draft. It provides a high level description of the architecture and
protocols intended to be used to exchange secured credentials. Three basic
operations (Get, put, and delete) are defined, with credentials treated as
opaque objects with user-specified format. Issues that had been discussed at
the San Diego meeting included: peer-peer protocol, user/password/credential
organization, sufficiency of GET-PUT-DELETE operations, credential format(s)
selection, authentication method(s) selection.   

Changes in the -01 version include split-off of peer-peer case, added
clarifications, and a provision that the user may have one or more
credentials, each with friendly names. An -01 draft, co-authored with Mike
Just (Entrust) and Magnus, was posed on March 6th.  Comments on it are being
awaited, but none have so far been received.  The intent is to initiate WG
L-C on a subsequent version by/at the London IETF. Contemplated changes for
the -02 version include additional credential management operations like
user registration, de-registration, password change, listing of credentials.
Key open issues are considered to be: credential formats, mutual
authentication methods, and transport protocols.  Magnus believes that these
can be appropriately specified in a separate document, and considers that
the framework document as it stands is appropriately scoped.  It was agreed
that more review and discussion is needed on the content and proposed
changes to the framework, so preparation and discussion of at least one more
version following the -02 draft is currently anticipated before WG
Last-Call. 

Magnus led a discussion on three key open issues: protocol, authentication
mechanisms, credential formats.

Re protocol alternatives, the SACRED protocol is intended to carry both
credentials themselves and SACRED-level control information. Magnus proposed
that the WG should select one protocol with mandatory-to-implement (MTI)
status, but noted that additional choices could be defined separately and
used as alternatives.  He presented a table comparing several alternatives
in terms of three criteria: available client support (CL), firewall
traversal capabilities (FW), and ability for SACRED to usefully leverage
features within the protocol (LV).  His summarized results were as follows: 

UDP: CL: Very good; FW: Less; LV: None
TCP: CL: Good; FW: depends; LV: very little
HTTP: CL: Good; FW: good; LV: good
BEEP: CL: None; FW: less; LV: very good
SOAP/SyncML: CL: Little; FW: ?; LV: ?

John Noerenberg (Qualcomm) commented that application area WGs are currently
exhibiting tremendous interest in BEEP, and that he therefore expects BEEP
support to grow quickly.  An attendee asked whether SMTP would be another
appropriate candidate; it was suggested that this might be considered, but
not as the MTI selection. Regarding HTTP, Ted Ts'o (VA Linux) cited a prior
IESG RFC deprecating layering on HTTP.  Steve Bellovin (AT&T Research), who
was a coauthor of that document, said that its point was primarily to
deprecate HTTP as a generalized firewall penetration scheme, and observed
that HTTP might in fact be a good and appropriate choice for the SACRED
application.  Stephen Farrell suggested that BEEP-formatted tokens might be
transferred using HTTP and/or SASL. RL Bob Morgan asserted that the ability
to leverage security frameworks like SASL should be an important criterion.
Another attendee argued that SACRED should be transport-independent, as an
arbitrary range of applications might want to consume and integrate it
within their messages. In support of this prospect, it was recommended that
extensive support services (e.g., such as those provided by BEEP) not be
assumed within SACRED's transports.  Stephen Farrell considers that XML is
the primary candidate for payload definition.  A straw poll was taken among
the protocol alternatives, but its results were inconclusive.  The question
is to be reconsidered on the mailing list.

Regarding authentication schemes, one key question whether the protocol
should be self-contained for security purposes or should instead be layered,
e.g., on TLS. Discussion in the session emphasized self-contained
alternatives. It was noted that most TLS usage cases require client
foreknowledge of trusted root keys, though some ciphersuites (e.g., SRP,
Kerberos) have been defined which do not require certificates.  Intellectual
property right (IPR) issues are another concern. 

Magnus presented a table comparing the alternatives relative to four
metrics: client CPU requirements, number of communications roundtrips, level
of security, and ease of implementation. Each of DH-EKE, SPEKE, and SRP were
considered as neutral in terms of all of these areas. PDM was considered
weaker in terms of client CPU requirements and ease of implementation, but
stronger in terms of number of communications roundtrips.  OTP was
considered stronger in terms of client CPU requirements, numbers of
roundtrips, and ease of implementation, but weaker in security. 

Radia Perlman (Sun) argued that DH-EKE's and SPEKE's augmented modes, which
avoid storage of password-equivalent data at servers, incur overhead that is
unnecessary in the SACRED application. She noted, further, that this
overhead is intrinsic to SRP.  Stephen Farrell asked whether the WG should
concentrate on one of the first four, or instead emphasize OTP schemes,
noting that (unlike the other approaches) OTP doesn't generate a key or
authenticate the server.  Tim Polk (NIST) commented that it didn't appear
that requirements had been agreed sufficiently to support selection of an
algorithm.  A straw poll was taken on algorithm selection, but its results
were inconclusive.  The question will be revisited on the mailing list.  

Next, IPR issues were considered.  Magnus noted that an IPR statement for
SRP has been posted on the IETF web page. Ted Ts'o commented that the SRP
statement, authored by Thomas Wu, seems rather informal, and considered that
it might be better to have something authoritative from Stanford.  Thomas Wu
responded, indicating that the terms as posted can be documented as
Stanford's policy.  Radia Perlman and Charlie Kaufman (Iris) have previously
stated their goal and intent that PRM be unencumbered.  Steve Bellovin
stated that EKE and DH-EKE are covered by a Lucent-controlled patent; he has
no contact or influence with those responsible for licensing, but believes
that licensing under some terms would probably be possible..  Steve also
commented that SRP might arguably infringe on the EKE patent, and suggested
that this should be investigated.  Ted Ts'o pointed out that the fact of IPR
claims covering SPEKE is generally known

Next, Magnus compared candidate credential formats, in terms of current
support (CS), ability for effective leverage by SACRED (LV) and flexibility
(FL).  The summarized results were as follows:

PKCS #12++: CS: None; LV: None; FL: OK
PKCS#12 (Today's) + PKCS #7: CS: Good; LV: Yes; FL: Less
PKCS#15: CS: Little; LV: Yes; FL: Yes
OpenPGP: CS: Good; LV: Less; FL: Less

John Noerenberg chairs the OpenPGP WG, and believed that this summary
understates OPGP's capabilities. He noted that OPGP is designed to be
compact and flexible for support of multiple algorithms.  Bob Moskowitz
(ICSA) observed that different communities may require different formats for
compatibility with their technology bases.   A straw poll was taken on
format choices: its results were inconclusive, and the discussion was
deferred to the mailing list. 

Nada Cicovic (Entegrity) gave a presentation entitled "Contents of PSE -
Certificate Enrollment and Lifecycle."  The work derives from PKI Forum's
CMP interoperability testing work, and an associated document has been
circulated within the PKI Forum. It seeks to standardize representations for
a range of information, including: RA/CA details (address, transport
protocol, registration protocol); shared secrets used for authentication;
allowed/required fields in enrollment certificate template; EE naming
information as registered by the RA/CA; RA/CA supported key types; key sizes
and usages; and designators for EE vs. CA-performed key generation.  The
motivations considered for standardization are to enable interoperability
between PKI clients and RA/CAs from different vendors, to boost deployment
of CMP/CMC, and to enable smooth certificate enrollment, renewal and
registration.  A question was raised as to whether SACRED was the
appropriate forum to pursue the topic.  Nada believed that it falls on the
line between PKIX and SACRED; as it's PSE information, she stated that PKIX
representatives thought it would be more appropriately considered in SACRED.
Additionally or alternatively, Nada suggests that it might be considered in
PKCS #15.  Magnus pointed out that the topic will probably also be raised at
the PKCS Forum session which will be convened at the April RSA Conference.
Stephen suggested that Nada make materials available for review within the
SACRED WG.

A proposed schedule was presented for upcoming SACRED milestones:

March: requirements I-D to WG Last-Call
April: framework -02 I-D
April: protocol -00 I-D
June: framework I-D (-03) to WG Last-Call
Nov: revised protocol I-D to WG Last-Call?

Radia Perlman gave a brief overview of the operation of cryptographic
protocols such as EKE and SPEKE, which perform password-modified
Diffie-Hellman exchanges. Each modifies the Diffie-Hellman exchange in a
different way. 

Magnus closed the session, encouraging continuing discussions on the mailing
list before the next planned meeting at the London IETF.

Yongge Wang | 26 Mar 2001 21:52

Re: DRAFT minutes, SACRED WG, Minneapolis IETF


> Next, IPR issues were considered.  Magnus noted that an IPR statement for
> SRP has been posted on the IETF web page. Ted Ts'o commented that the SRP
> statement, authored by Thomas Wu, seems rather informal, and considered that
> it might be better to have something authoritative from Stanford.  Thomas Wu
> responded, indicating that the terms as posted can be documented as
> Stanford's policy.  Radia Perlman and Charlie Kaufman (Iris) have previously
> stated their goal and intent that PRM be unencumbered.  Steve Bellovin
> stated that EKE and DH-EKE are covered by a Lucent-controlled patent; he has
> no contact or influence with those responsible for licensing, but believes
> that licensing under some terms would probably be possible..  Steve also
> commented that SRP might arguably infringe on the EKE patent, and suggested
> that this should be investigated.  Ted Ts'o pointed out that the fact of IPR
> claims covering SPEKE is generally known

If none of the protocols is patent free, why we do not make the following
choice:
The requirement and standard do not specify any algorithm, leave it as a
black-box... And the standard should be general enough so that most of the
algorithms could be implemented (each algorithm should have a unique
identifier).

Regards,
Yongge

Picon

Re: DRAFT minutes, SACRED WG, Minneapolis IETF

Yonge said:
	
	If none of the protocols is patent free, why we do not make the 
following
	choice:
	The requirement and standard do not specify any algorithm, leave it as a
	black-box... And the standard should be general enough so that most of 
the
	algorithms could be implemented (each algorithm should have a unique
	identifier).
	
PDM has not been patented. This doesn't mean of course that it is
absolutely certain someone doesn't have a patent that might cover some
aspects of it,
but PDM itself is not patented. So we don't need a statement from
our organizations that it will be licensed on reasonable terms, or
free terms provided that people who use it grant license to any
of their technology, ... It's simply not patented.

It would be nice to at least come up with a single MUST implement, as
well as a bunch of other choices, should the MUST alg wind up cryptographically
broken or with someone showing they have a patent on arithmetic which
covers it.

Radia

Tom Wu | 26 Mar 2001 23:04
Favicon

Re: DRAFT minutes, SACRED WG, Minneapolis IETF

Radia Perlman - Boston Center for Networking wrote:
> 
> It would be nice to at least come up with a single MUST implement, as
> well as a bunch of other choices, should the MUST alg wind up cryptographically
> broken or with someone showing they have a patent on arithmetic which
> covers it.

If one of the strong password methods like PDM or SRP becomes a MUST
implement, though, how does that help implementors that want to deploy a
different topology, like a Ford-Kaliski multi-server configuration? 
Their servers cannot support a "regular" strong password protocol, so
does that make their implementation non-sacred-compliant by design?

> Radia

Tom
--

-- 
Tom Wu
Principal Software Engineer
Arcot Systems
(408) 969-6124
"The Borg?  Sounds Swedish..."

Yongge Wang | 26 Mar 2001 23:52

Re: DRAFT minutes, SACRED WG, Minneapolis IETF


On Mon, 26 Mar 2001, Radia Perlman - Boston Center for Networking wrote:
> PDM has not been patented. This doesn't mean of course that it is
> absolutely certain someone doesn't have a patent that might cover some
> aspects of it,
> but PDM itself is not patented. So we don't need a statement from
> our organizations that it will be licensed on reasonable terms, or
> free terms provided that people who use it grant license to any
> of their technology, ... It's simply not patented.

PDM is a nice protocol. Of course, as mentioned in the
previous summary of Milliapolos meeting, the client side
is a little slow. In particular, ECC is used in wireless
devices such as Palm for several well-known reasons.
If wireless devices will be one of the main users of SACRED,
I think PDM might need a nice refinement for ECC version.
At present, there is no natural efficient ECC version of PDM. 
We cannot imagine that each time Palm will generate a 
Elliptic Curve and count the points on it. 

One solution might be as follows though it is still a little
slow: the Elliptic Curve should be a public one. But each time,
the password should be used to generate the generator of the
Elliptic Curve group (this will look like the SPEKE,
hope this is not covered by the SPEKE patent).

Some factors might also be taken into consideration in 
desiging SACRED protocol. In order to support different
protocols, the same password might be delivered by the 
server to the client using several different algorithms.
Then the special care might need to be taken for
security reasons.
(e.g., my Palm and Desktop should download the same password,
though my Palm use ECC and Destop use DH.)

Yongge

> It would be nice to at least come up with a single MUST implement, as
> well as a bunch of other choices, should the MUST alg wind up cryptographically
> broken or with someone showing they have a patent on arithmetic which
> covers it.

-----------------------------------
Yongge Wang -- Crypto Mathematician
http://cs.uwm.edu/~wang/
-----------------------------------    

Stephen Farrell | 27 Mar 2001 12:45
Picon

Re: DRAFT minutes, SACRED WG, Minneapolis IETF


> If none of the protocols is patent free, why we do not make the following
> choice:
> The requirement and standard do not specify any algorithm, leave it as a
> black-box... And the standard should be general enough so that most of the
> algorithms could be implemented (each algorithm should have a unique
> identifier).

We MUST end up with an interoperable protocol. That means choosing one
of everything that can be chosen, including authentication schemes as
the mandatory-to-implement. We will ensure that implementations are
able to flag other options (and might even generate some WG documents
about them). 

One your second note, my interpretation would be that PDM doesn't
have to support multiple types of cryptography like ECC, since 
from the sacred perspective, PDM itself is an algorithm (i.e. if you
had an EC variant, it wouldn't be PDM, but PDM-EC or something).

Stephen.

--

-- 
____________________________________________________________
Stephen Farrell         				   
Baltimore Technologies,   tel: (direct line) +353 1 881 6716
39 Parkgate Street,                     fax: +353 1 881 7000
Dublin 8.                mailto:stephen.farrell <at> baltimore.ie
Ireland                             http://www.baltimore.com


Gmane