Table 8 Benchmarking results for implementing the hybrid search algorithm for 1-byte HE encrypted rule over 10-byte plaintext using TFHE, SEAL, and PALISADE libraries.

From: Oblivious network intrusion detection systems

Library

Scheme

Base

Parameters

Multiplication

depth

Search speed

(ms)

Encrypted bit size (Bytes)

TFHE

TFHE

Binary

Logic

\(\lambda\) = 128

Infinity

1,051

2536

SEAL

BFV

Int.

Arith.

Plaintext Modulus = 4096

4

Decryption Failed

88,488

Plaintext Modulus = 16384

11

1061

432,382

Plaintext Modulus = 16384

25

5187

1,826,173

Plaintext Modulus = 32768

50

25,826

7,404,598

PALISADE

BFV

Int.

Arith.

Mult. Depth = 4

Decryption Failed

396,249

Mult. Depth = 7

390

396,249

Mult. Depth = 11

1,240

1,313,983

Mult. Depth = 25

4,499

4,722,315

Mult. Depth = 50

19,743

17,830,435

BGV

Int.

Arith.

Mult. Depth = 4

Decryption Failed

658,638

Mult. Depth = 7

1,378

2,100,775

Mult. Depth = 11

2,254

3,149,811

Mult. Depth = 25

16,434

13,637,181

Mult. Depth = 50

120,160

53,485,944

TFHE

Bin.

Logic

\(\lambda\) = 128

Infinity

11,089

4,141

  1. Fastest search speed and smallest encrypted bit size are in bold.