Update of "Experiment: mmmv_mail_protocol_t1"
Not logged in

Artifact ID: 04a0124c167b89fa00cbdfde4ece0d7c677296f2
Page Name:Experiment: mmmv_mail_protocol_t1
Date: 2018-10-17 19:41:40
Original User: martin_vahi
Parent: 889727ec25e9a6c8277da918e611ed2b524e369c (diff)
Next f098917be93d2923ed3b00a897e8d13806f7fe0c

Currently the mmmv_mail_protocol_t1 lacks any code.


The Protocol

Users U_1 ...U_n form a complete graph G_u. Graph G_uu is like G_u, except that each G_u unidirected edge is replaced with 2 directed edges, one directed edge in each direction. Each of the G_uu directed edges, E_g_uu_k, k inSet(1 to ((n*(n-1)/2)*2=n*(n-1)) ) id est k inSet(1 to (n*(n-1)), represents a virtual mail moving channel.  The users U_1..U_n have symmetric cryptography based one-time keys for each E_g_uu_k. The one-time keys have a key specific probabilistically unique key_ID and they do NOT contain any user-IDs. Each user has a database(It might be an SQLite database)that pairs the key_IDs of that user with the E_g_uu_k-s that exit or enter that user at the G_uu.