In interpersonal messaging end-to-end encryption means for public key distribution and verification of its authenticity are needed; the latter to prevent man-in-the-middle (MITM) attacks.
+
This document proposes a new method to easily verify a public key is authentic by a Handshake process that allows users to easily authenticate their communication channel. The new method is targeted to Opportunistic Security scenarios and is already implemented in several applications of pretty Easy privacy (pEp).
This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79.
+
Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet-Drafts is at https://datatracker.ietf.org/drafts/current/.
+
Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress."
Copyright (c) 2020 IETF Trust and the persons identified as the document authors. All rights reserved.
+
This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (https://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Code Components extracted from this document must include Simplified BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Simplified BSD License.
In interpersonal messaging end-to-end encryption means for public key distribution and verification of its authenticity are needed.
+
Examples for key distribution include:
+
+
+
+
Exchange public keys out-of-band before encrypted communication
+
Use of centralized public key stores (e.g., OpenPGP Key Servers)
+
Ship public keys in-band when communicating
+
+
To prevent man-in-the-middle (MITM) attacks, additionally the authenticity of a public key needs to be verified. Methods to authenticate public keys of peers include, e.g., to verify digital signatures of public keys (which may be signed in a hierarchical or flat manner, e.g., by a Web of Trust (WoT)), to compare the public key’s fingerprints via a suitable independent channel, or to scan a QR mapping of the fingerprint (cf. Section 2).
+
This document proposes a new method to verify the authenticity of public keys by a Handshake process that allows users to easily verify their communication channel. Fingerprints of the involved peers are combined and mapped to (common) Trustwords [I-D.birk-pep-trustwords]. The successful manual comparison of these Trustwords is used to consider the communication channel as trusted.
+
The proposed method is already implemented and used in applications of pretty Easy privacy (pEp) [I-D.birk-pep]. This document is targeted to applications based on the pEp framework and Opportunistic Security [RFC7435]. However, it may be also used in other applications as suitable.
+
Note: The pEp framework [I-D.birk-pep] proposes to automatize the use of end-to-end encryption for Internet users of email and other messaging applications and introduces methods to easily allow authentication.
The key words “MUST”, “MUST NOT”, “REQUIRED”, “SHALL”, “SHALL NOT”, “SHOULD”, “SHOULD NOT”, “RECOMMENDED”, “MAY”, and “OPTIONAL” in this document are to be interpreted as described in [RFC2119].
The following terms are defined for the scope of this document:
+
+
+
Trustwords: A scalar-to-word representation of 16-bit numbers (0 to 65535) to natural language words. When doing a Handshake, peers are shown combined Trustwords of both public keys involved to ease the comparison. [I-D.birk-pep-trustwords]
+
+
+
+
Trust On First Use (TOFU): cf. [RFC7435], which states: “In a protocol, TOFU calls for accepting and storing a public key or credential associated with an asserted identity, without authenticating that assertion. Subsequent communication that is authenticated using the cached key or credential is secure against an MiTM attack, if such an attack did not succeed during the vulnerable initial communication.”
+
+
+
Man-in-the-middle (MITM) attack: cf. [RFC4949], which states: “A form of active wiretapping attack in which the attacker intercepts and selectively modifies communicated data to masquerade as one or more of the entities involved in a communication association.”
To secure a communication channel, in public key cryptography each involved peer needs a key pair. Its public key needs to be shared to other peers by some means. However, the key obtained by the receiver may have been substituted or tampered with to allow for re-encryption attacks. To prevent such man-in-the-middle (MITM) attacks, an important step is to verify the authenticity of a public key obtained.
Such a verification process is useful in at least two scenarios:
+
+
+
+
Verify channels to peers, e.g., to make sure opportunistically exchanged keys for end-to-end encryption are authentic.
+
Verify channels between own devices (in multi-device contexts), e.g., for the purpose of importing and synchronizing keys among different devices belonging to the same user (cf. [I-D.pep-keysync]). This scenario is comparable to Bluetooth pairing before starting data transfers.
Current methods to authenticate public keys of peers include:
+
+
+
+
Digitally signed public keys are verified by a chain of trust. Two trust models are common in today’s implementations.
+
Signing is carried out hierarchically, e.g. in a Public Key Infrastructure (PKI) [RFC5280], in which case the verification is based on a chain of trust with a Trust Anchor (TA) at the root.
+
Signing of public keys is done in a flat manner (by a Web of Trust), e.g., key signing in OpenPGP [RFC4880], where users sign the public keys of other users. Verification may be based on transitive trust.
+
+
+
Peers are expected to directly compare the public key’s fingerprints by any suitable independent channel – e.g, by phone or with a face-to-face meeting. This method is often used in OpenPGP [RFC4880] contexts.
+
The public keys’ fingerprints are mapped into a QR code, which is expected to be scanned between the peers when they happen to meet face-to-face. This method is, e.g., used in the chat application Threema [threema].
+
The public keys’ fingerprints are mapped into numerical codes which decimal digits only (so-called “safety numbers”), which makes the strings the humans need to compare easier in respect to hexacodes, but longer and thus nevertheless cumbersome. This method is e.g. used in the chat application Signal [signal].
None of the existing solutions meets all requirements set up by pEp [I-D.birk-pep], e.g.:
+
+
+
+
Easy solution that can be handled easily by ordinary users
+
In case privacy and security contradict each other, privacy is always preferred over security (e.g., the Web of Trust contradicts privacy)
+
No central entities
+
+
Most of today’s systems lack easy ways for users to authenticate their communication channel. Some methods leak private data (e.g., their social graph) or depend on central entities. Thus, none of today’s systems fulfills all of the pEp requirements (cf. above).
In pretty Easy privacy (pEp), the proposed approach for peers to authenticate each other is to engage in the pEp Handshake.
+
In current pEp implementations (cf. Section 7.2), the same kinds of keys as in OpenPGP are used. Such keys include a fingerprint as cryptographic hash over the public key. This fingerprint is normally represented in a hexadecimal form, consisting of ten 4-digit hexadecimal blocks, e.g.:
+
+
+
8E31 EF52 1D47 5183 3E9D EADC 0FFE E7A5 7E5B AD19
+
Each block may also be represented in decimal numbers from 0 to 65535 or in other numerical forms, e.g.
In the pEp Handshake the fingerprints of any two peers involved are combined and displayed in form of Trustwords [I-D.birk-pep-trustwords] for easy comparison by the involved parties.
+
The default verification process involves three steps:
+
+
+
+
Combining fingerprints by XOR function
Any two peers’ fingerprints are combined bit-by-bit using the Exclusive-OR (XOR) function resulting in the Combined Fingerprint (CFP).
+
Mapping result to Trustwords:
The CFP is then mapped to 16-bit Trustwords (i.e., every 4-digit hexadecimal block is mapped to a given Trustword) resulting in the Trustword Mapping (TWM).
+
Verify Trustwords over independent channel
The resulting Trustwords (TWM) are compared and verified over an independent channel, e.g., a phone line. If this step was successful, the channel can be marked as authenticated.
+
+
Note: In prior implementations of pEp the fingerprints of any two peers were concatenated. While this has the advantage that the own identity’s Trustwords can be printed on a business card (like with fingerprints) or on contact sites or in signature texts of emails, this at the same time has the drawback that users might not carefully compare the words as they start to remember and recognize their Trustwords in the concatenated mapping. The avoid this undesired training effect, Trustwords for any peer-to-peer combination shall (very likely) differ.
The more an ordinary user needs to contribute to a process, the less likely a user will carry out all steps carefully. In particular, it was observed that a simple (manual) comparison of OpenPGP fingerprints is rarely carried out to the full extent, i.e., mostly only parts of the fingerprint are compared, if at all.
+
For usability reasons and to create incentives for people to actually carry out a Handshake (while maintaining an certain level of entropy), pEp allows for different entropy levels, i.e.:
+
+
+
+
Full Trustword Mapping (F-TWM) MUST represent the maximum entropy achievable by the mapping. This means all Trustwords of a TWM MUST be displayed and compared.
E.g., the fingerprint
F482 E952 2F48 618B 01BC 31DC 5428 D7FA ACDC 3F13
+
is mapped to
+
dog house brother town fat bath school banana kite task
+
+
Long Trustword Mapping (L-TWM) requires a number of Trustwords that MUST retain at least 128 bits of entropy. Thus, L-TWM results into at least eight Trustwords to be compared by the user.
dog house brother town fat bath school banana kite [ remaining Trustword(s) omitted ]
+
+
Short Trustword Mapping (S-TWM) requires a number of Trustwords that MUST retain at least 64 bits of entropy. Thus, S-TWM results into at least four Trustwords to be compared by the user.
The pEp Handshake has three display modes for the verification process. All of the following modes MUST be implemented:
+
+
+
+
S-TWM mode (default)
By default the S-TWM SHOULD be displayed to the user for comparison and verification. An easy way to switch to L-TWM mode MUST be implemented. An easy way to switch to fingerprint mode (see below) SHOULD be implemented. An easy way to switch to F-TWM mode MAY be implemented
+
L-TWM mode
There are situations, where S-TWM is not sufficient (e.g., communication parties that are more likely under attack), in which the L-TWM MAY be displayed to the user by default. An easy way to switch to F-TWM mode MUST be implemented. An easy way to switch to fingerprint mode (see below) SHOULD be implemented. An easy way to switch to S-TWM mode MAY be implemented
+
F-TWM mode
The full F-TWM MUST be implemented too, to address high risk secenarios. An easy way to switch to fingerprint mode (see below) SHOULD be implemented. Easy ways to switch to L-TWM or S-TWM mode MAY be implemented.
+
Fingerprint mode (fallback)
To retain compatibility to existing OpenPGP users (that know nothing about Trustwords), the fingerprint mode, a fallback to compare the original fingerprints (usually in hexadecimal form) MAY be used. An easy way to switch to a least one of the TWM modes MUST be implemented.
+
+
If the verification process was successful, the user confirms it, e.g. by setting a check mark. Once the user has confirmed it, the Privacy Status [I-D.marques-pep-rating] for this channel MUST be updated accordingly.
A (global) adversary can pre-generate all Trustwords any two users expect to compare and try to engage in MITM attacks which fit – it MUST NOT be assumed public keys and thus fingerprints to be something to stay secret, especially as in pEp public keys are aggressively distributed to all peers. Also similar Trustwords can be generated, which spelled on the phone might sound very similar.
This section records the status of known implementations of the protocol defined by this specification at the time of posting of this Internet-Draft, and is based on a proposal described in [RFC7942]. The description of implementations in this section is intended to assist the IETF in its decision processes in progressing drafts to RFCs. Please note that the listing of any individual implementation here does not imply endorsement by the IETF. Furthermore, no effort has been spent to verify the information presented here that was supplied by IETF contributors. This is not intended as, and must not be construed to be, a catalog of available implementations or their features. Readers are advised to note that other implementations may exist.
+
According to [RFC7942], “[…] this will allow reviewers and working groups to assign due consideration to documents that have the benefit of running code, which may serve as evidence of valuable experimentation and feedback that have made the implemented protocols more mature. It is up to the individual working groups to use this information as they see fit.”
The following software implementing the pEp protocols (to varying degrees) already exists:
+
+
+
+
pEp for Outlook as add-on for Microsoft Outlook, release [SRC.pepforoutlook]
+
+
pEp for Android (based on a fork of the K9 MUA), release [SRC.pepforandroid]
+
+
Enigmail/pEp as add-on for Mozilla Thunderbird, release [SRC.enigmailpep]
+
+
pEp for iOS (implemented in a new MUA), beta [SRC.pepforios]
+
+
+
pEp for Android, iOS and Outlook are provided by pEp Security, a commercial entity specializing in end-user software implementing pEp while Enigmail/pEp is pursued as community project, supported by the pEp Foundation.
+
All software is available as Free Software and published also in source form.
+
Handshake is already implemented in all platforms listed above.
Special thanks to Volker Birk and Leon Schumacher who developed the original concept of the pEp Handshake.
+
This work was initially created by pEp Foundation, and then reviewed and extended with funding by the Internet Society’s Beyond the Net Programme on standardizing pEp. [ISOC.bnet]
+
+
+
diff --git a/pep-handshake/archive/draft-marques-pep-handshake-04.txt b/pep-handshake/archive/draft-marques-pep-handshake-04.txt
new file mode 100644
index 00000000..3afd357a
--- /dev/null
+++ b/pep-handshake/archive/draft-marques-pep-handshake-04.txt
@@ -0,0 +1,728 @@
+
+
+
+
+Network Working Group H. Marques
+Internet-Draft B. Hoeneisen
+Intended status: Standards Track pEp Foundation
+Expires: July 11, 2020 January 08, 2020
+
+
+ pretty Easy privacy (pEp): Contact and Channel Authentication through
+ Handshake
+ draft-marques-pep-handshake-04
+
+Abstract
+
+ In interpersonal messaging end-to-end encryption means for public key
+ distribution and verification of its authenticity are needed; the
+ latter to prevent man-in-the-middle (MITM) attacks.
+
+ This document proposes a new method to easily verify a public key is
+ authentic by a Handshake process that allows users to easily
+ authenticate their communication channel. The new method is targeted
+ to Opportunistic Security scenarios and is already implemented in
+ several applications of pretty Easy privacy (pEp).
+
+Status of This Memo
+
+ This Internet-Draft is submitted in full conformance with the
+ provisions of BCP 78 and BCP 79.
+
+ Internet-Drafts are working documents of the Internet Engineering
+ Task Force (IETF). Note that other groups may also distribute
+ working documents as Internet-Drafts. The list of current Internet-
+ Drafts is at https://datatracker.ietf.org/drafts/current/.
+
+ Internet-Drafts are draft documents valid for a maximum of six months
+ and may be updated, replaced, or obsoleted by other documents at any
+ time. It is inappropriate to use Internet-Drafts as reference
+ material or to cite them other than as "work in progress."
+
+ This Internet-Draft will expire on July 11, 2020.
+
+Copyright Notice
+
+ Copyright (c) 2020 IETF Trust and the persons identified as the
+ document authors. All rights reserved.
+
+ This document is subject to BCP 78 and the IETF Trust's Legal
+ Provisions Relating to IETF Documents
+ (https://trustee.ietf.org/license-info) in effect on the date of
+ publication of this document. Please review these documents
+
+
+
+Marques & Hoeneisen Expires July 11, 2020 [Page 1]
+
+Internet-Draft pretty Easy privacy (pEp) Handshake January 2020
+
+
+ carefully, as they describe your rights and restrictions with respect
+ to this document. Code Components extracted from this document must
+ include Simplified BSD License text as described in Section 4.e of
+ the Trust Legal Provisions and are provided without warranty as
+ described in the Simplified BSD License.
+
+Table of Contents
+
+ 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2
+ 1.1. Requirements Language . . . . . . . . . . . . . . . . . . 3
+ 1.2. Terms . . . . . . . . . . . . . . . . . . . . . . . . . . 3
+ 2. Problem Statement . . . . . . . . . . . . . . . . . . . . . . 4
+ 2.1. Use Cases . . . . . . . . . . . . . . . . . . . . . . . . 4
+ 2.2. Existing Solutions . . . . . . . . . . . . . . . . . . . 4
+ 3. The pEp Handshake Proposal . . . . . . . . . . . . . . . . . 5
+ 3.1. Verification Process . . . . . . . . . . . . . . . . . . 6
+ 3.1.1. Short, Long and Full Trustword Mapping . . . . . . . 6
+ 3.1.2. Display Modes . . . . . . . . . . . . . . . . . . . . 7
+ 4. Security Considerations . . . . . . . . . . . . . . . . . . . 8
+ 5. Privacy Considerations . . . . . . . . . . . . . . . . . . . 9
+ 6. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 9
+ 7. Implementation Status . . . . . . . . . . . . . . . . . . . . 9
+ 7.1. Introduction . . . . . . . . . . . . . . . . . . . . . . 9
+ 7.2. Current software implementing pEp . . . . . . . . . . . . 9
+ 8. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 10
+ 9. References . . . . . . . . . . . . . . . . . . . . . . . . . 10
+ 9.1. Normative References . . . . . . . . . . . . . . . . . . 10
+ 9.2. Informative References . . . . . . . . . . . . . . . . . 11
+ Appendix A. Document Changelog . . . . . . . . . . . . . . . . . 12
+ Appendix B. Open Issues . . . . . . . . . . . . . . . . . . . . 13
+ Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 13
+
+1. Introduction
+
+ In interpersonal messaging end-to-end encryption means for public key
+ distribution and verification of its authenticity are needed.
+
+ Examples for key distribution include:
+
+ o Exchange public keys out-of-band before encrypted communication
+
+ o Use of centralized public key stores (e.g., OpenPGP Key Servers)
+
+ o Ship public keys in-band when communicating
+
+ To prevent man-in-the-middle (MITM) attacks, additionally the
+ authenticity of a public key needs to be verified. Methods to
+ authenticate public keys of peers include, e.g., to verify digital
+
+
+
+Marques & Hoeneisen Expires July 11, 2020 [Page 2]
+
+Internet-Draft pretty Easy privacy (pEp) Handshake January 2020
+
+
+ signatures of public keys (which may be signed in a hierarchical or
+ flat manner, e.g., by a Web of Trust (WoT)), to compare the public
+ key's fingerprints via a suitable independent channel, or to scan a
+ QR mapping of the fingerprint (cf. Section 2).
+
+ This document proposes a new method to verify the authenticity of
+ public keys by a Handshake process that allows users to easily verify
+ their communication channel. Fingerprints of the involved peers are
+ combined and mapped to (common) Trustwords [I-D.birk-pep-trustwords].
+ The successful manual comparison of these Trustwords is used to
+ consider the communication channel as trusted.
+
+ The proposed method is already implemented and used in applications
+ of pretty Easy privacy (pEp) [I-D.birk-pep]. This document is
+ targeted to applications based on the pEp framework and Opportunistic
+ Security [RFC7435]. However, it may be also used in other
+ applications as suitable.
+
+ Note: The pEp framework [I-D.birk-pep] proposes to automatize the use
+ of end-to-end encryption for Internet users of email and other
+ messaging applications and introduces methods to easily allow
+ authentication.
+
+1.1. Requirements Language
+
+ The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
+ "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
+ document are to be interpreted as described in [RFC2119].
+
+1.2. Terms
+
+ The following terms are defined for the scope of this document:
+
+ o Trustwords: A scalar-to-word representation of 16-bit numbers (0
+ to 65535) to natural language words. When doing a Handshake,
+ peers are shown combined Trustwords of both public keys involved
+ to ease the comparison. [I-D.birk-pep-trustwords]
+
+ o Trust On First Use (TOFU): cf. [RFC7435], which states: "In a
+ protocol, TOFU calls for accepting and storing a public key or
+ credential associated with an asserted identity, without
+ authenticating that assertion. Subsequent communication that is
+ authenticated using the cached key or credential is secure against
+ an MiTM attack, if such an attack did not succeed during the
+ vulnerable initial communication."
+
+ o Man-in-the-middle (MITM) attack: cf. [RFC4949], which states: "A
+ form of active wiretapping attack in which the attacker intercepts
+
+
+
+Marques & Hoeneisen Expires July 11, 2020 [Page 3]
+
+Internet-Draft pretty Easy privacy (pEp) Handshake January 2020
+
+
+ and selectively modifies communicated data to masquerade as one or
+ more of the entities involved in a communication association."
+
+2. Problem Statement
+
+ To secure a communication channel, in public key cryptography each
+ involved peer needs a key pair. Its public key needs to be shared to
+ other peers by some means. However, the key obtained by the receiver
+ may have been substituted or tampered with to allow for re-encryption
+ attacks. To prevent such man-in-the-middle (MITM) attacks, an
+ important step is to verify the authenticity of a public key
+ obtained.
+
+2.1. Use Cases
+
+ Such a verification process is useful in at least two scenarios:
+
+ o Verify channels to peers, e.g., to make sure opportunistically
+ exchanged keys for end-to-end encryption are authentic.
+
+ o Verify channels between own devices (in multi-device contexts),
+ e.g., for the purpose of importing and synchronizing keys among
+ different devices belonging to the same user (cf.
+ [I-D.pep-keysync]). This scenario is comparable to Bluetooth
+ pairing before starting data transfers.
+
+2.2. Existing Solutions
+
+ Current methods to authenticate public keys of peers include:
+
+ o Digitally signed public keys are verified by a chain of trust.
+ Two trust models are common in today's implementations.
+
+ * Signing is carried out hierarchically, e.g. in a Public Key
+ Infrastructure (PKI) [RFC5280], in which case the verification
+ is based on a chain of trust with a Trust Anchor (TA) at the
+ root.
+
+ * Signing of public keys is done in a flat manner (by a Web of
+ Trust), e.g., key signing in OpenPGP [RFC4880], where users
+ sign the public keys of other users. Verification may be based
+ on transitive trust.
+
+ o Peers are expected to directly compare the public key's
+ fingerprints by any suitable independent channel - e.g, by phone
+ or with a face-to-face meeting. This method is often used in
+ OpenPGP [RFC4880] contexts.
+
+
+
+
+Marques & Hoeneisen Expires July 11, 2020 [Page 4]
+
+Internet-Draft pretty Easy privacy (pEp) Handshake January 2020
+
+
+ o The public keys' fingerprints are mapped into a QR code, which is
+ expected to be scanned between the peers when they happen to meet
+ face-to-face. This method is, e.g., used in the chat application
+ Threema [threema].
+
+ o The public keys' fingerprints are mapped into numerical codes
+ which decimal digits only (so-called "safety numbers"), which
+ makes the strings the humans need to compare easier in respect to
+ hexacodes, but longer and thus nevertheless cumbersome. This
+ method is e.g. used in the chat application Signal [signal].
+
+ Some of the methods can even be used in conjunction with Trustwords
+ [I-D.birk-pep-trustwords] or the PGP Word list [PGP.wl].
+
+ None of the existing solutions meets all requirements set up by pEp
+ [I-D.birk-pep], e.g.:
+
+ o Easy solution that can be handled easily by ordinary users
+
+ o In case privacy and security contradict each other, privacy is
+ always preferred over security (e.g., the Web of Trust contradicts
+ privacy)
+
+ o No central entities
+
+ Most of today's systems lack easy ways for users to authenticate
+ their communication channel. Some methods leak private data (e.g.,
+ their social graph) or depend on central entities. Thus, none of
+ today's systems fulfills all of the pEp requirements (cf. above).
+
+3. The pEp Handshake Proposal
+
+ In pretty Easy privacy (pEp), the proposed approach for peers to
+ authenticate each other is to engage in the pEp Handshake.
+
+ In current pEp implementations (cf. Section 7.2), the same kinds of
+ keys as in OpenPGP are used. Such keys include a fingerprint as
+ cryptographic hash over the public key. This fingerprint is normally
+ represented in a hexadecimal form, consisting of ten 4-digit
+ hexadecimal blocks, e.g.:
+
+ 8E31 EF52 1D47 5183 3E9D EADC 0FFE E7A5 7E5B AD19
+
+ Each block may also be represented in decimal numbers from 0 to 65535
+ or in other numerical forms, e.g.
+
+ o Hexadecimal: 8E31
+
+
+
+
+Marques & Hoeneisen Expires July 11, 2020 [Page 5]
+
+Internet-Draft pretty Easy privacy (pEp) Handshake January 2020
+
+
+ o Decimal: 36401
+
+ o Binary: 1000111000110001
+
+3.1. Verification Process
+
+ In the pEp Handshake the fingerprints of any two peers involved are
+ combined and displayed in form of Trustwords
+ [I-D.birk-pep-trustwords] for easy comparison by the involved
+ parties.
+
+ The default verification process involves three steps:
+
+ 1. Combining fingerprints by XOR function
+
+ Any two peers' fingerprints are combined bit-by-bit using the
+ Exclusive-OR (XOR) function resulting in the Combined Fingerprint
+ (CFP).
+
+ 2. Mapping result to Trustwords:
+
+ The CFP is then mapped to 16-bit Trustwords (i.e., every 4-digit
+ hexadecimal block is mapped to a given Trustword) resulting in
+ the Trustword Mapping (TWM).
+
+ 3. Verify Trustwords over independent channel
+
+ The resulting Trustwords (TWM) are compared and verified over an
+ independent channel, e.g., a phone line. If this step was
+ successful, the channel can be marked as authenticated.
+
+ Note: In prior implementations of pEp the fingerprints of any two
+ peers were concatenated. While this has the advantage that the own
+ identity's Trustwords can be printed on a business card (like with
+ fingerprints) or on contact sites or in signature texts of emails,
+ this at the same time has the drawback that users might not carefully
+ compare the words as they start to remember and recognize their
+ Trustwords in the concatenated mapping. The avoid this undesired
+ training effect, Trustwords for any peer-to-peer combination shall
+ (very likely) differ.
+
+3.1.1. Short, Long and Full Trustword Mapping
+
+ The more an ordinary user needs to contribute to a process, the less
+ likely a user will carry out all steps carefully. In particular, it
+ was observed that a simple (manual) comparison of OpenPGP
+ fingerprints is rarely carried out to the full extent, i.e., mostly
+ only parts of the fingerprint are compared, if at all.
+
+
+
+Marques & Hoeneisen Expires July 11, 2020 [Page 6]
+
+Internet-Draft pretty Easy privacy (pEp) Handshake January 2020
+
+
+ For usability reasons and to create incentives for people to actually
+ carry out a Handshake (while maintaining an certain level of
+ entropy), pEp allows for different entropy levels, i.e.:
+
+ 1. Full Trustword Mapping (F-TWM) MUST represent the maximum entropy
+ achievable by the mapping. This means all Trustwords of a TWM
+ MUST be displayed and compared.
+
+ E.g., the fingerprint
+
+ F482 E952 2F48 618B 01BC 31DC 5428 D7FA ACDC 3F13
+
+ is mapped to
+
+ dog house brother town fat bath school banana kite task
+
+ 2. Long Trustword Mapping (L-TWM) requires a number of Trustwords
+ that MUST retain at least 128 bits of entropy. Thus, L-TWM
+ results into at least eight Trustwords to be compared by the
+ user.
+
+ E.g., the fingerprint
+
+ F482 E952 2F48 618B 01BC 31DC 5428 D7FA ACDC [ 3F13 ]
+
+ is mapped to
+
+ dog house brother town fat bath school banana kite [ remaining
+ Trustword(s) omitted ]
+
+ 3. Short Trustword Mapping (S-TWM) requires a number of Trustwords
+ that MUST retain at least 64 bits of entropy. Thus, S-TWM
+ results into at least four Trustwords to be compared by the user.
+
+ E.g., the fingerprint
+
+ F482 E952 2F48 618B 01BC [ 31DC 5428 D7FA ACDC 3F13 ]
+
+ is mapped to
+
+ dog house brother town fat [ remaining Trustwords omitted ]
+
+3.1.2. Display Modes
+
+ The pEp Handshake has three display modes for the verification
+ process. All of the following modes MUST be implemented:
+
+ 1. S-TWM mode (default)
+
+
+
+Marques & Hoeneisen Expires July 11, 2020 [Page 7]
+
+Internet-Draft pretty Easy privacy (pEp) Handshake January 2020
+
+
+ By default the S-TWM SHOULD be displayed to the user for
+ comparison and verification. An easy way to switch to L-TWM mode
+ MUST be implemented. An easy way to switch to fingerprint mode
+ (see below) SHOULD be implemented. An easy way to switch to
+ F-TWM mode MAY be implemented
+
+ 2. L-TWM mode
+
+ There are situations, where S-TWM is not sufficient (e.g.,
+ communication parties that are more likely under attack), in
+ which the L-TWM MAY be displayed to the user by default. An easy
+ way to switch to F-TWM mode MUST be implemented. An easy way to
+ switch to fingerprint mode (see below) SHOULD be implemented. An
+ easy way to switch to S-TWM mode MAY be implemented
+
+ 3. F-TWM mode
+
+ The full F-TWM MUST be implemented too, to address high risk
+ secenarios. An easy way to switch to fingerprint mode (see
+ below) SHOULD be implemented. Easy ways to switch to L-TWM or
+ S-TWM mode MAY be implemented.
+
+ 4. Fingerprint mode (fallback)
+
+ To retain compatibility to existing OpenPGP users (that know
+ nothing about Trustwords), the fingerprint mode, a fallback to
+ compare the original fingerprints (usually in hexadecimal form)
+ MAY be used. An easy way to switch to a least one of the TWM
+ modes MUST be implemented.
+
+ If the verification process was successful, the user confirms it,
+ e.g. by setting a check mark. Once the user has confirmed it, the
+ Privacy Status [I-D.marques-pep-rating] for this channel MUST be
+ updated accordingly.
+
+4. Security Considerations
+
+ A (global) adversary can pre-generate all Trustwords any two users
+ expect to compare and try to engage in MITM attacks which fit - it
+ MUST NOT be assumed public keys and thus fingerprints to be something
+ to stay secret, especially as in pEp public keys are aggressively
+ distributed to all peers. Also similar Trustwords can be generated,
+ which spelled on the phone might sound very similar.
+
+
+
+
+
+
+
+
+Marques & Hoeneisen Expires July 11, 2020 [Page 8]
+
+Internet-Draft pretty Easy privacy (pEp) Handshake January 2020
+
+
+5. Privacy Considerations
+
+ [[ TODO ]]
+
+6. IANA Considerations
+
+ This document has no actions for IANA.
+
+7. Implementation Status
+
+7.1. Introduction
+
+ This section records the status of known implementations of the
+ protocol defined by this specification at the time of posting of this
+ Internet-Draft, and is based on a proposal described in [RFC7942].
+ The description of implementations in this section is intended to
+ assist the IETF in its decision processes in progressing drafts to
+ RFCs. Please note that the listing of any individual implementation
+ here does not imply endorsement by the IETF. Furthermore, no effort
+ has been spent to verify the information presented here that was
+ supplied by IETF contributors. This is not intended as, and must not
+ be construed to be, a catalog of available implementations or their
+ features. Readers are advised to note that other implementations may
+ exist.
+
+ According to [RFC7942], "[...] this will allow reviewers and working
+ groups to assign due consideration to documents that have the benefit
+ of running code, which may serve as evidence of valuable
+ experimentation and feedback that have made the implemented protocols
+ more mature. It is up to the individual working groups to use this
+ information as they see fit."
+
+7.2. Current software implementing pEp
+
+ The following software implementing the pEp protocols (to varying
+ degrees) already exists:
+
+ o pEp for Outlook as add-on for Microsoft Outlook, release
+ [SRC.pepforoutlook]
+
+ o pEp for Android (based on a fork of the K9 MUA), release
+ [SRC.pepforandroid]
+
+ o Enigmail/pEp as add-on for Mozilla Thunderbird, release
+ [SRC.enigmailpep]
+
+ o pEp for iOS (implemented in a new MUA), beta [SRC.pepforios]
+
+
+
+
+Marques & Hoeneisen Expires July 11, 2020 [Page 9]
+
+Internet-Draft pretty Easy privacy (pEp) Handshake January 2020
+
+
+ pEp for Android, iOS and Outlook are provided by pEp Security, a
+ commercial entity specializing in end-user software implementing pEp
+ while Enigmail/pEp is pursued as community project, supported by the
+ pEp Foundation.
+
+ All software is available as Free Software and published also in
+ source form.
+
+ Handshake is already implemented in all platforms listed above.
+
+8. Acknowledgements
+
+ Special thanks to Volker Birk and Leon Schumacher who developed the
+ original concept of the pEp Handshake.
+
+ This work was initially created by pEp Foundation, and then reviewed
+ and extended with funding by the Internet Society's Beyond the Net
+ Programme on standardizing pEp. [ISOC.bnet]
+
+9. References
+
+9.1. Normative References
+
+ [I-D.birk-pep]
+ Birk, V., Marques, H., and B. Hoeneisen, "pretty Easy
+ privacy (pEp): Privacy by Default", draft-birk-pep-05
+ (work in progress), November 2019.
+
+ [I-D.birk-pep-trustwords]
+ Hoeneisen, B. and H. Marques, "IANA Registration of
+ Trustword Lists: Guide, Template and IANA Considerations",
+ draft-birk-pep-trustwords-04 (work in progress), July
+ 2019.
+
+ [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
+ Requirement Levels", BCP 14, RFC 2119,
+ DOI 10.17487/RFC2119, March 1997,
+ .
+
+ [RFC4949] Shirey, R., "Internet Security Glossary, Version 2",
+ FYI 36, RFC 4949, DOI 10.17487/RFC4949, August 2007,
+ .
+
+ [RFC7435] Dukhovni, V., "Opportunistic Security: Some Protection
+ Most of the Time", RFC 7435, DOI 10.17487/RFC7435,
+ December 2014, .
+
+
+
+
+
+Marques & Hoeneisen Expires July 11, 2020 [Page 10]
+
+Internet-Draft pretty Easy privacy (pEp) Handshake January 2020
+
+
+9.2. Informative References
+
+ [I-D.marques-pep-rating]
+ Marques, H. and B. Hoeneisen, "pretty Easy privacy (pEp):
+ Mapping of Privacy Rating", draft-marques-pep-rating-02
+ (work in progress), July 2019.
+
+ [I-D.pep-keysync]
+ Birk, V., Hoeneisen, B., and K. Bristol, "pretty Easy
+ privacy (pEp): Key Synchronization Protocol (KeySync)",
+ draft-pep-keysync-00 (work in progress), November 2019.
+
+ [ISOC.bnet]
+ Simao, I., "Beyond the Net. 12 Innovative Projects
+ Selected for Beyond the Net Funding. Implementing Privacy
+ via Mass Encryption: Standardizing pretty Easy privacy's
+ protocols", June 2017, .
+
+ [PGP.wl] "PGP word list", November 2017,
+ .
+
+ [RFC4880] Callas, J., Donnerhacke, L., Finney, H., Shaw, D., and R.
+ Thayer, "OpenPGP Message Format", RFC 4880,
+ DOI 10.17487/RFC4880, November 2007,
+ .
+
+ [RFC5280] Cooper, D., Santesson, S., Farrell, S., Boeyen, S.,
+ Housley, R., and W. Polk, "Internet X.509 Public Key
+ Infrastructure Certificate and Certificate Revocation List
+ (CRL) Profile", RFC 5280, DOI 10.17487/RFC5280, May 2008,
+ .
+
+ [RFC7942] Sheffer, Y. and A. Farrel, "Improving Awareness of Running
+ Code: The Implementation Status Section", BCP 205,
+ RFC 7942, DOI 10.17487/RFC7942, July 2016,
+ .
+
+ [signal] "Signal", n.d., .
+
+ [SRC.enigmailpep]
+ "Source code for Enigmail/pEp", July 2019,
+ .
+
+
+
+
+
+
+Marques & Hoeneisen Expires July 11, 2020 [Page 11]
+
+Internet-Draft pretty Easy privacy (pEp) Handshake January 2020
+
+
+ [SRC.pepforandroid]
+ "Source code for pEp for Android", July 2019,
+ .
+
+ [SRC.pepforios]
+ "Source code for pEp for iOS", July 2019,
+ .
+
+ [SRC.pepforoutlook]
+ "Source code for pEp for Outlook", July 2019,
+ .
+
+ [threema] "Threema - Seriously secure messaging", n.d.,
+ .
+
+Appendix A. Document Changelog
+
+ [[ RFC Editor: This section is to be removed before publication ]]
+
+ o draft-marques-pep-handshake-04:
+
+ * Updated Terms and References
+
+ o draft-marques-pep-handshake-03:
+
+ * Updated Terms and References
+
+ o draft-marques-pep-handshake-02:
+
+ * Update Sections "Display modes" and "Short, Long and Full
+ Trustword Mapping"
+
+ * Add Privacy and IANA Considerations sections
+
+ * Minor editorial changes
+
+ o draft-marques-pep-handshake-01:
+
+ * Fix references
+
+ * Rewrite Sections "Display modes" and "Short, Long and Full
+ Trustword Mapping"
+
+ * Add reason why not to concatenate and map fingerprints instead
+
+ * Minor editorial changes
+
+ o draft-marques-pep-handshake-00:
+
+
+
+Marques & Hoeneisen Expires July 11, 2020 [Page 12]
+
+Internet-Draft pretty Easy privacy (pEp) Handshake January 2020
+
+
+ * Initial version
+
+Appendix B. Open Issues
+
+ [[ RFC Editor: This section should be empty and is to be removed
+ before publication ]]
+
+ o Add description for further processes to change the trust level,
+ e.g., to remove trust or even mistrust a peer and alike.
+
+Authors' Addresses
+
+ Hernani Marques
+ pEp Foundation
+ Oberer Graben 4
+ CH-8400 Winterthur
+ Switzerland
+
+ Email: hernani.marques@pep.foundation
+ URI: https://pep.foundation/
+
+
+ Bernie Hoeneisen
+ pEp Foundation
+ Oberer Graben 4
+ CH-8400 Winterthur
+ Switzerland
+
+ Email: bernie.hoeneisen@pep.foundation
+ URI: https://pep.foundation/
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Marques & Hoeneisen Expires July 11, 2020 [Page 13]
diff --git a/pep-handshake/archive/draft-marques-pep-handshake-04.xml b/pep-handshake/archive/draft-marques-pep-handshake-04.xml
new file mode 100644
index 00000000..3fc221a6
--- /dev/null
+++ b/pep-handshake/archive/draft-marques-pep-handshake-04.xml
@@ -0,0 +1,983 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ pretty Easy privacy (pEp): Contact and Channel Authentication through Handshake
+
+
+ pEp Foundation
+
+
+ Oberer Graben 4
+ CH-8400 Winterthur
+ Switzerland
+
+ hernani.marques@pep.foundation
+ https://pep.foundation/
+
+
+
+ pEp Foundation
+
+
+ Oberer Graben 4
+ CH-8400 Winterthur
+ Switzerland
+
+ bernie.hoeneisen@pep.foundation
+ https://pep.foundation/
+
+
+
+
+
+
+
+
+
+
+
+
+In interpersonal messaging end-to-end encryption means for public key
+distribution and verification of its authenticity are needed; the latter
+to prevent man-in-the-middle (MITM) attacks.
+
+This document proposes a new method to easily verify a public key is
+authentic by a Handshake process that allows users to easily
+authenticate their communication channel. The new method is targeted to
+Opportunistic Security scenarios and is already implemented in several
+applications of pretty Easy privacy (pEp).
+
+
+
+
+
+
+
+
+
+
+
+
+
+In interpersonal messaging end-to-end encryption means for public key
+distribution and verification of its authenticity are needed.
+
+Examples for key distribution include:
+
+
+ Exchange public keys out-of-band before encrypted communication
+ Use of centralized public key stores (e.g., OpenPGP Key Servers)
+ Ship public keys in-band when communicating
+
+
+To prevent man-in-the-middle (MITM) attacks, additionally the
+authenticity of a public key needs to be verified. Methods to
+authenticate public keys of peers include, e.g., to verify digital
+signatures of public keys (which may be signed in a hierarchical or
+flat manner, e.g., by a Web of Trust (WoT)), to compare the public
+key’s fingerprints via a suitable independent channel, or to scan a QR
+mapping of the fingerprint (cf. ).
+
+This document proposes a new method to verify the authenticity of
+public keys by a Handshake process that allows users to easily verify
+their communication channel. Fingerprints of the involved peers are
+combined and mapped to (common) Trustwords
+. The successful manual comparison of
+these Trustwords is used to consider the communication channel as
+trusted.
+
+The proposed method is already implemented and used in applications of
+pretty Easy privacy (pEp) . This document is targeted
+to applications based on the pEp framework and Opportunistic Security
+. However, it may be also used in other applications as
+suitable.
+
+Note: The pEp framework proposes to automatize the
+use of end-to-end encryption for Internet users of email and other
+messaging applications and introduces methods to easily allow
+authentication.
+
+
+
+The key words “MUST”, “MUST NOT”, “REQUIRED”, “SHALL”, “SHALL NOT”,
+“SHOULD”, “SHOULD NOT”, “RECOMMENDED”, “MAY”, and “OPTIONAL” in this
+document are to be interpreted as described in .
+
+
+
+
+The following terms are defined for the scope of this document:
+
+
+
+ Trustwords: A scalar-to-word representation of 16-bit numbers (0 to
+65535) to natural language words. When doing a Handshake, peers are
+shown combined Trustwords of both public keys involved to ease the
+comparison.
+
+
+
+
+
+ Trust On First Use (TOFU): cf. , which states: “In a
+protocol, TOFU calls for accepting and storing a public key or
+credential associated with an asserted identity, without
+authenticating that assertion. Subsequent communication that is
+authenticated using the cached key or credential is secure against
+an MiTM attack, if such an attack did not succeed during the
+vulnerable initial communication.”
+
+
+
+
+
+ Man-in-the-middle (MITM) attack: cf. , which states: “A
+form of active wiretapping attack in which the attacker intercepts
+and selectively modifies communicated data to masquerade as one or
+more of the entities involved in a communication association.”
+
+
+
+
+
+
+To secure a communication channel, in public key cryptography each
+involved peer needs a key pair. Its public key needs to be shared to
+other peers by some means. However, the key obtained by the receiver
+may have been substituted or tampered with to allow for re-encryption
+attacks. To prevent such man-in-the-middle (MITM) attacks, an
+important step is to verify the authenticity of a public key obtained.
+
+
+
+Such a verification process is useful in at least two scenarios:
+
+
+ Verify channels to peers, e.g., to make sure opportunistically
+exchanged keys for end-to-end encryption are authentic.
+ Verify channels between own devices (in multi-device contexts),
+e.g., for the purpose of importing and synchronizing keys among
+different devices belonging to the same user
+(cf. ). This scenario is comparable to
+Bluetooth pairing before starting data transfers.
+
+
+
+
+
+Current methods to authenticate public keys of peers include:
+
+
+ Digitally signed public keys are verified by a chain of trust. Two
+trust models are common in today’s implementations.
+ Signing is carried out hierarchically, e.g. in a Public Key
+Infrastructure (PKI) , in which case
+the verification is based on a chain of trust with a Trust Anchor
+(TA) at the root.
+ Signing of public keys is done in a flat manner (by a Web of
+Trust), e.g., key signing in OpenPGP , where users sign
+the public keys of other users. Verification may be based on
+transitive trust.
+
+ Peers are expected to directly compare the public key’s fingerprints
+by any suitable independent channel – e.g, by phone or with a
+face-to-face meeting. This method is often used in OpenPGP
+ contexts.
+ The public keys’ fingerprints are mapped into a QR code, which is
+expected to be scanned between the peers when they happen to meet
+face-to-face. This method is, e.g., used in the chat application
+Threema .
+ The public keys’ fingerprints are mapped into numerical codes which
+decimal digits only (so-called “safety numbers”), which makes the strings
+the humans need to compare easier in respect to hexacodes, but longer and
+thus nevertheless cumbersome. This method is e.g. used in the
+chat application Signal .
+
+
+Some of the methods can even be used in conjunction with Trustwords
+ or the PGP Word list .
+
+None of the existing solutions meets all requirements set up by pEp
+, e.g.:
+
+
+ Easy solution that can be handled easily by ordinary users
+ In case privacy and security contradict each other, privacy is
+always preferred over security (e.g., the Web of Trust contradicts
+privacy)
+ No central entities
+
+
+Most of today’s systems lack easy ways for users to authenticate their
+communication channel. Some methods leak private data (e.g., their
+social graph) or depend on central entities. Thus, none of today’s
+systems fulfills all of the pEp requirements (cf. above).
+
+
+
+
+
+In pretty Easy privacy (pEp), the proposed approach for peers to
+authenticate each other is to engage in the pEp Handshake.
+
+In current pEp implementations (cf. ), the same kinds
+of keys as in OpenPGP are used. Such keys include a fingerprint as
+cryptographic hash over the public key. This fingerprint is normally
+represented in a hexadecimal form, consisting of ten 4-digit
+hexadecimal blocks, e.g.:
+
+
+ 8E31 EF52 1D47 5183 3E9D EADC 0FFE E7A5 7E5B AD19
+
+
+Each block may also be represented in decimal numbers from 0 to 65535
+or in other numerical forms, e.g.
+
+
+ Hexadecimal: 8E31
+ Decimal: 36401
+ Binary: 1000111000110001
+
+
+
+
+In the pEp Handshake the fingerprints of any two peers involved are
+combined and displayed in form of Trustwords for
+easy comparison by the involved parties.
+
+The default verification process involves three steps:
+
+
+ Combining fingerprints by XOR function
+Any two peers’ fingerprints are combined bit-by-bit using the
+Exclusive-OR (XOR) function resulting in the Combined Fingerprint
+(CFP).
+ Mapping result to Trustwords:
+The CFP is then mapped to 16-bit Trustwords (i.e., every 4-digit
+hexadecimal block is mapped to a given Trustword) resulting in the
+Trustword Mapping (TWM).
+ Verify Trustwords over independent channel
+The resulting Trustwords (TWM) are compared and verified over an
+independent channel, e.g., a phone line. If this step was
+successful, the channel can be marked as authenticated.
+
+
+Note: In prior implementations of pEp the fingerprints of any two peers were
+concatenated. While this has the advantage that the own identity’s Trustwords
+can be printed on a business card (like with fingerprints) or on contact sites
+or in signature texts of emails, this at the same time has the drawback that
+users might not carefully compare the words as they start to remember and
+recognize their Trustwords in the concatenated mapping. The avoid this
+undesired training effect, Trustwords for any peer-to-peer combination
+shall (very likely) differ.
+
+
+
+The more an ordinary user needs to contribute to a process, the less
+likely a user will carry out all steps carefully. In particular, it
+was observed that a simple (manual) comparison of OpenPGP fingerprints
+is rarely carried out to the full extent, i.e., mostly only parts of
+the fingerprint are compared, if at all.
+
+For usability reasons and to create incentives for people to actually
+carry out a Handshake (while maintaining an certain level of entropy),
+pEp allows for different entropy levels, i.e.:
+
+
+ Full Trustword Mapping (F-TWM) MUST represent the maximum entropy
+achievable by the mapping. This means all Trustwords of a TWM MUST
+be displayed and compared.
+E.g., the fingerprint
+ F482 E952 2F48 618B 01BC 31DC 5428 D7FA ACDC 3F13
+
+is mapped to
+ dog house brother town fat bath school banana kite task
+
+ Long Trustword Mapping (L-TWM) requires a number of Trustwords that
+MUST retain at least 128 bits of entropy. Thus, L-TWM results into
+at least eight Trustwords to be compared by the user.
+E.g., the fingerprint
+ F482 E952 2F48 618B 01BC 31DC 5428 D7FA ACDC [ 3F13 ]
+
+is mapped to
+ dog house brother town fat bath school banana kite [ remaining Trustword(s) omitted ]
+
+ Short Trustword Mapping (S-TWM) requires a number of Trustwords
+that MUST retain at least 64 bits of entropy. Thus, S-TWM results
+into at least four Trustwords to be compared by the user.
+E.g., the fingerprint
+ F482 E952 2F48 618B 01BC [ 31DC 5428 D7FA ACDC 3F13 ]
+
+is mapped to
+ dog house brother town fat [ remaining Trustwords omitted ]
+
+
+
+
+
+
+The pEp Handshake has three display modes for the verification
+process. All of the following modes MUST be implemented:
+
+
+ S-TWM mode (default)
+By default the S-TWM SHOULD be displayed to the user for comparison
+and verification. An easy way to switch to L-TWM mode MUST be
+implemented. An easy way to switch to fingerprint mode (see below)
+SHOULD be implemented. An easy way to switch to F-TWM mode MAY be
+implemented
+ L-TWM mode
+There are situations, where S-TWM is not sufficient (e.g.,
+communication parties that are more likely under attack), in which
+the L-TWM MAY be displayed to the user by default. An easy way to
+switch to F-TWM mode MUST be implemented. An easy way to switch to
+fingerprint mode (see below) SHOULD be implemented. An easy way to
+switch to S-TWM mode MAY be implemented
+ F-TWM mode
+The full F-TWM MUST be implemented too, to address high risk
+secenarios. An easy way to switch to fingerprint mode (see below)
+SHOULD be implemented. Easy ways to switch to L-TWM or S-TWM mode
+MAY be implemented.
+ Fingerprint mode (fallback)
+To retain compatibility to existing OpenPGP users (that know
+nothing about Trustwords), the fingerprint mode, a fallback to
+compare the original fingerprints (usually in hexadecimal form) MAY
+be used. An easy way to switch to a least one of the TWM modes
+MUST be implemented.
+
+
+If the verification process was successful, the user confirms it,
+e.g. by setting a check mark. Once the user has confirmed it, the
+Privacy Status for this channel MUST be
+updated accordingly.
+
+
+
+
+
+
+A (global) adversary can pre-generate all Trustwords any two users
+expect to compare and try to engage in MITM attacks which fit – it
+MUST NOT be assumed public keys and thus fingerprints to be something
+to stay secret, especially as in pEp public keys are aggressively
+distributed to all peers. Also similar Trustwords can be generated,
+which spelled on the phone might sound very similar.
+
+
+
+
+[[ TODO ]]
+
+
+
+
+This document has no actions for IANA.
+
+
+
+
+
+
+This section records the status of known implementations of the
+protocol defined by this specification at the time of posting of this
+Internet-Draft, and is based on a proposal described in .
+The description of implementations in this section is intended to
+assist the IETF in its decision processes in progressing drafts to
+RFCs. Please note that the listing of any individual implementation
+here does not imply endorsement by the IETF. Furthermore, no effort
+has been spent to verify the information presented here that was
+supplied by IETF contributors. This is not intended as, and must not
+be construed to be, a catalog of available implementations or their
+features. Readers are advised to note that other implementations may
+exist.
+
+According to , “[…] this will allow reviewers and
+working groups to assign due consideration to documents that have the
+benefit of running code, which may serve as evidence of valuable
+experimentation and feedback that have made the implemented protocols
+more mature. It is up to the individual working groups to use this
+information as they see fit.”
+
+
+
+
+The following software implementing the pEp protocols (to varying
+degrees) already exists:
+
+
+ pEp for Outlook as add-on for Microsoft Outlook, release
+ pEp for Android (based on a fork of the K9 MUA), release
+ Enigmail/pEp as add-on for Mozilla Thunderbird, release
+ pEp for iOS (implemented in a new MUA), beta
+
+
+pEp for Android, iOS and Outlook are provided by pEp Security, a commercial
+entity specializing in end-user software implementing pEp while Enigmail/pEp
+is pursued as community project, supported by the pEp Foundation.
+
+All software is available as Free Software and published also in source form.
+
+Handshake is already implemented in all platforms listed above.
+
+
+
+
+
+
+
+
+
+Special thanks to Volker Birk and Leon Schumacher who developed the
+original concept of the pEp Handshake.
+
+This work was initially created by pEp Foundation, and then reviewed
+and extended with funding by the Internet Society’s Beyond the Net
+Programme on standardizing pEp.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+IANA Registration of Trustword Lists: Guide, Template and IANA Considerations
+
+
+
+
+
+
+
+
+
+
+
+This document specifies the IANA Registration Guidelines for Trustwords, describes corresponding registration procedures, and provides a guideline for creating Trustword list specifications. Trustwords are common words in a natural language (e.g., English), which hexadecimal strings are mapped to. Such a mapping makes verification processes like fingerprint comparisons more practical, and less prone to misunderstandings.
+
+
+
+
+
+
+
+
+
+
+
+Internet Security Glossary, Version 2
+
+
+This Glossary provides definitions, abbreviations, and explanations of terminology for information system security. The 334 pages of entries offer recommendations to improve the comprehensibility of written material that is generated in the Internet Standards Process (RFC 2026). The recommendations follow the principles that such writing should (a) use the same term or definition whenever the same concept is mentioned; (b) use terms in their plainest, dictionary sense; (c) use terms that are already well-established in open publications; and (d) avoid terms that either favor a particular vendor or favor a particular technology or mechanism over other, competing techniques that already exist or could be developed. This memo provides information for the Internet community.
+
+
+
+
+
+
+
+
+
+
+Opportunistic Security: Some Protection Most of the Time
+
+
+This document defines the concept "Opportunistic Security" in the context of communications protocols. Protocol designs based on Opportunistic Security use encryption even when authentication is not available, and use authentication when possible, thereby removing barriers to the widespread use of encryption on the Internet.
+
+
+
+
+
+
+
+
+
+pretty Easy privacy (pEp): Privacy by Default
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+The pretty Easy privacy (pEp) model and protocols describe a set of conventions for the automation of operations traditionally seen as barriers to the use and deployment of secure, privacy-preserving end- to-end interpersonal messaging. These include, but are not limited to, key management, key discovery, and private key handling (including peer-to-peer synchronization of private keys and other user data across devices). Human Rights-enabling principles like Data Minimization, End-to-End and Interoperability are explicit design goals. For the goal of usable privacy, pEp introduces means to verify communication between peers and proposes a trust-rating system to denote secure types of communications and signal the privacy level available on a per-user and per-message level. Significantly, the pEp protocols build on already available security formats and message transports (e.g., PGP/MIME with email), and are written with the intent to be interoperable with already widely- deployed systems in order to ease adoption and implementation. This document outlines the general design choices and principles of pEp.
+
+
+
+
+
+
+
+
+
+
+
+Key words for use in RFCs to Indicate Requirement Levels
+
+
+In many standards track documents several words are used to signify the requirements in the specification. These words are often capitalized. This document defines these words as they should be interpreted in IETF documents. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+OpenPGP Message Format
+
+
+
+
+
+
+This document is maintained in order to publish all necessary information needed to develop interoperable applications based on the OpenPGP format. It is not a step-by-step cookbook for writing an application. It describes only the format and methods needed to read, check, generate, and write conforming packets crossing any network. It does not deal with storage and implementation questions. It does, however, discuss implementation issues necessary to avoid security flaws.OpenPGP software uses a combination of strong public-key and symmetric cryptography to provide security services for electronic communications and data storage. These services include confidentiality, key management, authentication, and digital signatures. This document specifies the message formats used in OpenPGP. [STANDARDS-TRACK]
+
+
+
+
+
+
+
+
+
+Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile
+
+
+
+
+
+
+
+This memo profiles the X.509 v3 certificate and X.509 v2 certificate revocation list (CRL) for use in the Internet. An overview of this approach and model is provided as an introduction. The X.509 v3 certificate format is described in detail, with additional information regarding the format and semantics of Internet name forms. Standard certificate extensions are described and two Internet-specific extensions are defined. A set of required certificate extensions is specified. The X.509 v2 CRL format is described in detail along with standard and Internet-specific extensions. An algorithm for X.509 certification path validation is described. An ASN.1 module and examples are provided in the appendices. [STANDARDS-TRACK]
+
+
+
+
+
+
+
+
+
+pretty Easy privacy (pEp): Mapping of Privacy Rating
+
+
+
+
+
+
+
+
+
+
+
+In many Opportunistic Security scenarios end-to-end encryption is automatized for Internet users. In addition, it is often required to provide the users with easy means to carry out authentication. Depending on several factors, each communication channel to different peers may have a different Privacy Status, e.g., unencrypted, encrypted and encrypted as well as authenticated. Even each message from/to a single peer may have a different Privacy Status. To display the actual Privacy Status to the user, this document defines a Privacy Rating scheme and its mapping to a traffic-light semantics. A Privacy Status is defined on a per-message basis as well as on a per-identity basis. The traffic-light semantics (as color rating) allows for a clear and easily understandable presentation to the user in order to optimize the User Experience (UX). This rating system is most beneficial to Opportunistic Security scenarios and is already implemented in several applications of pretty Easy privacy (pEp).
+
+
+
+
+
+
+
+
+
+
+
+pretty Easy privacy (pEp): Key Synchronization Protocol (KeySync)
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+This document describes the pEp KeySync protocol, which is designed to perform secure peer-to-peer synchronization of private keys across devices belonging to the same user. Modern users of messaging systems typically have multiple devices for communicating, and attempting to use encryption on all of these devices often leads to situations where messages cannot be decrypted on a given device due to missing private key data. Current approaches to resolve key synchronicity issues are cumbersome and potentially unsecure. The pEp KeySync protocol is designed to facilitate this personal key synchronization in a user-friendly manner.
+
+
+
+
+
+
+
+
+
+
+ Signal
+
+
+
+
+
+
+
+
+ Threema - Seriously secure messaging
+
+
+
+
+
+
+
+
+ PGP word list
+
+
+
+
+
+
+
+
+ Beyond the Net. 12 Innovative Projects Selected for Beyond the Net Funding. Implementing Privacy via Mass Encryption: Standardizing pretty Easy privacy’s protocols
+
+
+
+
+
+
+
+
+
+
+
+
+Improving Awareness of Running Code: The Implementation Status Section
+
+
+
+This document describes a simple process that allows authors of Internet-Drafts to record the status of known implementations by including an Implementation Status section. This will allow reviewers and working groups to assign due consideration to documents that have the benefit of running code, which may serve as evidence of valuable experimentation and feedback that have made the implemented protocols more mature.This process is not mandatory. Authors of Internet-Drafts are encouraged to consider using the process for their documents, and working groups are invited to think about applying the process to all of their protocol specifications. This document obsoletes RFC 6982, advancing it to a Best Current Practice.
+
+
+
+
+
+
+
+
+
+ Source code for pEp for Android
+
+
+
+
+
+
+
+
+ Source code for pEp for iOS
+
+
+
+
+
+
+
+
+ Source code for pEp for Outlook
+
+
+
+
+
+
+
+
+ Source code for Enigmail/pEp
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+[[ RFC Editor: This section is to be removed before publication ]]
+
+
+ draft-marques-pep-handshake-04:
+
+ Updated Terms and References
+
+ draft-marques-pep-handshake-03:
+
+ Updated Terms and References
+
+ draft-marques-pep-handshake-02:
+
+ Update Sections “Display modes” and “Short, Long and
+Full Trustword Mapping”
+ Add Privacy and IANA Considerations sections
+ Minor editorial changes
+
+ draft-marques-pep-handshake-01:
+
+ Fix references
+ Rewrite Sections “Display modes” and “Short, Long and
+Full Trustword Mapping”
+ Add reason why not to concatenate and map fingerprints instead
+ Minor editorial changes
+
+ draft-marques-pep-handshake-00:
+
+ Initial version
+
+
+
+
+
+
+[[ RFC Editor: This section should be empty and is to be removed
+ before publication ]]
+
+
+ Add description for further processes to change the trust level,
+e.g., to remove trust or even mistrust a peer and alike.
+
+
+
+
+
+
+
+
+
+
+