670 |
that it overloads the P2P network used. This |
that it overloads the P2P network used. This |
671 |
a problem shared with other P2P applications. |
a problem shared with other P2P applications. |
672 |
|
|
673 |
|
While our system helps to keep documents alive after |
674 |
|
the original publisher has lost interest in them, it |
675 |
|
does not protect against a publisher that wants to make |
676 |
|
past versions inaccessible. By simply signing and publishing |
677 |
|
a large number of "fake" versions (e.g., files containing |
678 |
|
random data), a publisher could make correct past versions |
679 |
|
hard to access. |
680 |
|
|
681 |
An adversary may attempt to use an information hiding attack |
An adversary may attempt to use an information hiding attack |
682 |
against our system, |
against our system, |
683 |
withholding new versions of documents from clients, |
withholding new versions of documents from clients, |
695 |
One way to counter this problem is to use an anonymizing |
One way to counter this problem is to use an anonymizing |
696 |
P2P overlay. |
P2P overlay. |
697 |
|
|
|
While our system helps to keep documents alive after |
|
|
the original publisher has lost interest in them, it |
|
|
does not protect against a publisher that wants to make |
|
|
past versions inaccessible. By simply signing and publishing |
|
|
a large number of "fake" versions (e.g., files containing |
|
|
random data), a publisher could make correct past versions |
|
|
hard to access. |
|
|
|
|
698 |
In this paper, we have proposed to use pointer records as the versioning |
In this paper, we have proposed to use pointer records as the versioning |
699 |
mechanism for a location-independent Web. |
mechanism for a location-independent Web. |
700 |
We hope that by making links more permanent, this can make |
We hope that by making links more permanent, this can make |