mirror of
https://code.briarproject.org/briar/briar.git
synced 2026-02-18 05:39:53 +01:00
Blog signature must cover the client ID
@@ -18,17 +18,17 @@ BSP uses a cryptographic hash function, H(m), with an output length of HASH_LEN
|
||||
|
||||
### Client identifiers
|
||||
|
||||
Each client has a unique identifier HASH_LEN bytes long:
|
||||
Each client has a unique random identifier HASH_LEN bytes long:
|
||||
|
||||
* `client_id = R(HASH_LEN)`
|
||||
|
||||
### Channel identifiers
|
||||
|
||||
Each channel has a unique identifier HASH_LEN bytes long, which is the hash of the client identifier and a client data structure describing the channel:
|
||||
Each channel has a unique identifier HASH_LEN bytes long. The identifier is calculated by hashing the client identifier and a data structure called the channel descriptor:
|
||||
|
||||
* `channel_id = HASH("CHANNEL_ID", client_id, client_data_structure)`
|
||||
* `channel_id = HASH("CHANNEL_ID", client_id, channel_descriptor)`
|
||||
|
||||
Including the client identifier in the hash prevents collisions between clients that use similar data structures.
|
||||
The channel descriptor is supplied by the client and is not interpreted by BSP. Including the client identifier in the hash prevents collisions between clients that use similar data structures for their descriptors.
|
||||
|
||||
### Message format
|
||||
|
||||
|
||||
Reference in New Issue
Block a user