{"version":"1.0","type":"link","title":"Dining cryptographers problem - Newikis","description":"In cryptography, the dining cryptographers problem studies how to perform a secure multi-party computation of the boolean-XOR function. David Chaum first proposed this problem in the early 1980s and used it as an illustrative example to show that it was possible to send anonymous messages with…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}