2 Problems

Posted by david

1 - How can you verify that the destination of a hyperlink is what the description claims?

2 - How can Alice give data to Bob and ensure that Bob does not give that data to Mallory?

Comments

Leave a response

  1. Josh Peters – April 08, 2008 @ 05:31 AM
    These are some interesting problems... A ring-o-trust should accomplish #1; a trusted source tells you that the description does or does not truthfully describe the destination. This of course carries its own (but hopefully by now well documented) problems. As for #2, that's pretty much what DRM is for. If you're giving sending bits to someone you cannot reasonably ensure they won't be copied: either 1-1 or "analog-holed." Face-to-face is the only way to "really" ensure that Bob cannot give away data to Mallory, but even then you've got to be able to trust Bob's ability to not just tell Mallory what he knows. I think a reasonable solution to #2 is to create some sort of time-sensitive ticket system; Bob can view said content (which can also be encrypted/DRMed as you please), but only for a limited time, after that Bob can no longer view the content. But I'm sure there's better ways to tackle both issues (hopefully especially #2).
  2. Josh Peters – April 08, 2008 @ 05:35 AM

    Sorry about the lack of formatting in the previous comment, didn't know your blog wouldn't auto-<p> my double-spaces.