Pseudonymous Broadcast and Secure Computation from Cryptographic Puzzles

@inproceedings{Katz2015PseudonymousBA,
  title={Pseudonymous Broadcast and Secure Computation from Cryptographic Puzzles},
  author={Jonathan Katz and Andrew K. Miller and Elaine Shi},
  year={2015}
}
In standard models of secure computation, point-to-point channels between parties are assumed to be authenticated by some pre-existing means. In other cases, even stronger pre-existing setup—e.g., a public-key infrastructure (PKI)—is assumed. These assumptions are too strong for open, peer-to-peer networks, where parties do not necessarily have any prior relationships and can come and go as they please. Nevertheless, these assumptions are made due to the prevailing belief that nothing… CONTINUE READING

Similar Papers

Loading similar papers…