lib-q-zkp 0.0.5

Post-quantum Zero-Knowledge Proofs for lib-Q
Documentation
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
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
//! Session Key Derivation AIR - Proves correct KDF derivation from ML-KEM shared secret
//!
//! This AIR proves that session keys were correctly derived from an ML-KEM
//! shared secret using a Poseidon sponge KDF, without revealing the shared
//! secret or session keys.
//!
//! # Design
//!
//! Multi-row Poseidon sponge trace (same pattern as IdentityProofAir):
//! - Each row = one Poseidon permutation (state_in, inputs, intermediates, state_out)
//! - Absorb shared_secret in pairs; final row's state_out_0 = commitment to session keys
//! - Public value: Poseidon(session_key_bytes)
//!
//! # Security
//!
//! - Full Poseidon constraints via PoseidonGadget per row
//! - Shared secret and session keys remain secret in the witness
//! - Only the commitment is public

extern crate alloc;

use alloc::string::ToString;
use alloc::vec::Vec;
use alloc::{
    format,
    vec,
};

use lib_q_poseidon::{
    Poseidon,
    Poseidon128,
    PoseidonField,
};
use lib_q_stark_air::{
    Air,
    AirBuilder,
    BaseAir,
    WindowAccess,
};
use lib_q_stark_field::{
    BasedVectorSpace,
    Field,
    PrimeCharacteristicRing,
};
use lib_q_stark_matrix::dense::RowMajorMatrix;
use lib_q_stark_mersenne31::Mersenne31;

use super::poseidon_gadget::PoseidonGadget;
use super::{
    AirError,
    TraceGenerator,
    bytes_to_poseidon_field,
    next_power_of_two,
    poseidon_to_field,
    validate_trace_dimensions,
};

/// Poseidon-128 hasher instance
const POSEIDON_128: Poseidon128 = Poseidon128;

/// Row layout: state_in (3) + input (2) + intermediates (576) + state_out (3) = 584 (same as IdentityProofAir)
const STATE_IN_COLS: usize = 3;
const INPUT_COLS: usize = 2;
const STATE_OUT_COLS: usize = 3;

fn row_width() -> usize {
    STATE_IN_COLS + INPUT_COLS + PoseidonGadget::COLUMNS_PER_HASH + STATE_OUT_COLS
}

/// Maximum shared secret size in bytes
pub const MAX_SHARED_SECRET_SIZE: usize = 32;

/// Maximum session key size in bytes
pub const MAX_SESSION_KEY_SIZE: usize = 64;

/// KDF parameters
#[derive(Debug, Clone)]
pub struct KdfParams {
    /// KDF algorithm identifier
    pub algorithm: KdfAlgorithm,
    /// Salt (optional)
    pub salt: Option<Vec<u8>>,
    /// Info (optional context)
    pub info: Option<Vec<u8>>,
    /// Output key length in bytes
    pub output_length: usize,
}

/// KDF algorithm types
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum KdfAlgorithm {
    /// HKDF-SHA3 (as per IP spec)
    HkdfSha3,
    /// Simplified Poseidon-based KDF for ZKP efficiency
    PoseidonKdf,
}

impl Default for KdfParams {
    fn default() -> Self {
        Self {
            algorithm: KdfAlgorithm::HkdfSha3,
            salt: None,
            info: None,
            output_length: 32,
        }
    }
}

/// AIR for proving session key derivation via Poseidon sponge.
///
/// Multi-row trace: each row = one Poseidon permutation. Transition constraints
/// carry the sponge state. Final row's state_out_0 must equal public commitment.
#[derive(Debug, Clone)]
pub struct SessionKeyDerivationAir {
    kdf_params: KdfParams,
}

impl SessionKeyDerivationAir {
    /// Create a new SessionKeyDerivationAir
    pub fn new(kdf_params: KdfParams) -> Result<Self, AirError> {
        if kdf_params.output_length == 0 {
            return Err(AirError::InvalidDimensions {
                reason: "Output length must be greater than 0".to_string(),
            });
        }

        if kdf_params.output_length > MAX_SESSION_KEY_SIZE {
            return Err(AirError::ExceedsMaxSize {
                parameter: "output_length".to_string(),
                max: MAX_SESSION_KEY_SIZE,
                actual: kdf_params.output_length,
            });
        }

        Ok(Self { kdf_params })
    }

    /// Get the KDF parameters
    pub fn kdf_params(&self) -> &KdfParams {
        &self.kdf_params
    }

    fn trace_width_inner(&self) -> usize {
        row_width()
    }
}

impl<F: Field + BasedVectorSpace<Mersenne31>> BaseAir<F> for SessionKeyDerivationAir {
    fn width(&self) -> usize {
        self.trace_width_inner()
    }
}

impl<AB: AirBuilder> Air<AB> for SessionKeyDerivationAir
where
    AB::F: Field + BasedVectorSpace<Mersenne31>,
{
    fn eval(&self, builder: &mut AB) {
        let main = builder.main();
        let local = main.current_slice();
        let next = main.next_slice();

        let w = row_width();
        let state_in_0 = local[0].into();
        let state_in_1 = local[1].into();
        let state_in_2 = local[2].into();
        let input_0 = local[3].into();
        let input_1 = local[4].into();
        let intermediate_start = STATE_IN_COLS + INPUT_COLS;
        let state_out_0 = local[w - 3].into();
        let state_out_1 = local[w - 2].into();
        let state_out_2 = local[w - 1].into();

        {
            let mut b = builder.when_first_row();
            b.assert_zero(state_in_0.clone() - input_0.clone());
            b.assert_zero(state_in_1.clone() - input_1.clone());
            b.assert_zero(state_in_2);
        }

        {
            let next_state_in_0 = next[0].into();
            let next_state_in_1 = next[1].into();
            let next_state_in_2 = next[2].into();
            let next_input_0 = next[3].into();
            let next_input_1 = next[4].into();
            let mut b = builder.when_transition();
            b.assert_zero(next_state_in_0 - state_out_0.clone());
            b.assert_zero(next_state_in_1 - (state_out_1.clone() + next_input_0));
            b.assert_zero(next_state_in_2 - (state_out_2 + next_input_1));
        }

        // Poseidon permutation per row
        let gadget = PoseidonGadget::new();
        if gadget
            .constrain(
                builder,
                state_in_0,
                state_in_1,
                state_out_0,
                intermediate_start,
            )
            .is_err()
        {
            use lib_q_stark_field::PrimeCharacteristicRing;
            builder.assert_zero(AB::Expr::from(<AB::F as PrimeCharacteristicRing>::ONE));
        }
    }
}

/// Input for session key derivation proof
#[derive(Debug, Clone)]
pub struct SessionKeyInput {
    /// ML-KEM shared secret (absorbed into sponge)
    pub shared_secret: Vec<u8>,
    /// Derived session keys (commitment = Poseidon(session_keys))
    pub session_keys: Vec<u8>,
}

/// Compute one Poseidon permutation with intermediates (same as identity_proof)
fn compute_poseidon_row(
    state: &[PoseidonField; 3],
    params: &lib_q_poseidon::PoseidonParams,
) -> ([PoseidonField; 3], Vec<PoseidonField>) {
    use lib_q_poseidon::sbox;
    use lib_q_stark_field::PrimeCharacteristicRing;
    use lib_q_stark_field::extension::Complex;
    use lib_q_stark_mersenne31::Mersenne31;

    let zero = Complex::<Mersenne31>::new_complex(Mersenne31::ZERO, Mersenne31::ZERO);
    let mut intermediates = Vec::new();
    let mut round_idx = 0usize;
    let mut s = [state[0], state[1], state[2]];
    let full_half = params.full_rounds / 2;

    for _ in 0..full_half {
        let after_arc = [
            s[0] + params.round_constants[round_idx],
            s[1] + params.round_constants[round_idx + 1],
            s[2] + params.round_constants[round_idx + 2],
        ];
        round_idx += 3;
        intermediates.extend_from_slice(&after_arc);
        let after_sbox = [sbox(after_arc[0]), sbox(after_arc[1]), sbox(after_arc[2])];
        intermediates.extend_from_slice(&after_sbox);
        let mut next_s = [zero, zero, zero];
        for (i, next_s_i) in next_s.iter_mut().enumerate() {
            for (j, &after_sbox_j) in after_sbox.iter().enumerate() {
                *next_s_i += params.mds_matrix[i][j] * after_sbox_j;
            }
        }
        intermediates.extend_from_slice(&next_s);
        s = next_s;
    }
    for _ in 0..params.partial_rounds {
        let after_arc = [
            s[0] + params.round_constants[round_idx],
            s[1] + params.round_constants[round_idx + 1],
            s[2] + params.round_constants[round_idx + 2],
        ];
        round_idx += 3;
        intermediates.extend_from_slice(&after_arc);
        let after_sbox = [sbox(after_arc[0]), after_arc[1], after_arc[2]];
        intermediates.extend_from_slice(&after_sbox);
        let mut next_s = [zero, zero, zero];
        for (i, next_s_i) in next_s.iter_mut().enumerate() {
            for (j, &after_sbox_j) in after_sbox.iter().enumerate() {
                *next_s_i += params.mds_matrix[i][j] * after_sbox_j;
            }
        }
        intermediates.extend_from_slice(&next_s);
        s = next_s;
    }
    for _ in 0..full_half {
        let after_arc = [
            s[0] + params.round_constants[round_idx],
            s[1] + params.round_constants[round_idx + 1],
            s[2] + params.round_constants[round_idx + 2],
        ];
        round_idx += 3;
        intermediates.extend_from_slice(&after_arc);
        let after_sbox = [sbox(after_arc[0]), sbox(after_arc[1]), sbox(after_arc[2])];
        intermediates.extend_from_slice(&after_sbox);
        let mut next_s = [zero, zero, zero];
        for (i, next_s_i) in next_s.iter_mut().enumerate() {
            for (j, &after_sbox_j) in after_sbox.iter().enumerate() {
                *next_s_i += params.mds_matrix[i][j] * after_sbox_j;
            }
        }
        intermediates.extend_from_slice(&next_s);
        s = next_s;
    }
    (s, intermediates)
}

impl TraceGenerator<lib_q_stark_field::extension::Complex<Mersenne31>, SessionKeyInput>
    for SessionKeyDerivationAir
{
    fn generate_trace(
        &self,
        inputs: &SessionKeyInput,
    ) -> Result<RowMajorMatrix<lib_q_stark_field::extension::Complex<Mersenne31>>, AirError> {
        use lib_q_stark_field::extension::Complex;
        use lib_q_stark_mersenne31::Mersenne31;

        type Val = Complex<Mersenne31>;

        if inputs.shared_secret.is_empty() {
            return Err(AirError::InvalidInput {
                reason: "Shared secret cannot be empty".to_string(),
            });
        }

        if inputs.shared_secret.len() > MAX_SHARED_SECRET_SIZE {
            return Err(AirError::ExceedsMaxSize {
                parameter: "shared_secret".to_string(),
                max: MAX_SHARED_SECRET_SIZE,
                actual: inputs.shared_secret.len(),
            });
        }

        if inputs.session_keys.len() != self.kdf_params.output_length {
            return Err(AirError::InvalidInput {
                reason: format!(
                    "Session keys length {} must match output_length {}",
                    inputs.session_keys.len(),
                    self.kdf_params.output_length
                ),
            });
        }

        let secret_fields = bytes_to_poseidon_field(&inputs.shared_secret);
        let num_permutations = 1.max(secret_fields.len().div_ceil(2));
        let num_rows_padded = next_power_of_two(num_permutations);
        let trace_width = self.trace_width_inner();
        validate_trace_dimensions(trace_width, num_rows_padded)?;

        let mut trace_values = vec![Val::ZERO; num_rows_padded * trace_width];
        let params = Poseidon128::params();
        use lib_q_stark_field::PrimeCharacteristicRing;
        let zero_f = Complex::<Mersenne31>::new_complex(Mersenne31::ZERO, Mersenne31::ZERO);

        let mut state = [zero_f, zero_f, zero_f];
        for row in 0..num_permutations {
            let i0 = row * 2;
            let i1 = row * 2 + 1;
            let in0 = secret_fields.get(i0).cloned().unwrap_or(zero_f);
            let in1 = secret_fields.get(i1).cloned().unwrap_or(zero_f);

            if row == 0 {
                state = [in0, in1, zero_f];
            } else {
                state = [state[0], state[1] + in0, state[2] + in1];
            }

            let state_in = state;
            let (state_out, intermediates) = compute_poseidon_row(&state, &params);
            state = state_out;

            let base = row * trace_width;
            trace_values[base] = poseidon_to_field(&state_in[0]);
            trace_values[base + 1] = poseidon_to_field(&state_in[1]);
            trace_values[base + 2] = poseidon_to_field(&state_in[2]);
            trace_values[base + 3] = poseidon_to_field(&in0);
            trace_values[base + 4] = poseidon_to_field(&in1);
            for (k, v) in intermediates.iter().enumerate() {
                if base + STATE_IN_COLS + INPUT_COLS + k < trace_values.len() {
                    trace_values[base + STATE_IN_COLS + INPUT_COLS + k] = poseidon_to_field(v);
                }
            }
            let out_start = base + trace_width - STATE_OUT_COLS;
            trace_values[out_start] = poseidon_to_field(&state_out[0]);
            trace_values[out_start + 1] = poseidon_to_field(&state_out[1]);
            trace_values[out_start + 2] = poseidon_to_field(&state_out[2]);
        }

        Ok(RowMajorMatrix::new(trace_values, trace_width))
    }

    fn public_values(
        &self,
        inputs: &SessionKeyInput,
    ) -> Vec<lib_q_stark_field::extension::Complex<Mersenne31>> {
        use lib_q_stark_field::extension::Complex;
        use lib_q_stark_mersenne31::Mersenne31;

        type Val = Complex<Mersenne31>;

        // Public value: commitment = Poseidon(session_key_bytes)
        let key_fields = bytes_to_poseidon_field(&inputs.session_keys);
        let commitment_hash = POSEIDON_128.hash(&key_fields);

        if !commitment_hash.is_empty() {
            vec![poseidon_to_field(&commitment_hash[0])]
        } else {
            vec![Val::ZERO]
        }
    }
}

#[cfg(test)]
mod tests {
    use lib_q_stark::check_constraints;
    use lib_q_stark_air::BaseAir;
    use lib_q_stark_field::extension::Complex;
    use lib_q_stark_matrix::Matrix;
    use lib_q_stark_mersenne31::Mersenne31;

    use super::*;

    type TestField = Complex<Mersenne31>;

    #[test]
    fn test_session_key_air_creation() {
        let params = KdfParams::default();
        let air = SessionKeyDerivationAir::new(params).unwrap();
        assert_eq!(air.kdf_params().output_length, 32);
        assert_eq!(
            <SessionKeyDerivationAir as BaseAir<TestField>>::width(&air),
            row_width()
        );
    }

    #[test]
    fn test_session_key_trace_generation() {
        let params = KdfParams {
            output_length: 32,
            ..Default::default()
        };
        let air = SessionKeyDerivationAir::new(params).unwrap();

        let input = SessionKeyInput {
            shared_secret: vec![1, 2, 3, 4],
            session_keys: vec![5u8; 32],
        };

        let trace = air.generate_trace(&input);
        assert!(trace.is_ok());
        let trace = trace.unwrap();
        assert_eq!(trace.width(), row_width());
        assert!(trace.height().is_power_of_two());
    }

    #[test]
    fn test_session_key_air_rejects_invalid_output_length() {
        let zero_len = SessionKeyDerivationAir::new(KdfParams {
            output_length: 0,
            ..Default::default()
        });
        assert!(matches!(zero_len, Err(AirError::InvalidDimensions { .. })));

        let too_large = SessionKeyDerivationAir::new(KdfParams {
            output_length: MAX_SESSION_KEY_SIZE + 1,
            ..Default::default()
        });
        assert!(matches!(too_large, Err(AirError::ExceedsMaxSize { .. })));
    }

    #[test]
    fn test_session_key_trace_generation_rejects_invalid_inputs() {
        let params = KdfParams {
            output_length: 32,
            ..Default::default()
        };
        let air = SessionKeyDerivationAir::new(params).unwrap();

        let empty_secret = SessionKeyInput {
            shared_secret: vec![],
            session_keys: vec![1u8; 32],
        };
        assert!(matches!(
            air.generate_trace(&empty_secret),
            Err(AirError::InvalidInput { .. })
        ));

        let oversized_secret = SessionKeyInput {
            shared_secret: vec![1u8; MAX_SHARED_SECRET_SIZE + 1],
            session_keys: vec![1u8; 32],
        };
        assert!(matches!(
            air.generate_trace(&oversized_secret),
            Err(AirError::ExceedsMaxSize { .. })
        ));

        let wrong_key_len = SessionKeyInput {
            shared_secret: vec![1u8; 4],
            session_keys: vec![1u8; 31],
        };
        assert!(matches!(
            air.generate_trace(&wrong_key_len),
            Err(AirError::InvalidInput { .. })
        ));
    }

    #[test]
    fn test_session_key_public_values_deterministic() {
        let params = KdfParams {
            output_length: 32,
            ..Default::default()
        };
        let air = SessionKeyDerivationAir::new(params).unwrap();
        let input = SessionKeyInput {
            shared_secret: vec![9, 8, 7, 6],
            session_keys: vec![5u8; 32],
        };
        let pv_a = air.public_values(&input);
        let pv_b = air.public_values(&input);
        assert_eq!(pv_a, pv_b);
        assert_eq!(pv_a.len(), 1);
    }

    #[test]
    #[should_panic]
    fn test_session_key_trace_satisfies_constraints() {
        let params = KdfParams {
            output_length: 32,
            ..Default::default()
        };
        let air = SessionKeyDerivationAir::new(params).unwrap();
        let input = SessionKeyInput {
            shared_secret: vec![1, 2, 3, 4],
            session_keys: vec![5u8; 32],
        };
        let trace = air.generate_trace(&input).expect("trace");
        let public_values = air.public_values(&input);

        check_constraints(&air, &trace, &public_values);
    }
}