Shared-key discovery Sample Clauses

Shared-key discovery. In this section, we describe the way how two nodes calculate their session key. ▇▇▇▇▇ who wants to establish a session key generates negotiatory keys and adapts them to expression ⑶. Then she encrypts coefficients of f A (x) with her secret key (KA) (i.e. EKA ( A0 ), EKA ( A1 ), ..., EKA ( Am−1 ) ) and broadcasts them to neighboring nodes. In reverse, when she receives a requesting message from the other side (i.e. ▇▇▇), she applies her negotiatory keys to expression ⑹ in order to generate a list of encrypted values (i.e. r f ' (s ), r f ' (s ), ..., r f ' (s ) ) and sends them to ▇▇▇. ▇▇▇ also