security.rst 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283
  1. .. somewhat surprisingly the "bash" highlighter gives nice results with
  2. the pseudo-code notation used in the "Encryption" section.
  3. .. highlight:: bash
  4. ========
  5. Security
  6. ========
  7. .. _borgcrypto:
  8. Cryptography in Borg
  9. ====================
  10. Attack model
  11. ------------
  12. The attack model of Borg is that the environment of the client process
  13. (e.g. ``borg create``) is trusted and the repository (server) is not. The
  14. attacker has any and all access to the repository, including interactive
  15. manipulation (man-in-the-middle) for remote repositories.
  16. Furthermore the client environment is assumed to be persistent across
  17. attacks (practically this means that the security database cannot be
  18. deleted between attacks).
  19. Under these circumstances Borg guarantees that the attacker cannot
  20. 1. modify the data of any archive without the client detecting the change
  21. 2. rename, remove or add an archive without the client detecting the change
  22. 3. recover plain-text data
  23. 4. recover definite (heuristics based on access patterns are possible)
  24. structural information such as the object graph (which archives
  25. refer to what chunks)
  26. The attacker can always impose a denial of service per definition (he could
  27. forbid connections to the repository, or delete it entirely).
  28. Structural Authentication
  29. -------------------------
  30. Borg is fundamentally based on an object graph structure (see :ref:`internals`),
  31. where the root object is called the manifest.
  32. Borg follows the `Horton principle`_, which states that
  33. not only the message must be authenticated, but also its meaning (often
  34. expressed through context), because every object used is referenced by a
  35. parent object through its object ID up to the manifest. The object ID in
  36. Borg is a MAC of the object's plaintext, therefore this ensures that
  37. an attacker cannot change the context of an object without forging the MAC.
  38. In other words, the object ID itself only authenticates the plaintext of the
  39. object and not its context or meaning. The latter is established by a different
  40. object referring to an object ID, thereby assigning a particular meaning to
  41. an object. For example, an archive item contains a list of object IDs that
  42. represent packed file metadata. On their own it's not clear that these objects
  43. would represent what they do, but by the archive item referring to them
  44. in a particular part of its own data structure assigns this meaning.
  45. This results in a directed acyclic graph of authentication from the manifest
  46. to the data chunks of individual files.
  47. .. rubric:: Authenticating the manifest
  48. Since the manifest has a fixed ID (000...000) the aforementioned authentication
  49. does not apply to it, indeed, cannot apply to it; it is impossible to authenticate
  50. the root node of a DAG through its edges, since the root node has no incoming edges.
  51. With the scheme as described so far an attacker could easily replace the manifest,
  52. therefore Borg includes a tertiary authentication mechanism (TAM) that is applied
  53. to the manifest since version 1.0.9 (see :ref:`tam_vuln`).
  54. TAM works by deriving a separate key through HKDF_ from the other encryption and
  55. authentication keys and calculating the HMAC of the metadata to authenticate [#]_::
  56. # RANDOM(n) returns n random bytes
  57. salt = RANDOM(64)
  58. ikm = id_key || enc_key || enc_hmac_key
  59. # *context* depends on the operation, for manifest authentication it is
  60. # the ASCII string "borg-metadata-authentication-manifest".
  61. tam_key = HKDF-SHA-512(ikm, salt, context)
  62. # *data* is a dict-like structure
  63. data[hmac] = zeroes
  64. packed = pack(data)
  65. data[hmac] = HMAC(tam_key, packed)
  66. packed_authenticated = pack(data)
  67. Since an attacker cannot gain access to this key and also cannot make the
  68. client authenticate arbitrary data using this mechanism, the attacker is unable
  69. to forge the authentication.
  70. This effectively 'anchors' the manifest to the key, which is controlled by the
  71. client, thereby anchoring the entire DAG, making it impossible for an attacker
  72. to add, remove or modify any part of the DAG without Borg being able to detect
  73. the tampering.
  74. Note that when using BORG_PASSPHRASE the attacker cannot swap the *entire*
  75. repository against a new repository with e.g. repokey mode and no passphrase,
  76. because Borg will abort access when BORG_PASSPRHASE is incorrect.
  77. However, interactively a user might not notice this kind of attack
  78. immediately, if she assumes that the reason for the absent passphrase
  79. prompt is a set BORG_PASSPHRASE. See issue :issue:`2169` for details.
  80. .. [#] The reason why the authentication tag is stored in the packed
  81. data itself is that older Borg versions can still read the
  82. manifest this way, while a changed layout would have broken
  83. compatibility.
  84. Encryption
  85. ----------
  86. Encryption is currently based on the Encrypt-then-MAC construction,
  87. which is generally seen as the most robust way to create an authenticated
  88. encryption scheme from encryption and message authentication primitives.
  89. Every operation (encryption, MAC / authentication, chunk ID derivation)
  90. uses independent, random keys generated by `os.urandom`_ [#]_.
  91. Borg does not support unauthenticated encryption -- only authenticated encryption
  92. schemes are supported. No unauthenticated encryption schemes will be added
  93. in the future.
  94. Depending on the chosen mode (see :ref:`borg_init`) different primitives are used:
  95. - The actual encryption is currently always AES-256 in CTR mode. The
  96. counter is added in plaintext, since it is needed for decryption,
  97. and is also tracked locally on the client to avoid counter reuse.
  98. - The authentication primitive is either HMAC-SHA-256 or BLAKE2b-256
  99. in a keyed mode. HMAC-SHA-256 uses 256 bit keys, while BLAKE2b-256
  100. uses 512 bit keys.
  101. The latter is secure not only because BLAKE2b itself is not
  102. susceptible to `length extension`_, but also since it truncates the
  103. hash output from 512 bits to 256 bits, which would make the
  104. construction safe even if BLAKE2b were broken regarding length
  105. extension or similar attacks.
  106. - The primitive used for authentication is always the same primitive
  107. that is used for deriving the chunk ID, but they are always
  108. used with independent keys.
  109. Encryption::
  110. id = AUTHENTICATOR(id_key, data)
  111. compressed = compress(data)
  112. iv = reserve_iv()
  113. encrypted = AES-256-CTR(enc_key, 8-null-bytes || iv, compressed)
  114. authenticated = type-byte || AUTHENTICATOR(enc_hmac_key, encrypted) || iv || encrypted
  115. Decryption::
  116. # Given: input *authenticated* data, possibly a *chunk-id* to assert
  117. type-byte, mac, iv, encrypted = SPLIT(authenticated)
  118. ASSERT(type-byte is correct)
  119. ASSERT( CONSTANT-TIME-COMPARISON( mac, AUTHENTICATOR(enc_hmac_key, encrypted) ) )
  120. decrypted = AES-256-CTR(enc_key, 8-null-bytes || iv, encrypted)
  121. decompressed = decompress(decrypted)
  122. ASSERT( CONSTANT-TIME-COMPARISON( chunk-id, AUTHENTICATOR(id_key, decompressed) ) )
  123. .. [#] Using the :ref:`borg key migrate-to-repokey <borg_key_migrate-to-repokey>`
  124. command a user can convert repositories created using Attic in "passphrase"
  125. mode to "repokey" mode. In this case the keys were directly derived from
  126. the user's passphrase at some point using PBKDF2.
  127. Borg does not support "passphrase" mode otherwise any more.
  128. Offline key security
  129. --------------------
  130. Borg cannot secure the key material while it is running, because the keys
  131. are needed in plain to decrypt/encrypt repository objects.
  132. For offline storage of the encryption keys they are encrypted with a
  133. user-chosen passphrase.
  134. A 256 bit key encryption key (KEK) is derived from the passphrase
  135. using PBKDF2-HMAC-SHA256 with a random 256 bit salt which is then used
  136. to Encrypt-then-MAC a packed representation of the keys with
  137. AES-256-CTR with a constant initialization vector of 0 (this is the
  138. same construction used for Encryption_ with HMAC-SHA-256).
  139. The resulting MAC is stored alongside the ciphertext, which is
  140. converted to base64 in its entirety.
  141. This base64 blob (commonly referred to as *keyblob*) is then stored in
  142. the key file or in the repository config (keyfile and repokey modes
  143. respectively).
  144. This scheme, and specifically the use of a constant IV with the CTR
  145. mode, is secure because an identical passphrase will result in a
  146. different derived KEK for every encryption due to the salt.
  147. Refer to the :ref:`key_files` section for details on the format.
  148. Implementations used
  149. --------------------
  150. We do not implement cryptographic primitives ourselves, but rely
  151. on widely used libraries providing them:
  152. - AES-CTR and HMAC-SHA-256 from OpenSSL 1.0 / 1.1 are used,
  153. which is also linked into the static binaries we provide.
  154. We think this is not an additional risk, since we don't ever
  155. use OpenSSL's networking, TLS or X.509 code, but only their
  156. primitives implemented in libcrypto.
  157. - SHA-256 and SHA-512 from Python's hashlib_ standard library module are used
  158. - HMAC, PBKDF2 and a constant-time comparison from Python's hmac_ standard
  159. library module is used.
  160. - BLAKE2b is either provided by the system's libb2, an official implementation,
  161. or a bundled copy of the BLAKE2 reference implementation (written in C).
  162. Implemented cryptographic constructions are:
  163. - Encrypt-then-MAC based on AES-256-CTR and either HMAC-SHA-256
  164. or keyed BLAKE2b256 as described above under Encryption_.
  165. - HKDF_-SHA-512
  166. .. _Horton principle: https://en.wikipedia.org/wiki/Horton_Principle
  167. .. _HKDF: https://tools.ietf.org/html/rfc5869
  168. .. _length extension: https://en.wikipedia.org/wiki/Length_extension_attack
  169. .. _hashlib: https://docs.python.org/3/library/hashlib.html
  170. .. _hmac: https://docs.python.org/3/library/hmac.html
  171. .. _os.urandom: https://docs.python.org/3/library/os.html#os.urandom
  172. Remote RPC protocol security
  173. ============================
  174. .. note:: This section could be further expanded / detailed.
  175. The RPC protocol is fundamentally based on msgpack'd messages exchanged
  176. over an encrypted SSH channel (the system's SSH client is used for this
  177. by piping data from/to it).
  178. This means that the authorization and transport security properties
  179. are inherited from SSH and the configuration of the SSH client
  180. and the SSH server. Therefore the remainder of this section
  181. will focus on the security of the RPC protocol within Borg.
  182. The assumed worst-case a server can inflict to a client is a
  183. denial of repository service.
  184. The situation were a server can create a general DoS on the client
  185. should be avoided, but might be possible by e.g. forcing the client to
  186. allocate large amounts of memory to decode large messages (or messages
  187. that merely indicate a large amount of data follows). The RPC protocol
  188. code uses a limited msgpack Unpacker to prohibit this.
  189. We believe that other kinds of attacks, especially critical vulnerabilities
  190. like remote code execution are inhibited by the design of the protocol:
  191. 1. The server cannot send requests to the client on its own accord,
  192. it only can send responses. This avoids "unexpected inversion of control"
  193. issues.
  194. 2. msgpack serialization does not allow embedding or referencing code that
  195. is automatically executed. Incoming messages are unpacked by the msgpack
  196. unpacker into native Python data structures (like tuples and dictionaries),
  197. which are then passed to the rest of the program.
  198. Additional verification of the correct form of the responses could be implemented.
  199. 3. Remote errors are presented in two forms:
  200. 1. A simple plain-text *stderr* channel. A prefix string indicates the kind of message
  201. (e.g. WARNING, INFO, ERROR), which is used to suppress it according to the
  202. log level selected in the client.
  203. A server can send arbitrary log messages, which may confuse a user. However,
  204. log messages are only processed when server requests are in progress, therefore
  205. the server cannot interfere / confuse with security critical dialogue like
  206. the password prompt.
  207. 2. Server-side exceptions passed over the main data channel. These follow the
  208. general pattern of server-sent responses and are sent instead of response data
  209. for a request.