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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
//! Secrets hashing and verification models.
use crateHashingOperation;
use crate;
use crate;
use crateVerificationResult;
pub use SecretError;
pub use SecretRepository;
use ;
use Uuid;
/// A cryptographically secure secret (password) bound to a specific user account.
///
/// This type represents a hashed password or other sensitive authentication data that is
/// cryptographically bound to a specific account through its unique identifier. The secret
/// is automatically hashed using the Argon2 algorithm when created, ensuring that plaintext
/// passwords are never stored in memory or persistent storage.
///
/// # Security Properties
///
/// - **Irreversible hashing**: Plaintext secrets cannot be recovered from the hash
/// - **Unique salting**: Each secret has a cryptographically random salt
/// - **Timing attack resistance**: Verification operations run in constant time
/// - **Account binding**: Secrets are tied to specific account IDs for additional security
///
/// # Usage in Authentication Flows
///
/// Secrets are typically created during user registration and verified during login:
///
/// ```rust
/// use axum_gate::secrets::Secret; use axum_gate::hashing::argon2::Argon2Hasher; use axum_gate::verification_result::VerificationResult;
/// use axum_gate::accounts::AccountInsertService;
/// use uuid::Uuid;
///
/// # tokio_test::block_on(async {
/// // During registration
/// let account_id = Uuid::now_v7();
/// let user_password = "user_entered_password";
/// let hasher = Argon2Hasher::new_recommended().unwrap();
///
/// let secret = Secret::new(&account_id, user_password, hasher.clone())?;
///
/// // During login verification
/// let login_attempt = "user_entered_password";
/// match secret.verify(login_attempt, hasher)? {
/// VerificationResult::Ok => {
/// // Grant access - password is correct
/// println!("Authentication successful");
/// },
/// VerificationResult::Unauthorized => {
/// // Deny access - password is incorrect
/// println!("Authentication failed");
/// }
/// }
/// # Ok::<(), Box<dyn std::error::Error>>(())
/// # });
/// ```
///
/// # Storage Considerations
///
/// Secrets should be stored separately from account data for enhanced security:
///
/// - Use dedicated secret repositories ([`SecretRepository`])
/// - Consider separate databases for account metadata vs. authentication secrets
/// - Implement appropriate access controls on secret storage
/// - Regular backup and recovery procedures for authentication data
///
/// # Performance Notes
///
/// Secret hashing and verification are intentionally computationally expensive operations
/// (typically 100-500ms) to resist brute-force attacks. Consider:
///
/// - Implementing rate limiting on authentication endpoints
/// - Using async/await to prevent blocking during verification
/// - Caching verification results appropriately (with security considerations)
///
/// The `account_id` must correspond to a valid account in an
/// [`AccountRepository`](crate::accounts::AccountRepository) to create a correct secret.