article

10 Networking Papers: readings for protocol design

Author:

David WetherallAuthors Info & Claims

ACM SIGCOMM Computer Communication Review, Volume 36, Issue 3

Pages 77 - 78

https://doi.org/10.1145/1140086.1140096

Published: 05 July 2006 Publication History

Get Access

Abstract

No abstract available.

References

[1]

J. Bellardo and S. Savage. 802.11 denial-of-service attacks: Real vulnerabilities and practical solutions. In 12th USENIX Security Symposium, 2003.

Digital Library

Google Scholar

[2]

D. Bernstein. Syn cookies, 1997.

Google Scholar

[3]

N. Brownlee, k claffy, and E. Nemeth. DNS Measurements at a Root Server. In Globecom 2001, 2001.

Google Scholar

[4]

D. Brumley and D. Boneh. Remote Timing Attacks are Practical. In 12th USENIX Security Symposium, 2003.

Digital Library

Google Scholar

[5]

D. D. Clark. The design philosophy of the DARPA internet protocols. In SIGCOMM '88, Aug. 1988.

Digital Library

Google Scholar

[6]

D. D. Clark and D. L. Tennenhouse. Architectural considerations for a new generation of protocols. In SIGCOMM '90, 1990.

Digital Library

Google Scholar

[7]

C. Frangouli, J. Le Boudec, and J. Widmer. Network coding: An instant primer. CCR, 26(1), Jan 2006.

Digital Library

Google Scholar

[8]

D. Karger et al. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In STOC, May 1997.

Digital Library

Google Scholar

[9]

T. Kohno, A. Broido, and k.c. Claffy. Remote physical device fingerprinting. In IEEE Symposium on Security and Privacy, 2005.

Digital Library

Google Scholar

[10]

D. Kristol and L. Montulli. HTTP State Management Mechanism, Request For Comments 2965, 2000.

Digital Library

Google Scholar

[11]

B. W. Lampson. Hints for computer system design. In 9th SOSP, 1983.

Digital Library

Google Scholar

[12]

P. V. Mockapetris and K. J. Dunlap. Development of the domain name system. In SIGCOMM, 1988.

Digital Library

Google Scholar

[13]

P. Newman, G. Minshall, and T. L. Lyon. IP switching - ATM under IP. IEEE/ACM Transactions on Networking, 6(2):117--129, 1998.

Digital Library

Google Scholar

[14]

J. Postel. Transmission control protocol. Request for Comments 793, Sept. 1981.

Google Scholar

[15]

R. Prasad, M. Murray, C. Dovrolis, and K. Claffy. Bandwidth estimation: Metrics, measurement techniques and tools. IEEE Network, Nov/Dec 2003.

Digital Library

Google Scholar

[16]

J. H. Saltzer, D. P. Reed, and D. D. Clark. End-to-end arguments in system design. ACM Transactions on Computer Systems, 2(4):277--288, Nov. 1984.

Digital Library

Google Scholar

[17]

A. Wolman et al. On the scale and performance of cooperative web proxy caching. In 17th SOSP, 1999.

Digital Library

Google Scholar

Index Terms

10 Networking Papers: readings for protocol design
1. Networks
  1. Network architectures

Recommendations

A framework for practical universally composable zero-knowledge protocols
ASIACRYPT'11: Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security

Zero-knowledge proofs of knowledge (ZK-PoK) for discrete logarithms and related problems are indispensable for practical cryptographic protocols. Recently, Camenisch, Kiayias, and Yung provided a specification language (the CKY-language) for such ...
On the security of fair non-repudiation protocols
Special issue on SC 2003

We analyzed two non-repudiation protocols and found some new attacks on the fairness and termination property of these protocols. Our attacks are enabled by several inherent design weaknesses, which also apply to other non-repudiation protocols. To ...
Achieving Security Despite Compromise Using Zero-knowledge
CSF '09: Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium

One of the important challenges when designing and analyzing cryptographic protocols is the enforcement of security properties in the presence of compromised participants. This paper presents a general technique for strengthening cryptographic protocols ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGCOMM Computer Communication Review

ACM SIGCOMM Computer Communication Review Volume 36, Issue 3

July 2006

97 pages

ISSN:0146-4833

DOI:10.1145/1140086

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 July 2006

Published in SIGCOMM-CCR Volume 36, Issue 3

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
766
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)1

Reflects downloads up to 01 Mar 2025

Other Metrics

View Author Metrics

Citations

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Index Terms

Recommendations

A framework for practical universally composable zero-knowledge protocols

On the security of fair non-repudiation protocols

Achieving Security Despite Compromise Using Zero-knowledge

Comments

Information

Published In

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations