OUR PROPOSED SCHEME Sample Clauses
The "OUR PROPOSED SCHEME" clause outlines the specific plan, arrangement, or methodology that a party is putting forward for consideration or implementation within the agreement. Typically, this clause details the key features, steps, or components of the proposed scheme, such as timelines, deliverables, or processes to be followed. Its core practical function is to clearly communicate the party's intended approach, ensuring all parties have a mutual understanding of what is being proposed and serving as a reference point for evaluating or negotiating the terms of the agreement.
OUR PROPOSED SCHEME. In this section we describe our Authenticated Key Agreement (AKA) protocol. In our protocol, there are two entities, the user’s smart card and the server. The proposed protocol consists of four phases: system setup phase, registration phase, authentication phase, and password changing phase. The procedure of the protocol is described in details as follows:
OUR PROPOSED SCHEME. In this section, our proposed scheme is described in de- tail containing four phases: initialization phase; registration phase; authentication and key agreement phase; password changing phase. The notations used in our scheme are summarized as follows: Ui: One of the legal users to communicate with the server.
OUR PROPOSED SCHEME. In this section we describe our two pass key agreement protocol (KAP) between two entities A and B, and consider its security. to guess a or b from ab. We assume that n is even, and denote by LBn (resp.UBn) the subgroup of Bn generated by a1 … . an–1 , i.e., braids where the n/2 lower strands only are braided ( resp. in the subgroup generated by an+1 … . an–1). We know that every element in LBn commutes with every element in UBn . Bn is finite and non-commutative, so problem on braid group are non trivial. R : SÆ1 (V), SÆ2 (V) C LBn Se (V)R Se (V) = XÆ Æ1 Æ2 SB (W), SB (W) C UB n Se (W)R Se (W) = XB Ue (V), Ue (V) C LBn B1 B2 Ze (W), Ze (W) C UB Æ1 Æ2 : : : : : : : : sufficiently complicated braid group V= IDÆ║R W=IDB║R Aus long term private key pair Aus long term public key Bus long term private key pair Bus long term public key Ue (V)R Ue (V) = YÆ Æ1 Æ2 Se (V)Xb Se (V) B1 B2 n Ze (W)R Ze (W) = YB B1 B2 Æ1 Æ2 KÆ Se (W)Xa Se (W) Ke(YB)Ke = KeZe (W)R Ze (W)Ke B1 B2 Ue (V) 魔–e Ze (W)R Ze (W)K–eUe (V) : ▇ ▇ ▇ ▇▇ ▇▇ ▇ : Æ1 Æ B1 B2 Æ Æ2 Ze (W)Ue (V)R Ue (V)Ze (W) = K ▇▇ ▇▇ Æ2 B2 KB YB Key YÆ : strong one — way hash function