Dismiss
InnovationQ/InnovationQ Plus content will be updated on Sunday, June 25, 10am ET, with new patent and non-patent literature collections. Click here to learn more.
Browse Prior Art Database

Digest Values for DOM (DOMHASH) (RFC2803)

IP.com Disclosure Number: IPCOM000003402D
Original Publication Date: 2000-Apr-01
Included in the Prior Art Database: 2000-Sep-13
Document File: 9 page(s) / 21K

Publishing Venue

Internet Society Requests For Comment (RFCs)

Related People

H. Maruyama: AUTHOR [+3]

Abstract

This memo defines a clear and unambiguous definition of digest (hash) values of the XML objects regardless of the surface string variation of XML. This definition can be used for XML digital signature as well efficient replication of XML objects.

This text was extracted from a ASCII Text document.
This is the abbreviated version, containing approximately 14% of the total text.

Network Working Group H. Maruyama

Request for Comments: 2803 K. Tamura

Category: Informational N. Uramoto

IBM

April 2000

Digest Values for DOM (DOMHASH)

Status of this Memo

This memo provides information for the Internet community. It does

not specify an Internet standard of any kind. Distribution of this

memo is unlimited.

Copyright Notice

Copyright (C) The Internet Society (2000). All Rights Reserved.

Abstract

This memo defines a clear and unambiguous definition of digest (hash)

values of the XML objects regardless of the surface string variation

of XML. This definition can be used for XML digital signature as well

efficient replication of XML objects.

Table of Contents

1. Introduction............................................2

2. Digest Calculation......................................3

2.1. Overview..............................................3

2.2. Namespace Considerations..............................4

2.3. Definition with Code Fragments........................5

2.3.1. Text Nodes..........................................5

2.3.2. Processing Instruction Nodes........................6

2.3.3. Attr Nodes..........................................6

2.3.4. Element Nodes.......................................7

2.3.5. Document Nodes......................................9

3. Discussion..............................................9

4. Security Considerations.................................9

References................................................10

Authors' Addresses........................................10

Full Copyright Statement..................................11

1. Introduction

The purpose of this document is to give a clear and unambiguous

definition of digest (hash) values of the XML objects [XML]. Two

subtrees are considered identical if their hash values are the same,

and different if their hash values are different.

There are at least two usage scenarios of DOMHASH. One is as a basis

for digital signatures for XML. Digital signature algorithms normally

require hashing a signed content before signing. DOMHASH provides a

concrete definition of the hash value calculation.

The other is to use DOMHASH when synchronizing two DOM structures

[DOM]. Suppose that a server program generates a DOM structure which

is to be rendered by clients. If the server makes frequent small

changes on a large DOM tree, it is desirable that only the modified

parts are sent over to the client. A client can initiate a request by

sending the root hash value of the structure in the cache memory. If

it matches with the root hash value of the current server structure,

nothing needs be sent. If not, then the server compares the clie...