Capability.hpp 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428
  1. /*
  2. * ZeroTier One - Network Virtualization Everywhere
  3. * Copyright (C) 2011-2016 ZeroTier, Inc. https://www.zerotier.com/
  4. *
  5. * This program is free software: you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License as published by
  7. * the Free Software Foundation, either version 3 of the License, or
  8. * (at your option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. * GNU General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  17. */
  18. #ifndef ZT_CAPABILITY_HPP
  19. #define ZT_CAPABILITY_HPP
  20. #include <stdio.h>
  21. #include <stdlib.h>
  22. #include <string.h>
  23. #include "Constants.hpp"
  24. #include "Address.hpp"
  25. #include "C25519.hpp"
  26. #include "Utils.hpp"
  27. #include "Buffer.hpp"
  28. #include "Identity.hpp"
  29. #include "../include/ZeroTierOne.h"
  30. namespace ZeroTier {
  31. class RuntimeEnvironment;
  32. /**
  33. * A set of grouped and signed network flow rules
  34. *
  35. * The use of capabilities implements capability-based security on ZeroTIer
  36. * virtual networks for efficient and manageable network micro-segmentation.
  37. *
  38. * On the sending side the sender does the following for each packet:
  39. *
  40. * (1) Evaluates its capabilities in ascending order of ID to determine
  41. * which capability allows it to transmit this packet.
  42. * (2) If it has not done so lately, it then sends this capability to the
  43. * receving peer ("presents" it).
  44. * (3) The sender then sends the packet.
  45. *
  46. * On the receiving side the receiver does the following for each packet:
  47. *
  48. * (1) Evaluates the capabilities of the sender (that the sender has
  49. * presented) to determine if the sender was allowed to send this.
  50. * (2) Evaluates its own capabilities to determine if it should receive
  51. * and process this packet.
  52. * (3) If both check out, it receives the packet.
  53. *
  54. * Note that rules in capabilities can do other things as well such as TEE
  55. * or REDIRECT packets. See Filter and ZT_VirtualNetworkRule.
  56. */
  57. class Capability
  58. {
  59. public:
  60. Capability()
  61. {
  62. memset(this,0,sizeof(Capability));
  63. }
  64. /**
  65. * @param id Capability ID
  66. * @param nwid Network ID
  67. * @param expiration Expiration relative to network config timestamp
  68. * @param name Capability short name (max strlen == ZT_MAX_CAPABILITY_NAME_LENGTH, overflow ignored)
  69. * @param mccl Maximum custody chain length (1 to create non-transferrable capability)
  70. * @param rules Network flow rules for this capability
  71. * @param ruleCount Number of flow rules
  72. */
  73. Capability(uint32_t id,uint64_t nwid,uint64_t expiration,const char *name,unsigned int mccl,const ZT_VirtualNetworkRule *rules,unsigned int ruleCount)
  74. {
  75. memset(this,0,sizeof(Capability));
  76. _nwid = nwid;
  77. _expiration = expiration;
  78. _id = id;
  79. _maxCustodyChainLength = (mccl > 0) ? ((mccl < ZT_MAX_CAPABILITY_CUSTODY_CHAIN_LENGTH) ? mccl : (unsigned int)ZT_MAX_CAPABILITY_CUSTODY_CHAIN_LENGTH) : 1;
  80. _ruleCount = (ruleCount < ZT_MAX_CAPABILITY_RULES) ? ruleCount : ZT_MAX_CAPABILITY_RULES;
  81. if (_ruleCount)
  82. memcpy(_rules,rules,sizeof(ZT_VirtualNetworkRule) * _ruleCount);
  83. }
  84. /**
  85. * @return Rules -- see ruleCount() for size of array
  86. */
  87. inline const ZT_VirtualNetworkRule *rules() const { return _rules; }
  88. /**
  89. * @return Number of rules in rules()
  90. */
  91. inline unsigned int ruleCount() const { return _ruleCount; }
  92. /**
  93. * @return ID and evaluation order of this capability in network
  94. */
  95. inline uint32_t id() const { return _id; }
  96. /**
  97. * @return Network ID for which this capability was issued
  98. */
  99. inline uint64_t networkId() const { return _nwid; }
  100. /**
  101. * @return Expiration time relative to network config timestamp
  102. */
  103. inline uint64_t expiration() const { return _expiration; }
  104. /**
  105. * Sign this capability and add signature to its chain of custody
  106. *
  107. * If this returns false, this object should be considered to be
  108. * in an undefined state and should be discarded. False can be returned
  109. * if there is no more room for signatures (max chain length reached)
  110. * or if the 'from' identity does not include a secret key to allow
  111. * it to sign anything.
  112. *
  113. * @param from Signing identity (must have secret)
  114. * @param to Recipient of this signature
  115. * @return True if signature successful and chain of custody appended
  116. */
  117. inline bool sign(const Identity &from,const Address &to)
  118. {
  119. try {
  120. Buffer<(sizeof(Capability) * 2)> tmp;
  121. for(unsigned int i=0;((i<_maxCustodyChainLength)&&(i<ZT_MAX_CAPABILITY_CUSTODY_CHAIN_LENGTH));++i) {
  122. if (!(_custody[i].to)) {
  123. _custody[i].to = to;
  124. _custody[i].from = from.address();
  125. this->serialize(tmp,true);
  126. _custody[i].signature = from.sign(tmp.data(),tmp.size());
  127. return true;
  128. }
  129. }
  130. } catch ( ... ) {}
  131. return false;
  132. }
  133. /**
  134. * Verify this capability's chain of custody
  135. *
  136. * This returns a tri-state result. A return value of zero indicates that
  137. * the chain of custody is valid and all signatures are okay. A positive
  138. * return value means at least one WHOIS was issued for a missing signing
  139. * identity and we should retry later. A negative return value means that
  140. * this chain or one of its signature is BAD and this capability should
  141. * be discarded.
  142. *
  143. * Note that the entire chain is checked regardless of verifyInChain.
  144. *
  145. * @param RR Runtime environment to provide for peer lookup, etc.
  146. * @param verifyInChain Also check to ensure that this capability was at some point properly issued to this peer (if non-null)
  147. * @return 0 == OK, 1 == waiting for WHOIS, -1 == BAD signature or chain
  148. */
  149. int verify(const RuntimeEnvironment *RR,const Address &verifyInChain) const;
  150. template<unsigned int C>
  151. static inline void serializeRules(Buffer<C> &b,const ZT_VirtualNetworkRule *rules,unsigned int ruleCount)
  152. {
  153. b.append((uint16_t)ruleCount);
  154. for(unsigned int i=0;i<ruleCount;++i) {
  155. // Each rule consists of its 8-bit type followed by the size of that type's
  156. // field followed by field data. The inclusion of the size will allow non-supported
  157. // rules to be ignored but still parsed.
  158. b.append((uint8_t)rules[i].t);
  159. switch((ZT_VirtualNetworkRuleType)(rules[i].t & 0x7f)) {
  160. //case ZT_NETWORK_RULE_ACTION_DROP:
  161. //case ZT_NETWORK_RULE_ACTION_ACCEPT:
  162. default:
  163. b.append((uint8_t)0);
  164. break;
  165. case ZT_NETWORK_RULE_ACTION_TEE:
  166. case ZT_NETWORK_RULE_ACTION_REDIRECT:
  167. case ZT_NETWORK_RULE_MATCH_SOURCE_ZEROTIER_ADDRESS:
  168. case ZT_NETWORK_RULE_MATCH_DEST_ZEROTIER_ADDRESS:
  169. b.append((uint8_t)5);
  170. Address(rules[i].v.zt).appendTo(b);
  171. break;
  172. case ZT_NETWORK_RULE_MATCH_VLAN_ID:
  173. b.append((uint8_t)2);
  174. b.append((uint16_t)rules[i].v.vlanId);
  175. break;
  176. case ZT_NETWORK_RULE_MATCH_VLAN_PCP:
  177. b.append((uint8_t)1);
  178. b.append((uint8_t)rules[i].v.vlanPcp);
  179. break;
  180. case ZT_NETWORK_RULE_MATCH_VLAN_DEI:
  181. b.append((uint8_t)1);
  182. b.append((uint8_t)rules[i].v.vlanDei);
  183. break;
  184. case ZT_NETWORK_RULE_MATCH_ETHERTYPE:
  185. b.append((uint8_t)2);
  186. b.append((uint16_t)rules[i].v.etherType);
  187. break;
  188. case ZT_NETWORK_RULE_MATCH_MAC_SOURCE:
  189. case ZT_NETWORK_RULE_MATCH_MAC_DEST:
  190. b.append((uint8_t)6);
  191. b.append(rules[i].v.mac,6);
  192. break;
  193. case ZT_NETWORK_RULE_MATCH_IPV4_SOURCE:
  194. case ZT_NETWORK_RULE_MATCH_IPV4_DEST:
  195. b.append((uint8_t)5);
  196. b.append(&(rules[i].v.ipv4.ip),4);
  197. b.append((uint8_t)rules[i].v.ipv4.mask);
  198. break;
  199. case ZT_NETWORK_RULE_MATCH_IPV6_SOURCE:
  200. case ZT_NETWORK_RULE_MATCH_IPV6_DEST:
  201. b.append((uint8_t)17);
  202. b.append(rules[i].v.ipv6.ip,16);
  203. b.append((uint8_t)rules[i].v.ipv6.mask);
  204. break;
  205. case ZT_NETWORK_RULE_MATCH_IP_TOS:
  206. b.append((uint8_t)1);
  207. b.append((uint8_t)rules[i].v.ipTos);
  208. break;
  209. case ZT_NETWORK_RULE_MATCH_IP_PROTOCOL:
  210. b.append((uint8_t)1);
  211. b.append((uint8_t)rules[i].v.ipProtocol);
  212. break;
  213. case ZT_NETWORK_RULE_MATCH_IP_SOURCE_PORT_RANGE:
  214. case ZT_NETWORK_RULE_MATCH_IP_DEST_PORT_RANGE:
  215. b.append((uint8_t)4);
  216. b.append((uint16_t)rules[i].v.port[0]);
  217. b.append((uint16_t)rules[i].v.port[1]);
  218. break;
  219. case ZT_NETWORK_RULE_MATCH_CHARACTERISTICS:
  220. b.append((uint8_t)16);
  221. b.append((uint64_t)rules[i].v.characteristics[0]);
  222. b.append((uint64_t)rules[i].v.characteristics[1]);
  223. break;
  224. case ZT_NETWORK_RULE_MATCH_FRAME_SIZE_RANGE:
  225. b.append((uint8_t)4);
  226. b.append((uint16_t)rules[i].v.frameSize[0]);
  227. b.append((uint16_t)rules[i].v.frameSize[1]);
  228. break;
  229. case ZT_NETWORK_RULE_MATCH_TAG_VALUE_RANGE:
  230. b.append((uint8_t)12);
  231. b.append((uint32_t)rules[i].v.tag.id);
  232. b.append((uint32_t)rules[i].v.tag.value[0]);
  233. b.append((uint32_t)rules[i].v.tag.value[1]);
  234. break;
  235. case ZT_NETWORK_RULE_MATCH_TAG_VALUE_BITS_ALL:
  236. case ZT_NETWORK_RULE_MATCH_TAG_VALUE_BITS_ANY:
  237. b.append((uint8_t)8);
  238. b.append((uint32_t)rules[i].v.tag.id);
  239. b.append((uint32_t)rules[i].v.tag.value[0]);
  240. break;
  241. }
  242. }
  243. }
  244. template<unsigned int C>
  245. inline void serialize(Buffer<C> &b,const bool forSign = false) const
  246. {
  247. if (forSign) b.append((uint64_t)0x7f7f7f7f7f7f7f7fULL);
  248. b.append(_id);
  249. b.append(_nwid);
  250. b.append(_expiration);
  251. serializeRules(b,_rules,_ruleCount);
  252. b.append((uint8_t)_maxCustodyChainLength);
  253. for(unsigned int i=0;;++i) {
  254. if ((i < _maxCustodyChainLength)&&(i < ZT_MAX_CAPABILITY_CUSTODY_CHAIN_LENGTH)&&(_custody[i].to)) {
  255. _custody[i].to.appendTo(b);
  256. _custody[i].from.appendTo(b);
  257. if (!forSign) {
  258. b.append((uint8_t)1); // 1 == Ed25519 signature
  259. b.append((uint16_t)ZT_C25519_SIGNATURE_LEN); // length of signature
  260. b.append(_custody[i].signature.data,ZT_C25519_SIGNATURE_LEN);
  261. }
  262. } else {
  263. b.append((unsigned char)0,ZT_ADDRESS_LENGTH); // zero 'to' terminates chain
  264. break;
  265. }
  266. }
  267. // This is the size of any additional fields. If it is nonzero,
  268. // the last 2 bytes of the next field will be another size field.
  269. b.append((uint16_t)0);
  270. if (forSign) b.append((uint64_t)0x7f7f7f7f7f7f7f7fULL);
  271. }
  272. template<unsigned int C>
  273. static inline void deserializeRules(const Buffer<C> &b,unsigned int &p,ZT_VirtualNetworkRule *rules,unsigned int &ruleCount,const unsigned int maxRuleCount)
  274. {
  275. ruleCount = b.template at<uint16_t>(p); p += 2;
  276. if (ruleCount > maxRuleCount)
  277. throw std::runtime_error("rule count overflow");
  278. for(unsigned int i=0;i<ruleCount;++i) {
  279. rules[i].t = (uint8_t)b[p++];
  280. const unsigned int fieldLen = (unsigned int)b[p++];
  281. switch((ZT_VirtualNetworkRuleType)(rules[i].t & 0x7f)) {
  282. default:
  283. break;
  284. case ZT_NETWORK_RULE_ACTION_TEE:
  285. case ZT_NETWORK_RULE_ACTION_REDIRECT:
  286. case ZT_NETWORK_RULE_MATCH_SOURCE_ZEROTIER_ADDRESS:
  287. case ZT_NETWORK_RULE_MATCH_DEST_ZEROTIER_ADDRESS:
  288. rules[i].v.zt = Address(b.field(p,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH).toInt();
  289. break;
  290. case ZT_NETWORK_RULE_MATCH_VLAN_ID:
  291. rules[i].v.vlanId = b.template at<uint16_t>(p);
  292. break;
  293. case ZT_NETWORK_RULE_MATCH_VLAN_PCP:
  294. rules[i].v.vlanPcp = (uint8_t)b[p];
  295. break;
  296. case ZT_NETWORK_RULE_MATCH_VLAN_DEI:
  297. rules[i].v.vlanDei = (uint8_t)b[p];
  298. break;
  299. case ZT_NETWORK_RULE_MATCH_ETHERTYPE:
  300. rules[i].v.etherType = b.template at<uint16_t>(p);
  301. break;
  302. case ZT_NETWORK_RULE_MATCH_MAC_SOURCE:
  303. case ZT_NETWORK_RULE_MATCH_MAC_DEST:
  304. memcpy(rules[i].v.mac,b.field(p,6),6);
  305. break;
  306. case ZT_NETWORK_RULE_MATCH_IPV4_SOURCE:
  307. case ZT_NETWORK_RULE_MATCH_IPV4_DEST:
  308. memcpy(&(rules[i].v.ipv4.ip),b.field(p,4),4);
  309. rules[i].v.ipv4.mask = (uint8_t)b[p + 4];
  310. break;
  311. case ZT_NETWORK_RULE_MATCH_IPV6_SOURCE:
  312. case ZT_NETWORK_RULE_MATCH_IPV6_DEST:
  313. memcpy(rules[i].v.ipv6.ip,b.field(p,16),16);
  314. rules[i].v.ipv6.mask = (uint8_t)b[p + 16];
  315. break;
  316. case ZT_NETWORK_RULE_MATCH_IP_TOS:
  317. rules[i].v.ipTos = (uint8_t)b[p];
  318. break;
  319. case ZT_NETWORK_RULE_MATCH_IP_PROTOCOL:
  320. rules[i].v.ipProtocol = (uint8_t)b[p];
  321. break;
  322. case ZT_NETWORK_RULE_MATCH_IP_SOURCE_PORT_RANGE:
  323. case ZT_NETWORK_RULE_MATCH_IP_DEST_PORT_RANGE:
  324. rules[i].v.port[0] = b.template at<uint16_t>(p);
  325. rules[i].v.port[1] = b.template at<uint16_t>(p + 2);
  326. break;
  327. case ZT_NETWORK_RULE_MATCH_CHARACTERISTICS:
  328. rules[i].v.characteristics[0] = b.template at<uint64_t>(p);
  329. rules[i].v.characteristics[1] = b.template at<uint64_t>(p + 8);
  330. break;
  331. case ZT_NETWORK_RULE_MATCH_FRAME_SIZE_RANGE:
  332. rules[i].v.frameSize[0] = b.template at<uint16_t>(p);
  333. rules[i].v.frameSize[0] = b.template at<uint16_t>(p + 2);
  334. break;
  335. case ZT_NETWORK_RULE_MATCH_TAG_VALUE_RANGE:
  336. rules[i].v.tag.id = b.template at<uint32_t>(p);
  337. rules[i].v.tag.value[0] = b.template at<uint32_t>(p + 4);
  338. rules[i].v.tag.value[1] = b.template at<uint32_t>(p + 8);
  339. break;
  340. case ZT_NETWORK_RULE_MATCH_TAG_VALUE_BITS_ALL:
  341. case ZT_NETWORK_RULE_MATCH_TAG_VALUE_BITS_ANY:
  342. rules[i].v.tag.id = b.template at<uint32_t>(p);
  343. rules[i].v.tag.value[0] = b.template at<uint32_t>(p + 4);
  344. break;
  345. }
  346. p += fieldLen;
  347. }
  348. }
  349. template<unsigned int C>
  350. inline unsigned int deserialize(const Buffer<C> &b,unsigned int startAt = 0)
  351. {
  352. memset(this,0,sizeof(Capability));
  353. unsigned int p = startAt;
  354. _id = b.template at<uint32_t>(p); p += 4;
  355. _nwid = b.template at<uint64_t>(p); p += 8;
  356. _expiration = b.template at<uint64_t>(p); p += 8;
  357. deserializeRules(b,p,_rules,_ruleCount,ZT_MAX_CAPABILITY_RULES);
  358. _maxCustodyChainLength = (unsigned int)b[p++];
  359. if ((_maxCustodyChainLength < 1)||(_maxCustodyChainLength > ZT_MAX_CAPABILITY_CUSTODY_CHAIN_LENGTH))
  360. throw std::runtime_error("invalid max custody chain length");
  361. for(unsigned int i;;++i) {
  362. const Address to(b.field(p,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH); p += ZT_ADDRESS_LENGTH;
  363. if (!to)
  364. break;
  365. if ((i >= _maxCustodyChainLength)||(i >= ZT_MAX_CAPABILITY_CUSTODY_CHAIN_LENGTH))
  366. throw std::runtime_error("unterminated custody chain");
  367. _custody[i].to = to;
  368. _custody[i].from.setTo(b.field(p,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH); p += ZT_ADDRESS_LENGTH;
  369. memcpy(_custody[i].signature.data,b.field(p,ZT_C25519_SIGNATURE_LEN),ZT_C25519_SIGNATURE_LEN); p += ZT_C25519_SIGNATURE_LEN;
  370. }
  371. p += 2 + b.template at<uint16_t>(p);
  372. if (p > b.size())
  373. throw std::runtime_error("extended field overflow");
  374. return (p - startAt);
  375. }
  376. // Provides natural sort order by ID
  377. inline bool operator<(const Capability &c) const { return (_id < c._id); }
  378. private:
  379. uint64_t _nwid;
  380. uint64_t _expiration;
  381. uint32_t _id;
  382. unsigned int _maxCustodyChainLength;
  383. unsigned int _ruleCount;
  384. ZT_VirtualNetworkRule _rules[ZT_MAX_CAPABILITY_RULES];
  385. struct {
  386. Address to;
  387. Address from;
  388. C25519::Signature signature;
  389. } _custody[ZT_MAX_CAPABILITY_CUSTODY_CHAIN_LENGTH];
  390. };
  391. } // namespace ZeroTier
  392. #endif