Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 358

The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.

The Secure Sockets Layer (SSL) Protocol Version 3.0

Freier, A., Karlton, P., Kocher, P. · 2011

Abstract

of the SSL 3.0 protocol.The original Abstract follows.This document specifies version 3.0 of the Secure Sockets Layer (SSL 3.0) protocol, a security protocol that provides communications privacy over the Internet.The protocol allows client/server applications to communicate in a way that is designed to prevent eavesdropping, tampering, or message forgery. ForewordAlthough the SSL 3.0 protocol is a widely implemented protocol, a pioneer in secure communications protocols, and the basis for Transport Layer Security (TLS), it was never formally published by the IETF, except in several expired Internet-Drafts.This allowed no easy referencing to the protocol.We believe a stable reference to the original document should exist and for that reason, this document describes what is known as the last published version of the SSL 3.0 protocol, that is, the November 18, 1996, version of the protocol.There were no changes to the original document other than trivial editorial changes and the addition of a "Security Considerations" section.However, portions of the original document that no longer apply were not included.Such as the "Patent Statement" section, the "Reserved Ports Assignment" section, and the cipher-suite registrator note in the "The CipherSuite" section.The "US export rules" discussed in the document do not apply today but are kept intact to provide context for decisions taken in protocol design.The "Goals of This Document" section indicates the goals for adopters of SSL 3.0, not goals of the IETF.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.17487/rfc6101

Cites

11 of 11 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 11 references

Cited by

Metadata

Authors
Freier, A., Karlton, P., & Kocher, P.
Publisher
RFC Editor
Published
2011-08
OpenAlex
W2238866705
Cited by
358
References
11
Type
report
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.