𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The complexity of “long haul” data communication security

✍ Scribed by Belden Menkus

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
546 KB
Volume
9
Category
Article
ISSN
0167-4048

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of security
The complexity of security
✍ Jürgen Scheffran 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB
Secure virtual private networks: the fut
Secure virtual private networks: the future of data communications
✍ Eli Herscovitz 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 223 KB 👁 2 views

The Internet is an almost ideal means for information retrieval and exchange. It is cost-effective, easy to use and easily accessible. However, it can also be susceptible to devious practices such as data tempering, eavesdropping and theft. This paper analyses secure virtual private networks (VPNs)

The Communication Complexity of Pointer
The Communication Complexity of Pointer Chasing
✍ Stephen J. Ponzio; Jaikumar Radhakrishnan; S. Venkatesh 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 253 KB

We study the k-round two-party communication complexity of the pointer chasing problem for fixed k. C. Damm, S. Jukna and J. Sgall (1998, Comput. Complexity 7, 109 127) showed an upper bound of O(n log (k&1) n) for this problem. We prove a matching lower bound; this improves the lower bound of 0(n)