Capability.hpp 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429
  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 it should received this packet.
  50. * (2) Evaluates its own capabilities to determine if it should receive
  51. * 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 code 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. * Check to see if a given address is a 'to' address in the custody chain
  106. *
  107. * This does not actually do certificate checking. That must be done with verify().
  108. *
  109. * @param a Address to check
  110. * @return True if address is present
  111. */
  112. inline bool wasIssuedTo(const Address &a) const
  113. {
  114. for(unsigned int i=0;i<ZT_MAX_CAPABILITY_CUSTODY_CHAIN_LENGTH;++i) {
  115. if (_custody[i].to == a)
  116. return true;
  117. }
  118. return false;
  119. }
  120. /**
  121. * Sign this capability and add signature to its chain of custody
  122. *
  123. * If this returns false, this object should be considered to be
  124. * in an undefined state and should be discarded. False can be returned
  125. * if there is no more room for signatures (max chain length reached)
  126. * or if the 'from' identity does not include a secret key to allow
  127. * it to sign anything.
  128. *
  129. * @param from Signing identity (must have secret)
  130. * @param to Recipient of this signature
  131. * @return True if signature successful and chain of custody appended
  132. */
  133. inline bool sign(const Identity &from,const Address &to)
  134. {
  135. try {
  136. for(unsigned int i=0;((i<_maxCustodyChainLength)&&(i<ZT_MAX_CAPABILITY_CUSTODY_CHAIN_LENGTH));++i) {
  137. if (!(_custody[i].to)) {
  138. Buffer<(sizeof(Capability) * 2)> tmp;
  139. this->serialize(tmp,true);
  140. _custody[i].to = to;
  141. _custody[i].from = from.address();
  142. _custody[i].signature = from.sign(tmp.data(),tmp.size());
  143. return true;
  144. }
  145. }
  146. } catch ( ... ) {}
  147. return false;
  148. }
  149. /**
  150. * Verify this capability's chain of custody and signatures
  151. *
  152. * @param RR Runtime environment to provide for peer lookup, etc.
  153. * @return 0 == OK, 1 == waiting for WHOIS, -1 == BAD signature or chain
  154. */
  155. int verify(const RuntimeEnvironment *RR) const;
  156. template<unsigned int C>
  157. static inline void serializeRules(Buffer<C> &b,const ZT_VirtualNetworkRule *rules,unsigned int ruleCount)
  158. {
  159. b.append((uint16_t)ruleCount);
  160. for(unsigned int i=0;i<ruleCount;++i) {
  161. // Each rule consists of its 8-bit type followed by the size of that type's
  162. // field followed by field data. The inclusion of the size will allow non-supported
  163. // rules to be ignored but still parsed.
  164. b.append((uint8_t)rules[i].t);
  165. switch((ZT_VirtualNetworkRuleType)(rules[i].t & 0x7f)) {
  166. //case ZT_NETWORK_RULE_ACTION_DROP:
  167. //case ZT_NETWORK_RULE_ACTION_ACCEPT:
  168. default:
  169. b.append((uint8_t)0);
  170. break;
  171. case ZT_NETWORK_RULE_ACTION_TEE:
  172. case ZT_NETWORK_RULE_ACTION_REDIRECT:
  173. case ZT_NETWORK_RULE_MATCH_SOURCE_ZEROTIER_ADDRESS:
  174. case ZT_NETWORK_RULE_MATCH_DEST_ZEROTIER_ADDRESS:
  175. b.append((uint8_t)5);
  176. Address(rules[i].v.zt).appendTo(b);
  177. break;
  178. case ZT_NETWORK_RULE_MATCH_VLAN_ID:
  179. b.append((uint8_t)2);
  180. b.append((uint16_t)rules[i].v.vlanId);
  181. break;
  182. case ZT_NETWORK_RULE_MATCH_VLAN_PCP:
  183. b.append((uint8_t)1);
  184. b.append((uint8_t)rules[i].v.vlanPcp);
  185. break;
  186. case ZT_NETWORK_RULE_MATCH_VLAN_DEI:
  187. b.append((uint8_t)1);
  188. b.append((uint8_t)rules[i].v.vlanDei);
  189. break;
  190. case ZT_NETWORK_RULE_MATCH_ETHERTYPE:
  191. b.append((uint8_t)2);
  192. b.append((uint16_t)rules[i].v.etherType);
  193. break;
  194. case ZT_NETWORK_RULE_MATCH_MAC_SOURCE:
  195. case ZT_NETWORK_RULE_MATCH_MAC_DEST:
  196. b.append((uint8_t)6);
  197. b.append(rules[i].v.mac,6);
  198. break;
  199. case ZT_NETWORK_RULE_MATCH_IPV4_SOURCE:
  200. case ZT_NETWORK_RULE_MATCH_IPV4_DEST:
  201. b.append((uint8_t)5);
  202. b.append(&(rules[i].v.ipv4.ip),4);
  203. b.append((uint8_t)rules[i].v.ipv4.mask);
  204. break;
  205. case ZT_NETWORK_RULE_MATCH_IPV6_SOURCE:
  206. case ZT_NETWORK_RULE_MATCH_IPV6_DEST:
  207. b.append((uint8_t)17);
  208. b.append(rules[i].v.ipv6.ip,16);
  209. b.append((uint8_t)rules[i].v.ipv6.mask);
  210. break;
  211. case ZT_NETWORK_RULE_MATCH_IP_TOS:
  212. b.append((uint8_t)1);
  213. b.append((uint8_t)rules[i].v.ipTos);
  214. break;
  215. case ZT_NETWORK_RULE_MATCH_IP_PROTOCOL:
  216. b.append((uint8_t)1);
  217. b.append((uint8_t)rules[i].v.ipProtocol);
  218. break;
  219. case ZT_NETWORK_RULE_MATCH_IP_SOURCE_PORT_RANGE:
  220. case ZT_NETWORK_RULE_MATCH_IP_DEST_PORT_RANGE:
  221. b.append((uint8_t)4);
  222. b.append((uint16_t)rules[i].v.port[0]);
  223. b.append((uint16_t)rules[i].v.port[1]);
  224. break;
  225. case ZT_NETWORK_RULE_MATCH_CHARACTERISTICS:
  226. b.append((uint8_t)16);
  227. b.append((uint64_t)rules[i].v.characteristics[0]);
  228. b.append((uint64_t)rules[i].v.characteristics[1]);
  229. break;
  230. case ZT_NETWORK_RULE_MATCH_FRAME_SIZE_RANGE:
  231. b.append((uint8_t)4);
  232. b.append((uint16_t)rules[i].v.frameSize[0]);
  233. b.append((uint16_t)rules[i].v.frameSize[1]);
  234. break;
  235. case ZT_NETWORK_RULE_MATCH_TAGS_SAMENESS:
  236. case ZT_NETWORK_RULE_MATCH_TAGS_BITWISE_AND:
  237. case ZT_NETWORK_RULE_MATCH_TAGS_BITWISE_OR:
  238. case ZT_NETWORK_RULE_MATCH_TAGS_BITWISE_XOR:
  239. b.append((uint8_t)8);
  240. b.append((uint32_t)rules[i].v.tag.id);
  241. b.append((uint32_t)rules[i].v.tag.value);
  242. break;
  243. }
  244. }
  245. }
  246. template<unsigned int C>
  247. inline void serialize(Buffer<C> &b,const bool forSign = false) const
  248. {
  249. if (forSign) b.append((uint64_t)0x7f7f7f7f7f7f7f7fULL);
  250. b.append(_id);
  251. b.append(_nwid);
  252. b.append(_expiration);
  253. serializeRules(b,_rules,_ruleCount);
  254. b.append((uint8_t)_maxCustodyChainLength);
  255. if (!forSign) {
  256. for(unsigned int i=0;;++i) {
  257. if ((i < _maxCustodyChainLength)&&(i < ZT_MAX_CAPABILITY_CUSTODY_CHAIN_LENGTH)&&(_custody[i].to)) {
  258. _custody[i].to.appendTo(b);
  259. _custody[i].from.appendTo(b);
  260. b.append((uint8_t)1); // 1 == Ed25519 signature
  261. b.append((uint16_t)ZT_C25519_SIGNATURE_LEN); // length of signature
  262. b.append(_custody[i].signature.data,ZT_C25519_SIGNATURE_LEN);
  263. } else {
  264. b.append((unsigned char)0,ZT_ADDRESS_LENGTH); // zero 'to' terminates chain
  265. break;
  266. }
  267. }
  268. }
  269. // This is the size of any additional fields. If it is nonzero,
  270. // the last 2 bytes of the next field will be another size field.
  271. b.append((uint16_t)0);
  272. if (forSign) b.append((uint64_t)0x7f7f7f7f7f7f7f7fULL);
  273. }
  274. template<unsigned int C>
  275. static inline void deserializeRules(const Buffer<C> &b,unsigned int &p,ZT_VirtualNetworkRule *rules,unsigned int &ruleCount,const unsigned int maxRuleCount)
  276. {
  277. ruleCount = b.template at<uint16_t>(p); p += 2;
  278. if (ruleCount > maxRuleCount)
  279. throw std::runtime_error("rule count overflow");
  280. for(unsigned int i=0;i<ruleCount;++i) {
  281. rules[i].t = (uint8_t)b[p++];
  282. const unsigned int fieldLen = (unsigned int)b[p++];
  283. switch((ZT_VirtualNetworkRuleType)(rules[i].t & 0x7f)) {
  284. default:
  285. break;
  286. case ZT_NETWORK_RULE_ACTION_TEE:
  287. case ZT_NETWORK_RULE_ACTION_REDIRECT:
  288. case ZT_NETWORK_RULE_MATCH_SOURCE_ZEROTIER_ADDRESS:
  289. case ZT_NETWORK_RULE_MATCH_DEST_ZEROTIER_ADDRESS:
  290. rules[i].v.zt = Address(b.field(p,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH).toInt();
  291. break;
  292. case ZT_NETWORK_RULE_MATCH_VLAN_ID:
  293. rules[i].v.vlanId = b.template at<uint16_t>(p);
  294. break;
  295. case ZT_NETWORK_RULE_MATCH_VLAN_PCP:
  296. rules[i].v.vlanPcp = (uint8_t)b[p];
  297. break;
  298. case ZT_NETWORK_RULE_MATCH_VLAN_DEI:
  299. rules[i].v.vlanDei = (uint8_t)b[p];
  300. break;
  301. case ZT_NETWORK_RULE_MATCH_ETHERTYPE:
  302. rules[i].v.etherType = b.template at<uint16_t>(p);
  303. break;
  304. case ZT_NETWORK_RULE_MATCH_MAC_SOURCE:
  305. case ZT_NETWORK_RULE_MATCH_MAC_DEST:
  306. memcpy(rules[i].v.mac,b.field(p,6),6);
  307. break;
  308. case ZT_NETWORK_RULE_MATCH_IPV4_SOURCE:
  309. case ZT_NETWORK_RULE_MATCH_IPV4_DEST:
  310. memcpy(&(rules[i].v.ipv4.ip),b.field(p,4),4);
  311. rules[i].v.ipv4.mask = (uint8_t)b[p + 4];
  312. break;
  313. case ZT_NETWORK_RULE_MATCH_IPV6_SOURCE:
  314. case ZT_NETWORK_RULE_MATCH_IPV6_DEST:
  315. memcpy(rules[i].v.ipv6.ip,b.field(p,16),16);
  316. rules[i].v.ipv6.mask = (uint8_t)b[p + 16];
  317. break;
  318. case ZT_NETWORK_RULE_MATCH_IP_TOS:
  319. rules[i].v.ipTos = (uint8_t)b[p];
  320. break;
  321. case ZT_NETWORK_RULE_MATCH_IP_PROTOCOL:
  322. rules[i].v.ipProtocol = (uint8_t)b[p];
  323. break;
  324. case ZT_NETWORK_RULE_MATCH_IP_SOURCE_PORT_RANGE:
  325. case ZT_NETWORK_RULE_MATCH_IP_DEST_PORT_RANGE:
  326. rules[i].v.port[0] = b.template at<uint16_t>(p);
  327. rules[i].v.port[1] = b.template at<uint16_t>(p + 2);
  328. break;
  329. case ZT_NETWORK_RULE_MATCH_CHARACTERISTICS:
  330. rules[i].v.characteristics[0] = b.template at<uint64_t>(p);
  331. rules[i].v.characteristics[1] = b.template at<uint64_t>(p + 8);
  332. break;
  333. case ZT_NETWORK_RULE_MATCH_FRAME_SIZE_RANGE:
  334. rules[i].v.frameSize[0] = b.template at<uint16_t>(p);
  335. rules[i].v.frameSize[0] = b.template at<uint16_t>(p + 2);
  336. break;
  337. case ZT_NETWORK_RULE_MATCH_TAGS_SAMENESS:
  338. case ZT_NETWORK_RULE_MATCH_TAGS_BITWISE_AND:
  339. case ZT_NETWORK_RULE_MATCH_TAGS_BITWISE_OR:
  340. case ZT_NETWORK_RULE_MATCH_TAGS_BITWISE_XOR:
  341. rules[i].v.tag.id = b.template at<uint32_t>(p);
  342. rules[i].v.tag.value = b.template at<uint32_t>(p + 4);
  343. break;
  344. }
  345. p += fieldLen;
  346. }
  347. }
  348. template<unsigned int C>
  349. inline unsigned int deserialize(const Buffer<C> &b,unsigned int startAt = 0)
  350. {
  351. memset(this,0,sizeof(Capability));
  352. unsigned int p = startAt;
  353. _id = b.template at<uint32_t>(p); p += 4;
  354. _nwid = b.template at<uint64_t>(p); p += 8;
  355. _expiration = b.template at<uint64_t>(p); p += 8;
  356. deserializeRules(b,p,_rules,_ruleCount,ZT_MAX_CAPABILITY_RULES);
  357. _maxCustodyChainLength = (unsigned int)b[p++];
  358. if ((_maxCustodyChainLength < 1)||(_maxCustodyChainLength > ZT_MAX_CAPABILITY_CUSTODY_CHAIN_LENGTH))
  359. throw std::runtime_error("invalid max custody chain length");
  360. for(unsigned int i;;++i) {
  361. const Address to(b.field(p,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH); p += ZT_ADDRESS_LENGTH;
  362. if (!to)
  363. break;
  364. if ((i >= _maxCustodyChainLength)||(i >= ZT_MAX_CAPABILITY_CUSTODY_CHAIN_LENGTH))
  365. throw std::runtime_error("unterminated custody chain");
  366. _custody[i].to = to;
  367. _custody[i].from.setTo(b.field(p,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH); p += ZT_ADDRESS_LENGTH;
  368. memcpy(_custody[i].signature.data,b.field(p,ZT_C25519_SIGNATURE_LEN),ZT_C25519_SIGNATURE_LEN); p += ZT_C25519_SIGNATURE_LEN;
  369. }
  370. p += 2 + b.template at<uint16_t>(p);
  371. if (p > b.size())
  372. throw std::runtime_error("extended field overflow");
  373. return (p - startAt);
  374. }
  375. // Provides natural sort order by ID
  376. inline bool operator<(const Capability &c) const { return (_id < c._id); }
  377. inline bool operator==(const Capability &c) const { return (memcmp(this,&c,sizeof(Capability)) == 0); }
  378. inline bool operator!=(const Capability &c) const { return (memcmp(this,&c,sizeof(Capability)) != 0); }
  379. private:
  380. uint64_t _nwid;
  381. uint64_t _expiration;
  382. uint32_t _id;
  383. unsigned int _maxCustodyChainLength;
  384. unsigned int _ruleCount;
  385. ZT_VirtualNetworkRule _rules[ZT_MAX_CAPABILITY_RULES];
  386. struct {
  387. Address to;
  388. Address from;
  389. C25519::Signature signature;
  390. } _custody[ZT_MAX_CAPABILITY_CUSTODY_CHAIN_LENGTH];
  391. };
  392. } // namespace ZeroTier
  393. #endif