File: decoy_user-t.cc

package info (click to toggle)
mysql-8.0 8.0.43-3
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 1,273,924 kB
  • sloc: cpp: 4,684,605; ansic: 412,450; pascal: 108,398; java: 83,641; perl: 30,221; cs: 27,067; sql: 26,594; sh: 24,181; python: 21,816; yacc: 17,169; php: 11,522; xml: 7,388; javascript: 7,076; makefile: 2,194; lex: 1,075; awk: 670; asm: 520; objc: 183; ruby: 97; lisp: 86
file content (158 lines) | stat: -rw-r--r-- 4,966 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
/* Copyright (c) 2019, 2025, Oracle and/or its affiliates.

This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License, version 2.0,
as published by the Free Software Foundation.

This program is designed to work with certain software (including
but not limited to OpenSSL) that is licensed under separate terms,
as designated in a particular file or component or in included license
documentation.  The authors of MySQL hereby grant you an additional
permission to link the program and your derivative works with the
separately licensed software that they have either included with
the program or referenced in the documentation.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License, version 2.0, for more details.

You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301  USA */

#include "my_config.h"

#include <algorithm>
#include <cstdlib>
#include <map>
#include <set>
#include <string>

#include <gtest/gtest.h>

#include "lex_string.h"
#include "m_string.h"
#include "my_inttypes.h"
#include "sql/auth/auth_common.h"
#include "sql/auth/auth_utility.h"
#include "sql/auth/sql_auth_cache.h"
#include "sql/auth/sql_authentication.h"
#include "sql/sql_class.h"
#include "unittest/gunit/test_utils.h"

namespace decoy_user_unittest {
using my_testing::Server_initializer;
using std::max;
using std::rand;

class Decoy_user_Test : public ::testing::Test {
 protected:
  void SetUp() override { initializer.SetUp(); }
  void TearDown() override { initializer.TearDown(); }

  THD *get_thd() { return initializer.thd(); }

  Server_initializer initializer;
};

std::set<Auth_id> unknown_authids;
const size_t unknown_authids_size = 1000;

void generate_random() {
  unknown_authids.clear();

  /* Random user and host of length size */
  auto get_random_account = [](size_t length) -> Auth_id {
    const char chars[] =
        "QWERTYUIOPASDFGHJKLZXCVBNM"
        "qwertyuiopasdfghjklzxcvbnm";
    const size_t limit = (sizeof(chars) - 1);

    std::string user, host;
    for (size_t i = 0; i < length; ++i) user.push_back(chars[rand() % limit]);
    for (size_t i = 0; i < length; ++i) host.push_back(chars[rand() % limit]);

    return (Auth_id(user, host));
  };

  while (unknown_authids.size() < unknown_authids_size) {
    unknown_authids.insert(get_random_account(max(5, rand() % 16)));
  }
}

TEST_F(Decoy_user_Test, DecoyUserConsistency) {
  THD *thd = get_thd();
  ACL_USER *decoy = nullptr;

  unknown_accounts = new Map_with_rw_lock<Auth_id, uint>(0);

  const LEX_CSTRING users[] = {{STRING_WITH_LEN("foo")},
                               {STRING_WITH_LEN("baz")},
                               {STRING_WITH_LEN("quux")}};
  const LEX_CSTRING hosts[] = {{STRING_WITH_LEN("bar")},
                               {STRING_WITH_LEN("qux")},
                               {STRING_WITH_LEN("quuz")}};

  for (auto i = 0; i < 3; ++i) {
    for (auto j = 0; j < 3; ++j) {
      decoy = nullptr;
      decoy = decoy_user(users[i], hosts[j], thd->mem_root, &thd->rand, true);
      std::string first(decoy->plugin.str, decoy->plugin.length);
      decoy = decoy_user(users[i], hosts[j], thd->mem_root, &thd->rand, true);
      std::string second(decoy->plugin.str, decoy->plugin.length);
      EXPECT_FALSE(first.compare(second));
    }
  }

  EXPECT_TRUE(unknown_accounts->size() == 9);

  delete unknown_accounts;
}

TEST_F(Decoy_user_Test, DecoyUserRandomness) {
  THD *thd = get_thd();
  std::map<std::string, uint> plugin_hits;
  uint hit_roof = 4;
  uint trials = 0;
  uint threshold = 500;
  ACL_USER *decoy = nullptr;

  unknown_accounts = new Map_with_rw_lock<Auth_id, uint>(0);

  /* initialize the map */
  for (uint a = 0; a < (uint)PLUGIN_LAST; ++a) {
    std::string plugin(
        Cached_authentication_plugins::cached_plugins_names[a].str,
        Cached_authentication_plugins::cached_plugins_names[a].length);
    plugin_hits[plugin]; /* operator [] initializes entry with 0 if missing */
  }

  generate_random();

  while (trials < hit_roof) {
    for (auto &element : unknown_authids) {
      decoy = nullptr;
      LEX_CSTRING user;
      LEX_CSTRING host;
      user.str = element.user().c_str();
      user.length = element.user().length();
      host.str = element.host().c_str();
      host.length = element.host().length();

      decoy = decoy_user(user, host, thd->mem_root, &thd->rand, true);
      std::string hit(decoy->plugin.str, decoy->plugin.length);
      plugin_hits[hit]++;
    }

    ++trials;
  }

  for (auto &entry : plugin_hits) {
    EXPECT_TRUE(entry.second >= threshold);
  }

  delete unknown_accounts;
}

}  // namespace decoy_user_unittest