ArticleslgStudy

computer science

Secure Network Programming

Secure Network Programming is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Secure Network Programming rather than just read about it. In short: Secure Network Programming (SNP) is a prototype of the first Secure Sockets Layer, designed and built in 1993 by the Networking Research Laboratory at the University of Texas at Austin, led by Simon S. Lam.

Secure Network Programming — main illustration
Secure Network Programming — illustration

Key takeaways

  • Secure Network Programming belongs to computer science; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Secure Network Programming to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Secure Network Programming from memory before moving on to harder problems.

Reference excerpt

Secure Network Programming (SNP) is a prototype of the first Secure Sockets Layer, designed and built in 1993 by the Networking Research Laboratory at the University of Texas at Austin, led by Simon S. Lam.

History This work was published in the 1994 USENIX Summer Technical Conference. For this project, the authors won the 2004 ACM Software System Award. Simon S. Lam was inducted into the Internet Hall of Fame (2023) for "inventing secure sockets in 1991 and implementing the first secure sockets layer, named SNP, in 1993." This work began in 1991 as a theoretical investigation by Lam and Shankar on the formal meaning of a protocol layer satisfying an upper interface specification as a service provider and a lower interface specification as a service consumer. A case study of adding a security layer between the application layer and network layer was presented. Simon Lam wrote a proposal to the National Security Agency (NSA) in 1991 to investigate how to apply the theory of interfaces and modules to security verification. The proposal was funded from 6/28/1991 to 6/27/1993. At that time, there were three well-known authentication systems built (MIT's Kerberos) or being developed (DEC's SPX and IBM's KryptoKnight). All of these systems suffered from a common drawback; namely, they did not export a clean and easy-to-use interface that could be readily used by Internet applications. For example, it would take a tremendous amount of effort to "kerberize" an existing distributed application. Toward the goal of "secure network programming for the masses", the inventors of SNP conceived secure sockets as a high-level abstraction suitable for securing Internet applications. In 1993, they designed and built a prototype of SNP. Designed as an application sublayer on top of sockets, SNP provides a user interface closely resembling sockets. This resemblance was by design so that security could be retrofitted into existing socket programs with only minor modifications. Also, with such a sublayer carefully designed and its implementation thoroughly debugged, it can be easily used by any Internet application that uses sockets for end-to-end communications. This is a natural idea in hindsight but, in 1993, it was novel and a paradigm shift from mainstream network security research at that time. SNP was presented to their NSA manager in June 1993. SNP's secure sockets support both stream and datagram semantics with security guarantees (i.e., data origin authenticity, data destination authenticity, data integrity, and data confidentiality). The modular architecture and all of the key ideas and design choices in SNP were adopted in subsequent secure sockets layers, including: placing authenticated communication endpoints in the application layer, use of public-key cryptography for authentication, a handshake protocol for establishing session state including a shared secret, use of symmetric-key cryptography for data confidentiality, and managing contexts and credentials in the secure sockets layer. The paper presented on June 8, 1994, at the USENIX Summer Technical Conference includes the system design together with performance measurement results from the prototype implementation to clearly demonstrate the practicality of a secure sockets layer. SNP pioneered secure sockets for Internet applications in general, independently and concurrently with the design and development of the HTTP protocol for the world-wide web which was still in its infancy in 1993. Subsequent secure sockets layers (SSL by Netscape and TLS by IETF), implemented several years later using the modular architecture and key ideas first presented in SNP, enabled secure e-commerce between browsers and servers. The primary contributions of the later SSL and TLS were the inclusion of up-to-date and stronger cryptographic algorithms, redesign of the handshake protocol, and TLS's continual mitigation against known attacks. Today, many other Internet applications (including email) use HTTPS, which consists of HTTP running over a secure sockets layer.

References As of 2023-05-10, this article is derived in whole or in part from Networking Research Laboratory. The copyright holder has licensed the content in a manner that permits reuse under CC BY-SA 3.0 and GFDL. All relevant terms must be followed. The original text was at "A brief history of the first secure sockets layer"

Illustrations

Secure Network Programming: For inventing secure sockets in 1991 and implementing the first secure sockets layer, named SNP, in 1993.
For inventing secure sockets in 1991 and implementing the first secure sockets layer, named SNP, in 1993.

Worked examples

Example 1 — a first encounter with Secure Network Programming

Start with the simplest possible case. Write down what Secure Network Programming claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Secure Network Programming before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Secure Network Programming ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Secure Network Programming

In research
Secure Network Programming appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Secure Network Programming in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Secure Network Programming is common in secondary-school and first-year university syllabi. It links to neighbouring topics Internet security, Transport Layer Security, so understanding it makes those chapters shorter.
In everyday life
Look for Secure Network Programming outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Secure Network Programming” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Secure Network Programming in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Secure Network Programming means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Secure Network Programming out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Secure Network Programming in simple terms?

Secure Network Programming (SNP) is a prototype of the first Secure Sockets Layer, designed and built in 1993 by the Networking Research Laboratory at the University of Texas at Austin, led by Simon S. Lam.

Why does Secure Network Programming matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Secure Network Programming?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Secure Network Programming.

Tags

  • Internet security
  • Transport Layer Security

Keep exploring