On 4/26/23 09:36, nix via agora-discussion wrote:
An alternative, non cryptographic (or maybe more accurately, cryptography by hand) solution:
There was further discussion of this solution. It's probably crackable with a normal table, which might be mitigated by padding the table with dummy info. However, that discussion also lead to what is a probably more perfect solution:
Nix and Janet agree on a letter for each player (nix is A, Janet is B, 4st is C, and so on). Again, how they do so does not matter.
Nix then generates a number 1 through N (where N is the number of different roles) for each letter. These numbers do not have to be unique. Nix sends the number, letter combo to 4st.
4st now has the letter/number combos. 4st assigns a role to each one by writing a list of the roles where the correct role is in the correct spot. So if A2 is meant to be MAFIA, the list could be [defender, mafia, other role, fourth role]. The order doesn't matter as long as the correct role is in the correct spot and the list contains all roles.
4st passes the letter and list combos to Janet and let's nix know e has done so. Nix sends out the numbers to the correct players, Janet sends out the lists to the correct players.
Nix knows which person got which number, but not the lists. Janet knows which person got which list, but not the numbers. 4st knows which number corresponds to which list, but not who got them.
-- nix Prime Minister, Herald
