blob: 30e97f440e801f9a2187a31db5a592b10f227d2f [file] [log] [blame]
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +01001/*
2 * Copyright (C) 2014 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
17#define LOG_TAG "keystore"
18
19#include "keymaster_enforcement.h"
20
21#include <assert.h>
22#include <inttypes.h>
23#include <limits.h>
24#include <string.h>
25
26#include <openssl/evp.h>
27
28#include <cutils/log.h>
29#include <hardware/hw_auth_token.h>
30#include <list>
31
Janis Danisevskis8f737ad2017-11-21 12:30:15 -080032#include <keystore/keystore_hidl_support.h>
33
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +010034namespace keystore {
35
36class AccessTimeMap {
37 public:
38 explicit AccessTimeMap(uint32_t max_size) : max_size_(max_size) {}
39
40 /* If the key is found, returns true and fills \p last_access_time. If not found returns
41 * false. */
42 bool LastKeyAccessTime(km_id_t keyid, uint32_t* last_access_time) const;
43
44 /* Updates the last key access time with the currentTime parameter. Adds the key if
45 * needed, returning false if key cannot be added because list is full. */
46 bool UpdateKeyAccessTime(km_id_t keyid, uint32_t current_time, uint32_t timeout);
47
48 private:
49 struct AccessTime {
50 km_id_t keyid;
51 uint32_t access_time;
52 uint32_t timeout;
53 };
54 std::list<AccessTime> last_access_list_;
55 const uint32_t max_size_;
56};
57
58class AccessCountMap {
59 public:
60 explicit AccessCountMap(uint32_t max_size) : max_size_(max_size) {}
61
62 /* If the key is found, returns true and fills \p count. If not found returns
63 * false. */
64 bool KeyAccessCount(km_id_t keyid, uint32_t* count) const;
65
66 /* Increments key access count, adding an entry if the key has never been used. Returns
67 * false if the list has reached maximum size. */
68 bool IncrementKeyAccessCount(km_id_t keyid);
69
70 private:
71 struct AccessCount {
72 km_id_t keyid;
73 uint64_t access_count;
74 };
75 std::list<AccessCount> access_count_list_;
76 const uint32_t max_size_;
77};
78
79bool is_public_key_algorithm(const AuthorizationSet& auth_set) {
80 auto algorithm = auth_set.GetTagValue(TAG_ALGORITHM);
81 return algorithm.isOk() &&
82 (algorithm.value() == Algorithm::RSA || algorithm.value() == Algorithm::EC);
83}
84
85static ErrorCode authorized_purpose(const KeyPurpose purpose, const AuthorizationSet& auth_set) {
86 switch (purpose) {
87 case KeyPurpose::VERIFY:
88 case KeyPurpose::ENCRYPT:
89 case KeyPurpose::SIGN:
90 case KeyPurpose::DECRYPT:
91 if (auth_set.Contains(TAG_PURPOSE, purpose)) return ErrorCode::OK;
92 return ErrorCode::INCOMPATIBLE_PURPOSE;
93
94 default:
95 return ErrorCode::UNSUPPORTED_PURPOSE;
96 }
97}
98
99inline bool is_origination_purpose(KeyPurpose purpose) {
100 return purpose == KeyPurpose::ENCRYPT || purpose == KeyPurpose::SIGN;
101}
102
103inline bool is_usage_purpose(KeyPurpose purpose) {
104 return purpose == KeyPurpose::DECRYPT || purpose == KeyPurpose::VERIFY;
105}
106
107KeymasterEnforcement::KeymasterEnforcement(uint32_t max_access_time_map_size,
108 uint32_t max_access_count_map_size)
109 : access_time_map_(new (std::nothrow) AccessTimeMap(max_access_time_map_size)),
110 access_count_map_(new (std::nothrow) AccessCountMap(max_access_count_map_size)) {}
111
112KeymasterEnforcement::~KeymasterEnforcement() {
113 delete access_time_map_;
114 delete access_count_map_;
115}
116
117ErrorCode KeymasterEnforcement::AuthorizeOperation(const KeyPurpose purpose, const km_id_t keyid,
118 const AuthorizationSet& auth_set,
119 const AuthorizationSet& operation_params,
Shawn Willden0329a822017-12-04 13:55:14 -0700120 const HardwareAuthToken& auth_token,
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100121 uint64_t op_handle, bool is_begin_operation) {
122 if (is_public_key_algorithm(auth_set)) {
123 switch (purpose) {
124 case KeyPurpose::ENCRYPT:
125 case KeyPurpose::VERIFY:
126 /* Public key operations are always authorized. */
127 return ErrorCode::OK;
128
129 case KeyPurpose::DECRYPT:
130 case KeyPurpose::SIGN:
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100131 break;
Shawn Willden0329a822017-12-04 13:55:14 -0700132
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100133 case KeyPurpose::WRAP_KEY:
134 return ErrorCode::INCOMPATIBLE_PURPOSE;
135 };
136 };
137
138 if (is_begin_operation)
Shawn Willden0329a822017-12-04 13:55:14 -0700139 return AuthorizeBegin(purpose, keyid, auth_set, operation_params, auth_token);
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100140 else
Shawn Willden0329a822017-12-04 13:55:14 -0700141 return AuthorizeUpdateOrFinish(auth_set, auth_token, op_handle);
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100142}
143
144// For update and finish the only thing to check is user authentication, and then only if it's not
145// timeout-based.
146ErrorCode KeymasterEnforcement::AuthorizeUpdateOrFinish(const AuthorizationSet& auth_set,
Shawn Willden0329a822017-12-04 13:55:14 -0700147 const HardwareAuthToken& auth_token,
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100148 uint64_t op_handle) {
149 int auth_type_index = -1;
150 for (size_t pos = 0; pos < auth_set.size(); ++pos) {
151 switch (auth_set[pos].tag) {
152 case Tag::NO_AUTH_REQUIRED:
153 case Tag::AUTH_TIMEOUT:
154 // If no auth is required or if auth is timeout-based, we have nothing to check.
155 return ErrorCode::OK;
156
157 case Tag::USER_AUTH_TYPE:
158 auth_type_index = pos;
159 break;
160
161 default:
162 break;
163 }
164 }
165
166 // Note that at this point we should be able to assume that authentication is required, because
167 // authentication is required if KM_TAG_NO_AUTH_REQUIRED is absent. However, there are legacy
168 // keys which have no authentication-related tags, so we assume that absence is equivalent to
169 // presence of KM_TAG_NO_AUTH_REQUIRED.
170 //
171 // So, if we found KM_TAG_USER_AUTH_TYPE or if we find KM_TAG_USER_SECURE_ID then authentication
172 // is required. If we find neither, then we assume authentication is not required and return
173 // success.
174 bool authentication_required = (auth_type_index != -1);
175 for (auto& param : auth_set) {
176 auto user_secure_id = authorizationValue(TAG_USER_SECURE_ID, param);
177 if (user_secure_id.isOk()) {
178 authentication_required = true;
179 int auth_timeout_index = -1;
Shawn Willden0329a822017-12-04 13:55:14 -0700180 if (auth_token.mac.size() &&
181 AuthTokenMatches(auth_set, auth_token, user_secure_id.value(), auth_type_index,
182 auth_timeout_index, op_handle, false /* is_begin_operation */))
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100183 return ErrorCode::OK;
184 }
185 }
186
187 if (authentication_required) return ErrorCode::KEY_USER_NOT_AUTHENTICATED;
188
189 return ErrorCode::OK;
190}
191
192ErrorCode KeymasterEnforcement::AuthorizeBegin(const KeyPurpose purpose, const km_id_t keyid,
193 const AuthorizationSet& auth_set,
Shawn Willden0329a822017-12-04 13:55:14 -0700194 const AuthorizationSet& operation_params,
195 NullOr<const HardwareAuthToken&> auth_token) {
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100196 // Find some entries that may be needed to handle KM_TAG_USER_SECURE_ID
197 int auth_timeout_index = -1;
198 int auth_type_index = -1;
199 int no_auth_required_index = -1;
200 for (size_t pos = 0; pos < auth_set.size(); ++pos) {
201 switch (auth_set[pos].tag) {
202 case Tag::AUTH_TIMEOUT:
203 auth_timeout_index = pos;
204 break;
205 case Tag::USER_AUTH_TYPE:
206 auth_type_index = pos;
207 break;
208 case Tag::NO_AUTH_REQUIRED:
209 no_auth_required_index = pos;
210 break;
211 default:
212 break;
213 }
214 }
215
216 ErrorCode error = authorized_purpose(purpose, auth_set);
217 if (error != ErrorCode::OK) return error;
218
219 // If successful, and if key has a min time between ops, this will be set to the time limit
220 uint32_t min_ops_timeout = UINT32_MAX;
221
222 bool update_access_count = false;
223 bool caller_nonce_authorized_by_key = false;
224 bool authentication_required = false;
225 bool auth_token_matched = false;
226
227 for (auto& param : auth_set) {
228
229 // KM_TAG_PADDING_OLD and KM_TAG_DIGEST_OLD aren't actually members of the enum, so we can't
230 // switch on them. There's nothing to validate for them, though, so just ignore them.
231 if (int32_t(param.tag) == KM_TAG_PADDING_OLD || int32_t(param.tag) == KM_TAG_DIGEST_OLD)
232 continue;
233
234 switch (param.tag) {
235
236 case Tag::ACTIVE_DATETIME: {
237 auto date = authorizationValue(TAG_ACTIVE_DATETIME, param);
238 if (date.isOk() && !activation_date_valid(date.value()))
239 return ErrorCode::KEY_NOT_YET_VALID;
240 break;
241 }
242 case Tag::ORIGINATION_EXPIRE_DATETIME: {
243 auto date = authorizationValue(TAG_ORIGINATION_EXPIRE_DATETIME, param);
244 if (is_origination_purpose(purpose) && date.isOk() &&
245 expiration_date_passed(date.value()))
246 return ErrorCode::KEY_EXPIRED;
247 break;
248 }
249 case Tag::USAGE_EXPIRE_DATETIME: {
250 auto date = authorizationValue(TAG_USAGE_EXPIRE_DATETIME, param);
251 if (is_usage_purpose(purpose) && date.isOk() && expiration_date_passed(date.value()))
252 return ErrorCode::KEY_EXPIRED;
253 break;
254 }
255 case Tag::MIN_SECONDS_BETWEEN_OPS: {
256 auto min_ops_timeout = authorizationValue(TAG_MIN_SECONDS_BETWEEN_OPS, param);
257 if (min_ops_timeout.isOk() && !MinTimeBetweenOpsPassed(min_ops_timeout.value(), keyid))
258 return ErrorCode::KEY_RATE_LIMIT_EXCEEDED;
259 break;
260 }
261 case Tag::MAX_USES_PER_BOOT: {
262 auto max_users = authorizationValue(TAG_MAX_USES_PER_BOOT, param);
263 update_access_count = true;
264 if (max_users.isOk() && !MaxUsesPerBootNotExceeded(keyid, max_users.value()))
265 return ErrorCode::KEY_MAX_OPS_EXCEEDED;
266 break;
267 }
268 case Tag::USER_SECURE_ID:
269 if (no_auth_required_index != -1) {
270 // Key has both KM_TAG_USER_SECURE_ID and KM_TAG_NO_AUTH_REQUIRED
271 return ErrorCode::INVALID_KEY_BLOB;
272 }
273
274 if (auth_timeout_index != -1) {
275 auto secure_id = authorizationValue(TAG_USER_SECURE_ID, param);
276 authentication_required = true;
Shawn Willden0329a822017-12-04 13:55:14 -0700277 if (secure_id.isOk() && auth_token.isOk() &&
278 AuthTokenMatches(auth_set, auth_token.value(), secure_id.value(),
279 auth_type_index, auth_timeout_index, 0 /* op_handle */,
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100280 true /* is_begin_operation */))
281 auth_token_matched = true;
282 }
283 break;
284
285 case Tag::CALLER_NONCE:
286 caller_nonce_authorized_by_key = true;
287 break;
288
289 /* Tags should never be in key auths. */
290 case Tag::INVALID:
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100291 case Tag::ROOT_OF_TRUST:
292 case Tag::APPLICATION_DATA:
293 case Tag::ATTESTATION_CHALLENGE:
294 case Tag::ATTESTATION_APPLICATION_ID:
Bartosz Fabianowskia9452d92017-01-23 22:21:11 +0100295 case Tag::ATTESTATION_ID_BRAND:
296 case Tag::ATTESTATION_ID_DEVICE:
297 case Tag::ATTESTATION_ID_PRODUCT:
298 case Tag::ATTESTATION_ID_SERIAL:
299 case Tag::ATTESTATION_ID_IMEI:
300 case Tag::ATTESTATION_ID_MEID:
Bartosz Fabianowski634a1aa2017-03-20 14:02:32 +0100301 case Tag::ATTESTATION_ID_MANUFACTURER:
302 case Tag::ATTESTATION_ID_MODEL:
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100303 return ErrorCode::INVALID_KEY_BLOB;
304
305 /* Tags used for cryptographic parameters in keygen. Nothing to enforce. */
306 case Tag::PURPOSE:
307 case Tag::ALGORITHM:
308 case Tag::KEY_SIZE:
309 case Tag::BLOCK_MODE:
310 case Tag::DIGEST:
311 case Tag::MAC_LENGTH:
312 case Tag::PADDING:
313 case Tag::NONCE:
314 case Tag::MIN_MAC_LENGTH:
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100315 case Tag::EC_CURVE:
316
317 /* Tags not used for operations. */
318 case Tag::BLOB_USAGE_REQUIREMENTS:
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100319
320 /* Algorithm specific parameters not used for access control. */
321 case Tag::RSA_PUBLIC_EXPONENT:
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100322
323 /* Informational tags. */
324 case Tag::CREATION_DATETIME:
325 case Tag::ORIGIN:
Shawn Willden0329a822017-12-04 13:55:14 -0700326 case Tag::ROLLBACK_RESISTANCE:
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100327
328 /* Tags handled when KM_TAG_USER_SECURE_ID is handled */
329 case Tag::NO_AUTH_REQUIRED:
330 case Tag::USER_AUTH_TYPE:
331 case Tag::AUTH_TIMEOUT:
332
333 /* Tag to provide data to operations. */
334 case Tag::ASSOCIATED_DATA:
335
336 /* Tags that are implicitly verified by secure side */
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100337 case Tag::APPLICATION_ID:
Shawn Willden30adb492018-01-18 18:48:29 -0700338 case Tag::BOOT_PATCHLEVEL:
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100339 case Tag::OS_PATCHLEVEL:
Shawn Willden30adb492018-01-18 18:48:29 -0700340 case Tag::OS_VERSION:
Shawn Willden35b6e6c2018-01-10 09:30:12 -0700341 case Tag::TRUSTED_USER_PRESENCE_REQUIRED:
Shawn Willden30adb492018-01-18 18:48:29 -0700342 case Tag::VENDOR_PATCHLEVEL:
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100343
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100344 /* TODO(swillden): Handle these */
345 case Tag::INCLUDE_UNIQUE_ID:
346 case Tag::UNIQUE_ID:
347 case Tag::RESET_SINCE_ID_ROTATION:
348 case Tag::ALLOW_WHILE_ON_BODY:
Shawn Willden0329a822017-12-04 13:55:14 -0700349 case Tag::HARDWARE_TYPE:
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100350 break;
351
352 case Tag::BOOTLOADER_ONLY:
353 return ErrorCode::INVALID_KEY_BLOB;
354 }
355 }
356
357 if (authentication_required && !auth_token_matched) {
358 ALOGE("Auth required but no matching auth token found");
359 return ErrorCode::KEY_USER_NOT_AUTHENTICATED;
360 }
361
362 if (!caller_nonce_authorized_by_key && is_origination_purpose(purpose) &&
363 operation_params.Contains(Tag::NONCE))
364 return ErrorCode::CALLER_NONCE_PROHIBITED;
365
366 if (min_ops_timeout != UINT32_MAX) {
367 if (!access_time_map_) {
368 ALOGE("Rate-limited keys table not allocated. Rate-limited keys disabled");
369 return ErrorCode::MEMORY_ALLOCATION_FAILED;
370 }
371
372 if (!access_time_map_->UpdateKeyAccessTime(keyid, get_current_time(), min_ops_timeout)) {
373 ALOGE("Rate-limited keys table full. Entries will time out.");
374 return ErrorCode::TOO_MANY_OPERATIONS;
375 }
376 }
377
378 if (update_access_count) {
379 if (!access_count_map_) {
380 ALOGE("Usage-count limited keys tabel not allocated. Count-limited keys disabled");
381 return ErrorCode::MEMORY_ALLOCATION_FAILED;
382 }
383
384 if (!access_count_map_->IncrementKeyAccessCount(keyid)) {
385 ALOGE("Usage count-limited keys table full, until reboot.");
386 return ErrorCode::TOO_MANY_OPERATIONS;
387 }
388 }
389
390 return ErrorCode::OK;
391}
392
393class EvpMdCtx {
394 public:
395 EvpMdCtx() { EVP_MD_CTX_init(&ctx_); }
396 ~EvpMdCtx() { EVP_MD_CTX_cleanup(&ctx_); }
397
398 EVP_MD_CTX* get() { return &ctx_; }
399
400 private:
401 EVP_MD_CTX ctx_;
402};
403
404/* static */
405bool KeymasterEnforcement::CreateKeyId(const hidl_vec<uint8_t>& key_blob, km_id_t* keyid) {
406 EvpMdCtx ctx;
407
408 uint8_t hash[EVP_MAX_MD_SIZE];
409 unsigned int hash_len;
410 if (EVP_DigestInit_ex(ctx.get(), EVP_sha256(), nullptr /* ENGINE */) &&
411 EVP_DigestUpdate(ctx.get(), &key_blob[0], key_blob.size()) &&
412 EVP_DigestFinal_ex(ctx.get(), hash, &hash_len)) {
413 assert(hash_len >= sizeof(*keyid));
414 memcpy(keyid, hash, sizeof(*keyid));
415 return true;
416 }
417
418 return false;
419}
420
421bool KeymasterEnforcement::MinTimeBetweenOpsPassed(uint32_t min_time_between, const km_id_t keyid) {
422 if (!access_time_map_) return false;
423
424 uint32_t last_access_time;
425 if (!access_time_map_->LastKeyAccessTime(keyid, &last_access_time)) return true;
426 return min_time_between <= static_cast<int64_t>(get_current_time()) - last_access_time;
427}
428
429bool KeymasterEnforcement::MaxUsesPerBootNotExceeded(const km_id_t keyid, uint32_t max_uses) {
430 if (!access_count_map_) return false;
431
432 uint32_t key_access_count;
433 if (!access_count_map_->KeyAccessCount(keyid, &key_access_count)) return true;
434 return key_access_count < max_uses;
435}
436
437template <typename IntType, uint32_t byteOrder> struct choose_hton;
438
439template <typename IntType> struct choose_hton<IntType, __ORDER_LITTLE_ENDIAN__> {
440 inline static IntType hton(const IntType& value) {
441 IntType result = 0;
442 const unsigned char* inbytes = reinterpret_cast<const unsigned char*>(&value);
443 unsigned char* outbytes = reinterpret_cast<unsigned char*>(&result);
444 for (int i = sizeof(IntType) - 1; i >= 0; --i) {
445 *(outbytes++) = inbytes[i];
446 }
447 return result;
448 }
449};
450
451template <typename IntType> struct choose_hton<IntType, __ORDER_BIG_ENDIAN__> {
452 inline static IntType hton(const IntType& value) { return value; }
453};
454
455template <typename IntType> inline IntType hton(const IntType& value) {
456 return choose_hton<IntType, __BYTE_ORDER__>::hton(value);
457}
458
459template <typename IntType> inline IntType ntoh(const IntType& value) {
460 // same operation and hton
461 return choose_hton<IntType, __BYTE_ORDER__>::hton(value);
462}
463
464bool KeymasterEnforcement::AuthTokenMatches(const AuthorizationSet& auth_set,
Shawn Willden0329a822017-12-04 13:55:14 -0700465 const HardwareAuthToken& auth_token,
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100466 const uint64_t user_secure_id,
467 const int auth_type_index, const int auth_timeout_index,
468 const uint64_t op_handle,
469 bool is_begin_operation) const {
470 assert(auth_type_index < static_cast<int>(auth_set.size()));
471 assert(auth_timeout_index < static_cast<int>(auth_set.size()));
472
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100473 if (!ValidateTokenSignature(auth_token)) {
474 ALOGE("Auth token signature invalid");
475 return false;
476 }
477
478 if (auth_timeout_index == -1 && op_handle && op_handle != auth_token.challenge) {
479 ALOGE("Auth token has the challenge %" PRIu64 ", need %" PRIu64, auth_token.challenge,
480 op_handle);
481 return false;
482 }
483
Janis Danisevskis8f737ad2017-11-21 12:30:15 -0800484 if (user_secure_id != auth_token.userId && user_secure_id != auth_token.authenticatorId) {
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100485 ALOGI("Auth token SIDs %" PRIu64 " and %" PRIu64 " do not match key SID %" PRIu64,
Janis Danisevskis8f737ad2017-11-21 12:30:15 -0800486 auth_token.userId, auth_token.authenticatorId, user_secure_id);
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100487 return false;
488 }
489
490 if (auth_type_index < 0 || auth_type_index > static_cast<int>(auth_set.size())) {
491 ALOGE("Auth required but no auth type found");
492 return false;
493 }
494
Janis Danisevskis8f737ad2017-11-21 12:30:15 -0800495 assert(auth_set[auth_type_index].tag == TAG_USER_AUTH_TYPE);
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100496 auto key_auth_type_mask = authorizationValue(TAG_USER_AUTH_TYPE, auth_set[auth_type_index]);
497 if (!key_auth_type_mask.isOk()) return false;
498
Shawn Willden0329a822017-12-04 13:55:14 -0700499 if ((uint32_t(key_auth_type_mask.value()) & auth_token.authenticatorType) == 0) {
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100500 ALOGE("Key requires match of auth type mask 0%uo, but token contained 0%uo",
Shawn Willden0329a822017-12-04 13:55:14 -0700501 key_auth_type_mask.value(), auth_token.authenticatorType);
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100502 return false;
503 }
504
505 if (auth_timeout_index != -1 && is_begin_operation) {
Janis Danisevskis8f737ad2017-11-21 12:30:15 -0800506 assert(auth_set[auth_timeout_index].tag == TAG_AUTH_TIMEOUT);
Janis Danisevskisc7a9fa22016-10-13 18:43:45 +0100507 auto auth_token_timeout =
508 authorizationValue(TAG_AUTH_TIMEOUT, auth_set[auth_timeout_index]);
509 if (!auth_token_timeout.isOk()) return false;
510
511 if (auth_token_timed_out(auth_token, auth_token_timeout.value())) {
512 ALOGE("Auth token has timed out");
513 return false;
514 }
515 }
516
517 // Survived the whole gauntlet. We have authentage!
518 return true;
519}
520
521bool AccessTimeMap::LastKeyAccessTime(km_id_t keyid, uint32_t* last_access_time) const {
522 for (auto& entry : last_access_list_)
523 if (entry.keyid == keyid) {
524 *last_access_time = entry.access_time;
525 return true;
526 }
527 return false;
528}
529
530bool AccessTimeMap::UpdateKeyAccessTime(km_id_t keyid, uint32_t current_time, uint32_t timeout) {
531 for (auto iter = last_access_list_.begin(); iter != last_access_list_.end();) {
532 if (iter->keyid == keyid) {
533 iter->access_time = current_time;
534 return true;
535 }
536
537 // Expire entry if possible.
538 assert(current_time >= iter->access_time);
539 if (current_time - iter->access_time >= iter->timeout)
540 iter = last_access_list_.erase(iter);
541 else
542 ++iter;
543 }
544
545 if (last_access_list_.size() >= max_size_) return false;
546
547 AccessTime new_entry;
548 new_entry.keyid = keyid;
549 new_entry.access_time = current_time;
550 new_entry.timeout = timeout;
551 last_access_list_.push_front(new_entry);
552 return true;
553}
554
555bool AccessCountMap::KeyAccessCount(km_id_t keyid, uint32_t* count) const {
556 for (auto& entry : access_count_list_)
557 if (entry.keyid == keyid) {
558 *count = entry.access_count;
559 return true;
560 }
561 return false;
562}
563
564bool AccessCountMap::IncrementKeyAccessCount(km_id_t keyid) {
565 for (auto& entry : access_count_list_)
566 if (entry.keyid == keyid) {
567 // Note that the 'if' below will always be true because KM_TAG_MAX_USES_PER_BOOT is a
568 // uint32_t, and as soon as entry.access_count reaches the specified maximum value
569 // operation requests will be rejected and access_count won't be incremented any more.
570 // And, besides, UINT64_MAX is huge. But we ensure that it doesn't wrap anyway, out of
571 // an abundance of caution.
572 if (entry.access_count < UINT64_MAX) ++entry.access_count;
573 return true;
574 }
575
576 if (access_count_list_.size() >= max_size_) return false;
577
578 AccessCount new_entry;
579 new_entry.keyid = keyid;
580 new_entry.access_count = 1;
581 access_count_list_.push_front(new_entry);
582 return true;
583}
584}; /* namespace keystore */