From dix-bounces@ietf.org Mon Jun 11 23:00:28 2007 Return-path: Received: from [127.0.0.1] (helo=stiedprmman1.va.neustar.com) by megatron.ietf.org with esmtp (Exim 4.43) id 1HxwcM-0002nS-26; Mon, 11 Jun 2007 23:00:26 -0400 Received: from [10.91.34.44] (helo=ietf-mx.ietf.org) by megatron.ietf.org with esmtp (Exim 4.43) id 1HxwcK-0002mr-Nj for dix@ietf.org; Mon, 11 Jun 2007 23:00:24 -0400 Received: from kuber.nabble.com ([216.139.236.158]) by ietf-mx.ietf.org with esmtp (Exim 4.43) id 1HxwcJ-0005Mn-1N for dix@ietf.org; Mon, 11 Jun 2007 23:00:24 -0400 Received: from isper.nabble.com ([192.168.236.156]) by kuber.nabble.com with esmtp (Exim 4.63) (envelope-from ) id 1HxwcI-00036T-Ro for dix@ietf.org; Mon, 11 Jun 2007 20:00:22 -0700 Message-ID: <11071595.post@talk.nabble.com> Date: Mon, 11 Jun 2007 18:30:10 -0700 (PDT) From: tianxama To: dix@ietf.org MIME-Version: 1.0 X-Nabble-From: tianxama@gmail.com X-Spam-Score: 0.5 (/) X-Scan-Signature: b4c10eaa27436d806c79842272125a2a Subject: [dix] identification semantics algorithm X-BeenThere: dix@ietf.org X-Mailman-Version: 2.1.5 Precedence: list Reply-To: Digital Identity Exchange List-Id: Digital Identity Exchange List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Content-Type: multipart/mixed; boundary="===============0747556199==" Errors-To: dix-bounces@ietf.org --===============0747556199== Content-Type: multipart/alternative; boundary="----=_Part_46037_20374716.1181617222856" ------=_Part_46037_20374716.1181617222856 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: quoted-printable http://www.simetris.com.ar http://www.simetris.com.ar=20 =09Part-Whole relationships. Part(s) describing surronding Whole. The idea is to develop kind of data structure, with parts nested compoundin= g a whole, and the inner parts of the structure knows, in reverse order, the containing tree of elements or structure surrounding it. 1: Definitions: superPart: Part containing one or more parts. part: Inside a superPart. Can contain subParts. subPart: Inner unit inside a part. NID: Nesting level ID (deep level entities are in a nested/tree structure) =20 XML Example: =20 <superPart NID=3D"0"> <part NID=3D"1"> <subPart NID=3D"2"> </part> <!-- end NID 1 --> </superPart> <!-- end NID 0 --> SeqID: Sequence ID (symbol sequencing and identification) =20 =20 Symbols sequencing and identification begins with first occurrence of a symbol in a structure, begining with 0, next symbol is tagged with 1. If next symbol appeared before, then the tag used before to identify it is used. =20 OccID: Occurrence ID =20 Times element appeared in a sequence. First time same element occurs is 0, then 1, etc. =20 CID: Count ID (0, 1, 2, ...) =20 Sequential count, begining with 0, of elements in determinate context (Nesting level, Sequence, etc.) =20 MvtID: Movement ID =20 Signals start (S), inside (I), outside (O) or end (E) movement in a statement chain. =20 2. Example: =20 Linear Form: ( superPart ( part ( ( superPart ) ( subPart ( part ( superPart ) ) ) ) ) NID: 0 1 2 2 3 4 SeqID: 0 1 0 2 1 0 OccID: 0 0 1 0 1 2 CID: 0 1 2 3 4 5 MvtID: S I O I O E =20 XML Example: <superPart NID=3D"0"> <part NID=3D"1"> <superPart NID=3D"2"/> <subPart NID=3D"2"> <part NID=3D"3"> </superPart NID=3D"4"> </part> </subPart> </part> </superPart> =20 Another Example: ( head ( face ( ( head ) ( eyes ( face ( head ) ) ) ) ) NID: 0 1 2 2 3 4 SeqID: 0 1 0 2 1 0 OccID: 0 0 1 0 1 2 CID: 0 1 2 3 4 5 MvtID: S I O I O E 3. Composite IDs: Combining CID, NID, SeqID and OccID, other IDs for easier retrieval of elements in statement can be achieved. For example: NID + OccID =3D CID (Count of elements inside a specific nesti= ng level) ( head ( face ( ( head ) ( eyes ( face ( head ) ) ) ) ) NID: 0 1 2 2 3 4 SeqID: 0 1 0 2 1 0 OccID: 0 0 1 0 1 2 CID: 0 1 2 3 4 5 OrderID: (0.0) (1.0) (2.0) (2.1) (3.0) (4.0) 4. Terms (Parts) Relationships and Roles: In specific context of container part, another part plays a role or functio= n in the context of container part. This is the semantics of the containment relationship, for example: John, inside a specific Team, is a player, more specificaly, a goalkeeper. Parsing Example: [previousElement]:[role/type] =3D> [actualElement]:[role/type] =3D> [nextElement]:[role/type] 5. Measurement units: superUnit (eg.: Kilometer) unit (eg.: Meter) subUnit (eg.: Centimeter) Ratio: superUnit (1) =3D> unit (1/n) =3D> subUnit (1/n : n) =09In a specific Context which contains Type(s) of entities, one Entity playing a specific Role (which are part of a Type definition) have one and only Identifier which determines its identity. =09Context :=3D [Type]* =09Type :=3D [Role]* =09Role :=3D [Entity]* =09Entity :=3D [PlayerType] [ActorType] =3D> (Identity) =09PlayerType :=3D 'sender' | receiver =09ActorType :=3D 'active' | 'pasive' =09In a Dialog made of Statement(s) which are compound with Term(s), the Identity =09of a Player/Actor determines which Role the entity plays, determined wit= h it's Type interactions/operations =09(Message*). [ Research > > Algorithms ]=20 ENGLISH: Symbols sequencing/identification (stream):=20 1. Map sucesive symbols with numbers (starting at 0)=20 2. Symbol repeated, use the identifier used the first time the simbol appeared=20 3. After a repeated symbol, continue with id sequence if next symbol is new, use last otherwise=20 4. Apply recursively from contained symbol structures to containers (letter / word ; word / sentence)=20 Example:=20 String: ASDFAEIOUS Encoding: 0123045671 Part-Whole Composition Rules: ---------------------------- 1. Letter - Word =3D SINTAX 2. Word - Statement =3D GRAMMAR SINTAX- META-MODEL GRAMMAR - MODEL One level sintax is next level grammar. Symbol sequencing: 1. Rules by symbols order of occurence 2. ALPHABET Construction (META-MODEL) 3. DICTIONARY Construction (MODEL) SPANISH: Secuenciamiento Simbolos cadena/stream (Algoritmo): 1. Identificar simbolos con secuencia num=C3=A9rica (comenzando desde 0) 2. Al repetirse simbolo, repetir identificador previamente usado 3. Luego de repetirse simbolo, si el simbolo subsiguiente es nuevo, utilizar identificador siguiente en secuencia 4. Aplicar identificacion simbolos recursivamente (ej.: letras > palabras > oraciones) Ejemplo: Cadena: ASDFAEIOUS Encoding: 0123045671 Reglas de composici=C3=B3n Parte-Todo: -------------------------------- 1. Letra - Palabra =3D SINTAXIS 2. Palabra - Oraci=C3=B3n =3D GRAMATICA SINTAXIS- META-MODELO GRAMATICA - MODELO Recursividad: La sintaxis de un nivel es la gramatica del nivel subsiguiente. Secuenciamiento de s=C3=ADmbolos: 1. Reglas segun orden de aparicion simbolos. 2. Construccion de ALFABETO (META-MODELO) 3. Construccion de DICCIONARIO (MODELO) --=20 View this message in context: http://www.nabble.com/identification-semantic= s-algorithm-tf3904987.html#a11071595 Sent from the IETF - dix mailing list archive at Nabble.com. ------=_Part_46037_20374716.1181617222856 Content-Type: text/html; charset=UTF-8 Content-Transfer-Encoding: quoted-printable htt= p://www.simetris.com.ar

=09Part-Whole relationships. Part(s) describing surronding Whole.

The idea is to develop kind of data structure, with parts nested compoundin= g a whole, and the inner parts of the structure knows, in reverse order, the containing tree of elem= ents or structure surrounding it.

1: Definitions:

  1. superPart: Part containing one or more parts.
  2. part: Inside a superPart. Can contain subParts.
  3. subPart: Inner unit inside a part.
  4. NID: Nesting level ID (deep level entities are in a nested/tree = structure)

    XML Example: 

       <superPart NID=3D"0">
     <part NID=3D"1">
       <subPart NID=3D"2">
     </part> <!-- end NID 1 -->
   </superPart> <!-- end NID 0 -->
  5. SeqID: Sequence ID (symbol sequencing and identification)

    =20 Symbols sequencing and identification begins with first occurrence of a = symbol in a structure, begining with 0, next symbol is tagged with 1. If next symb= ol appeared before, then the tag used before to identify it is used.

  6. OccID: Occurrence ID

    Times element appeared in a sequence. First time same element occurs is = 0, then 1, etc.

  7. CID: Count ID (0, 1, 2, ...)

    Sequential count, begining with 0, of elements in determinate context (N= esting level, Sequence, etc.)

  8. MvtID: Movement ID

    Signals start (S), inside (I), outside (O) or end (E) movement in a stat= ement chain.

2. Example:

  • Linear Form:

        ( superPart ( part ( ( superPart ) ( subPart ( part ( superPart ) )=
 ) ) )

NID:         0         1           2            2        3        4

SeqID:       0         1           0            2        1        0

OccID:       0         0           1            0        1        2

CID:         0         1           2            3        4        5

MvtID:       S         I           O            I        O        E
  • XML Example:

<superPart NID=3D"0">
  <part NID=3D"1">
    <superPart NID=3D"2"/>
    <subPart NID=3D"2">
      <part NID=3D"3">
        </superPart NID=3D"4">
      </part>
    </subPart>
  </part>
</superPart>
  • Another Example:

        ( head ( face ( ( head ) ( eyes ( face ( head ) ) ) ) )

NID:        0      1        2        2      3      4

SeqID:      0      1        0        2      1      0

OccID:      0      0        1        0      1      2

CID:        0      1        2        3      4      5

MvtID:      S      I        O        I      O      E

3. Composite IDs:

Combining CID, NID, SeqID and OccID, other IDs for easier retrieval of elem= ents in statement can be achieved.

For example: NID + OccID =3D CID (Count of elements inside a specific nesti= ng level) 


        ( head ( face ( ( head ) ( eyes ( face ( head ) ) ) ) )

NID:        0      1        2        2      3      4

SeqID:      0      1        0        2      1      0

OccID:      0      0        1        0      1      2

CID:        0      1        2        3      4      5

OrderID:  (0.0)  (1.0)    (2.0)    (2.1)  (3.0)  (4.0)

4. Terms (Parts) Relationships and Roles:

In specific context of container part, another part plays a role or functio= n in the context of container part. This is the semantics of the containment relationship, for = example: John, inside a specific Team, is a player, more specificaly, a goalkeeper.

Parsing Example: 

[previousElement]:[role/type] =3D> [actualElement]:[role/type] =3D> [nextEl=
ement]:[role/type]

5. Measurement units: 


superUnit (eg.: Kilometer)
unit (eg.: Meter)
subUnit (eg.: Centimeter)

Ratio:

superUnit (1) =3D> unit (1/n) =3D> subUnit (1/n : n)

=09In a specific Context which contains Type(s) of= entities, one Entity playing a specific Role (which are part of a Type d= efinition) have one and only Identifier which determines its identity. 

=09Context :=3D [Type]*
=09Type :=3D [Role]*
=09Role :=3D [Entity]*
=09Entity :=3D [PlayerType] [ActorType] =3D> (Identity)
=09PlayerType :=3D 'sender' | receiver
=09ActorType :=3D 'active' | 'pasive'

=09In a Dialog made of Statement(s) which are com= pound with Term(s), the Identity =09of a Player/Actor determines which Role the entity plays, d= etermined with it's Type interactions/operations =09(Message*).

[ Research > > Algorithms ] 

ENGLISH:

Symbols sequencing/identification (stream):=20

1. Map sucesive symbols with numbers
   (starting at 0)=20
2. Symbol repeated, use the identifier used the first
   time the simbol appeared=20
3. After a repeated symbol, continue with id sequence
   if next symbol is new, use last otherwise=20
4. Apply recursively from contained symbol structures
   to containers (letter / word ; word / sentence)=20

Example:=20

String: ASDFAEIOUS
Encoding: 0123045671

Part-Whole Composition Rules:
----------------------------

1. Letter - Word =3D SINTAX
2. Word - Statement =3D GRAMMAR

SINTAX- META-MODEL
GRAMMAR - MODEL

One level sintax is next level grammar.

Symbol sequencing:
1. Rules by symbols order of occurence
2. ALPHABET Construction (META-MODEL)
3. DICTIONARY Construction (MODEL)

SPANISH:

Secuenciamiento Simbolos cadena/stream (Algoritmo):

1. Identificar simbolos con secuencia num=C3=A9rica (comenzando desde 0)
2. Al repetirse simbolo, repetir identificador previamente usado
3. Luego de repetirse simbolo, si el simbolo subsiguiente es nuevo,
   utilizar identificador siguiente en secuencia
4. Aplicar identificacion simbolos recursivamente
   (ej.: letras > palabras > oraciones)

Ejemplo:

Cadena: ASDFAEIOUS
Encoding: 0123045671

Reglas de composici=C3=B3n Parte-Todo:
--------------------------------

1. Letra - Palabra =3D SINTAXIS
2. Palabra - Oraci=C3=B3n =3D GRAMATICA

SINTAXIS- META-MODELO
GRAMATICA - MODELO

Recursividad:
La sintaxis de un nivel es la gramatica del nivel subsiguiente.

Secuenciamiento de s=C3=ADmbolos:
1. Reglas segun orden de aparicion simbolos.
2. Construccion de ALFABETO (META-MODELO)
3. Construccion de DICCIONARIO (MODELO)

View this message in context: identification semantics a= lgorithm
Sent from the IETF= - dix mailing list archive at Nabble.com.
------=_Part_46037_20374716.1181617222856-- --===============0747556199== Content-Type: text/plain; charset="us-ascii" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit Content-Disposition: inline _______________________________________________ dix mailing list dix@ietf.org https://www1.ietf.org/mailman/listinfo/dix --===============0747556199==-- From dix-bounces@ietf.org Wed Jun 20 10:28:28 2007 Return-path: Received: from [127.0.0.1] (helo=stiedprmman1.va.neustar.com) by megatron.ietf.org with esmtp (Exim 4.43) id 1I11AY-0001p6-P4; Wed, 20 Jun 2007 10:28:26 -0400 Received: from [10.91.34.44] (helo=ietf-mx.ietf.org) by megatron.ietf.org with esmtp (Exim 4.43) id 1I11AY-0001oy-4O for dix@ietf.org; Wed, 20 Jun 2007 10:28:26 -0400 Received: from smtp.senderpays.com ([208.185.247.233] helo=srve-v64.srve.com) by ietf-mx.ietf.org with esmtp (Exim 4.43) id 1I11AW-0002Zl-Mx for dix@ietf.org; Wed, 20 Jun 2007 10:28:26 -0400 Received: from localhost (www.hunneypocketed.emsvr.com [203.206.137.129] (may be forged)) (authenticated bits=0) by srve-v64.srve.com (8.13.8/8.13.8/CWT/DCE) with ESMTP id l5KESLi1026198 (version=TLSv1/SSLv3 cipher=AES256-SHA bits=256 verify=NO) for ; Wed, 20 Jun 2007 14:28:24 GMT Date: Thu, 21 Jun 2007 00:28:24 +1000 From: Chris Drake X-Priority: 3 (Normal) Message-ID: <726356053.20070621002824@pobox.com> To: Digital Identity Exchange Subject: Re[2]: [dix] Agenda bashing In-Reply-To: <44ACA9CF.7090605@cisco.com> References: <20060703172550.A182A222425@laser.networkresonance.com> <44A973DC.9040801@cisco.com> <86zmfqa0au.fsf@raman.networkresonance.com> <8C86E9E37E4BD3C-1288-2A5B@FWM-D05.sysops.aol.com> <44ACA9CF.7090605@cisco.com> MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Spam-Score: 1.2 (+) X-Scan-Signature: f4c2cf0bccc868e4cc88dace71fb3f44 X-BeenThere: dix@ietf.org X-Mailman-Version: 2.1.5 Precedence: list Reply-To: Digital Identity Exchange List-Id: Digital Identity Exchange List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Errors-To: dix-bounces@ietf.org Hi Eliot, It's actually possible to get your secure opaque channel without smart cards. Merely some nifty graphics, HTML, and shared secrets (traditional meaning) are one implementation, while non-smart tokens are another (eg: printed or electronic tokens) Servers can't communicate "securely" unless something is able to "authenticate" the *server* before it is allowed to authenticate the user. Smart cards and PwdHash don't/can't do this, at least not without extra hardware at the client, which almost nobody has of course. Kind Regards, Chris Drake Thursday, July 6, 2006, 4:12:31 PM, you wrote: EL> thayes0993@aol.com wrote: >> I believe that PwdHash does rely on a certain level of proof of the >> server's identity. The browser needs to decide that >> the domain name that the server is presenting actually belongs to it. >> This is usually done by relying on SSL/TLS. >> If the false server can convince the browser that it is in fact the >> targeted domain, then the browser will happily >> transmit the full credential (H(password, domain)) to the server. >> >> PwdHash does NOT require that the proved domain match anything the >> user has in mind. That is, the identity >> does not need to be presented to the user, or compared against >> anything the user is doing. This seems to be the >> primary problem in phishing attacks (the last foot). That's where the >> real advantage of techniques like PwdHash are. EL> Pretty neat. There are two problems that still really need to be EL> addressed. The first is that you need to manage a transition. It must EL> be clearly visible to the user when PwdHash is used and when it is not. EL> Otherwise someone just phishes the original password and that's the ball EL> game. EL> Second, PwdHash still relies on the underlying security of the user's EL> computer. I don't know about you but that is a goal I would like to EL> address. I want a means to have a secure opaque channel of EL> communication between the server and the smart card. That's what I'm EL> looking for from the IETF. EL> Eliot EL> _______________________________________________ EL> dix mailing list EL> dix@ietf.org EL> https://www1.ietf.org/mailman/listinfo/dix _______________________________________________ dix mailing list dix@ietf.org https://www1.ietf.org/mailman/listinfo/dix From dix-bounces@ietf.org Fri Jun 22 20:20:30 2007 Return-path: Received: from [127.0.0.1] (helo=stiedprmman1.va.neustar.com) by megatron.ietf.org with esmtp (Exim 4.43) id 1I1tMb-0007wn-5S; Fri, 22 Jun 2007 20:20:29 -0400 Received: from [10.91.34.44] (helo=ietf-mx.ietf.org) by megatron.ietf.org with esmtp (Exim 4.43) id 1I1tMZ-0007wi-3l for dix@ietf.org; Fri, 22 Jun 2007 20:20:27 -0400 Received: from kuber.nabble.com ([216.139.236.158]) by ietf-mx.ietf.org with esmtp (Exim 4.43) id 1I1tMW-0001iz-RY for dix@ietf.org; Fri, 22 Jun 2007 20:20:27 -0400 Received: from isper.nabble.com ([192.168.236.156]) by kuber.nabble.com with esmtp (Exim 4.63) (envelope-from ) id 1I1tMW-0002dK-AR for dix@ietf.org; Fri, 22 Jun 2007 17:20:24 -0700 Message-ID: <11262055.post@talk.nabble.com> Date: Fri, 22 Jun 2007 17:20:24 -0700 (PDT) From: tianxama To: dix@ietf.org MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: quoted-printable X-Nabble-From: tianxama@gmail.com X-Spam-Score: 0.0 (/) X-Scan-Signature: e5ba305d0e64821bf3d8bc5d3bb07228 Subject: [dix] Algorithm X-BeenThere: dix@ietf.org X-Mailman-Version: 2.1.5 Precedence: list Reply-To: Digital Identity Exchange List-Id: Digital Identity Exchange List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Errors-To: dix-bounces@ietf.org Hi, Is this yet discovered? : =20 1. Given a "potential value" of a given number made of digits, wich is the reduction to one digit by succesive sum of its digits. 2. This value repeats in an interval (-(base-1)) - 0 - (base-1) 3. Let's call "weight" of a digit in the expression: (base pow positionDigit) * digit 4. Assigning identifiers, given the case, in a specific interval it happens that: a. Given three nodes, left, right and parent with respective identifiers. b. Maybe func(potentialValue(leftNodeID), potentialValue(rightNodeID)) =3D= =3D func(potentialValue(parentNodeID)) It's just an idea to develop how in a graph, reduced to a binary tree, one can, for example, calculate regarding only in node identifiers, if two node= s are interconnected and in how many and which type of leaps. Regards, --=20 [first: sebasti=C3=A1n] [last: samaruga] [email: tianxama@gmail.com]=20 [url: http://www.simetris.com.ar] =20 --=20 View this message in context: http://www.nabble.com/Algorithm-tf3967603.htm= l#a11262055 Sent from the IETF - dix mailing list archive at Nabble.com. _______________________________________________ dix mailing list dix@ietf.org https://www1.ietf.org/mailman/listinfo/dix