[
 {
  "group": "1. CKKS and its variants",
  "name": "CKKS",
  "year": 2017,
  "venue": "ASIACRYPT 2017",
  "authors": "Cheon, Kim, Kim, Song",
  "title": "Homomorphic Encryption for Arithmetic of Approximate Numbers",
  "paper": "https://eprint.iacr.org/2016/421",
  "assumption": "RLWE",
  "plaintext": "Approximate real/complex fixed point",
  "simd": "Yes, N/2 complex slots",
  "boot": "Yes; expensive, consumes many levels",
  "pq": "Yes",
  "llm": "The SoK's baseline. Native SIMD real arithmetic suits linear layers. Non-linear layers need polynomial approximation and bootstrapping dominates latency.",
  "libs": [
   [
    "OpenFHE",
    "https://github.com/openfheorg/openfhe-development"
   ],
   [
    "SEAL",
    "https://github.com/microsoft/SEAL"
   ],
   [
    "Lattigo",
    "https://github.com/tuneinsight/lattigo"
   ],
   [
    "HEaaN",
    "https://heaan.it/"
   ],
   [
    "HElib",
    "https://github.com/homenc/HElib"
   ],
   [
    "Phantom",
    "https://github.com/encryptorion-lab/phantom-fhe"
   ],
   [
    "FIDESlib",
    "https://github.com/CAPS-UMU/FIDESlib"
   ],
   [
    "HEonGPU",
    "https://github.com/Alisah-Ozcan/HEonGPU"
   ],
   [
    "Liberate.FHE",
    "https://github.com/Desilo/liberate-fhe"
   ]
  ],
  "followups": "Bootstrapping: Cheon et al. EUROCRYPT 2018; Chen–Chillotti–Song EUROCRYPT 2019; Bossuat et al. EUROCRYPT 2021; Lee et al. EUROCRYPT 2021.",
  "status": "Widely used (baseline)",
  "kind": "Scheme",
  "id": 0
 },
 {
  "group": "1. CKKS and its variants",
  "name": "RNS-CKKS",
  "year": 2018,
  "venue": "SAC 2018",
  "authors": "Cheon, Han, Kim, Kim, Song",
  "title": "A Full RNS Variant of Approximate Homomorphic Encryption",
  "paper": "https://eprint.iacr.org/2018/931",
  "assumption": "RLWE",
  "plaintext": "Approximate real/complex",
  "simd": "Yes",
  "boot": "Yes",
  "pq": "Yes",
  "llm": "The form all libraries and GPU back-ends implement, using word-sized primes.",
  "libs": [
   [
    "OpenFHE",
    "https://github.com/openfheorg/openfhe-development"
   ],
   [
    "SEAL",
    "https://github.com/microsoft/SEAL"
   ],
   [
    "Lattigo",
    "https://github.com/tuneinsight/lattigo"
   ],
   [
    "Phantom",
    "https://github.com/encryptorion-lab/phantom-fhe"
   ],
   [
    "FIDESlib",
    "https://github.com/CAPS-UMU/FIDESlib"
   ]
  ],
  "followups": "Hybrid key switching (Han–Ki, CT-RSA 2020).",
  "status": "Widely used",
  "kind": "Variant",
  "id": 1
 },
 {
  "group": "1. CKKS and its variants",
  "name": "Conjugate-invariant CKKS",
  "year": 2018,
  "venue": "ICISC 2018",
  "authors": "Kim, Song",
  "title": "Approximate Homomorphic Encryption over the Conjugate-invariant Ring",
  "paper": "https://eprint.iacr.org/2018/952",
  "assumption": "RLWE (real subring)",
  "plaintext": "Approximate real only",
  "simd": "Yes, N real slots",
  "boot": "Yes, more expensive",
  "pq": "Yes",
  "llm": "Doubles the number of real slots, which helps wide activations. Rarely used because bootstrapping costs more.",
  "libs": [
   [
    "Lattigo",
    "https://github.com/tuneinsight/lattigo"
   ]
  ],
  "followups": "",
  "status": "Niche",
  "kind": "Variant",
  "id": 2
 },
 {
  "group": "1. CKKS and its variants",
  "name": "Reduced-error CKKS (exact rescaling)",
  "year": 2022,
  "venue": "CT-RSA 2022",
  "authors": "Kim, Papadimitriou, Polyakov",
  "title": "Approximate Homomorphic Encryption with Reduced Approximation Error",
  "paper": "https://eprint.iacr.org/2020/1118",
  "assumption": "RLWE",
  "plaintext": "Approximate real/complex, higher precision",
  "simd": "Yes",
  "boot": "Yes",
  "pq": "Yes",
  "llm": "Several extra bits of precision at the same parameters. This is the OpenFHE default.",
  "libs": [
   [
    "OpenFHE",
    "https://github.com/openfheorg/openfhe-development"
   ]
  ],
  "followups": "",
  "status": "Widely used",
  "kind": "Variant",
  "id": 3
 },
 {
  "group": "1. CKKS and its variants",
  "name": "Sparse-secret encapsulation CKKS",
  "year": 2022,
  "venue": "ACNS 2022",
  "authors": "Bossuat, Troncoso-Pastoriza, Hubaux",
  "title": "Bootstrapping for Approximate Homomorphic Encryption with Negligible Failure-Probability by Using Sparse-Secret Encapsulation",
  "paper": "https://eprint.iacr.org/2022/024",
  "assumption": "RLWE",
  "plaintext": "Approximate real/complex",
  "simd": "Yes",
  "boot": "Yes, faster with dense secrets",
  "pq": "Yes",
  "llm": "Gets fast bootstrapping without weakening the main secret key.",
  "libs": [
   [
    "Lattigo",
    "https://github.com/tuneinsight/lattigo"
   ]
  ],
  "followups": "",
  "status": "Active",
  "kind": "Variant",
  "id": 4
 },
 {
  "group": "1. CKKS and its variants",
  "name": "IND-CPA-D secure CKKS (noise flooding)",
  "year": 2022,
  "venue": "CRYPTO 2022",
  "authors": "Li, Micciancio, Schultz, Sorrell",
  "title": "Securing Approximate Homomorphic Encryption Using Differential Privacy",
  "paper": "https://eprint.iacr.org/2022/816",
  "assumption": "RLWE",
  "plaintext": "Approximate real/complex",
  "simd": "Yes",
  "boot": "Yes",
  "pq": "Yes",
  "llm": "Needed when decrypted results go back to the server or other parties. Fixes the Li–Micciancio key-recovery attack (EUROCRYPT 2021).",
  "libs": [
   [
    "OpenFHE",
    "https://github.com/openfheorg/openfhe-development"
   ]
  ],
  "followups": "Discrete-CKKS high-precision bootstrapping (2025/1786) supports the large precision noise flooding needs.",
  "status": "Active",
  "kind": "Variant",
  "id": 5
 },
 {
  "group": "1. CKKS and its variants",
  "name": "META-BTS (iterative CKKS bootstrapping)",
  "year": 2022,
  "venue": "CCS 2022",
  "authors": "Bae, Cheon, Cho, Kim, Kim",
  "title": "META-BTS: Bootstrapping Precision Beyond the Limit",
  "paper": "https://eprint.iacr.org/2022/1167",
  "assumption": "RLWE",
  "plaintext": "Approximate, high precision",
  "simd": "Yes",
  "boot": "Yes, iterated",
  "pq": "Yes",
  "llm": "Raises precision for deep circuits such as many-layer LLMs.",
  "libs": [],
  "followups": "",
  "status": "Active",
  "kind": "Variant",
  "id": 6
 },
 {
  "group": "1. CKKS and its variants",
  "name": "Grafting (decoupled scale and modulus)",
  "year": 2024,
  "venue": "IACR ePrint 2024/1014",
  "authors": "Cheon, Hanrot, Kim, Stehlé",
  "title": "Grafting: Decoupled Scale Factors and Modulus in RNS-CKKS",
  "paper": "https://eprint.iacr.org/2024/1014",
  "assumption": "RLWE",
  "plaintext": "Approximate real/complex",
  "simd": "Yes",
  "boot": "Yes",
  "pq": "Yes",
  "llm": "Allows word-sized primes with arbitrary scales, which suits 32/64-bit GPU arithmetic.",
  "libs": [],
  "followups": "Used by Zephyr (2026/932) for 32-bit GPU CKKS.",
  "status": "Active SOTA",
  "kind": "Variant",
  "id": 7
 },
 {
  "group": "1. CKKS and its variants",
  "name": "SHIP bootstrapping",
  "year": 2025,
  "venue": "EUROCRYPT 2025",
  "authors": "Cheon, Hanrot, Kim, Stehlé",
  "title": "SHIP: A Shallow and Highly Parallelizable CKKS Bootstrapping Algorithm",
  "paper": "https://eprint.iacr.org/2025/784",
  "assumption": "RLWE",
  "plaintext": "Approximate real/complex",
  "simd": "Yes",
  "boot": "Yes, very shallow",
  "pq": "Yes",
  "llm": "Consumes few levels, but the SoK notes its keys are larger than classic bootstrapping.",
  "libs": [],
  "followups": "",
  "status": "Active SOTA",
  "kind": "Variant",
  "id": 8
 },
 {
  "group": "1. CKKS and its variants",
  "name": "PaCo bootstrapping",
  "year": 2025,
  "venue": "IACR ePrint 2025/886",
  "authors": "Coron, Seuré",
  "title": "PaCo: Bootstrapping for CKKS via Partial CoeffToSlot",
  "paper": "https://eprint.iacr.org/2025/886",
  "assumption": "RLWE",
  "plaintext": "Approximate real/complex",
  "simd": "Yes",
  "boot": "Yes, about 0.25 GB keys",
  "pq": "Yes",
  "llm": "Small bootstrapping keys address the memory wall the SoK highlights.",
  "libs": [],
  "followups": "Sub-10 ms CKKS bootstrapping on GPU (2026/2119).",
  "status": "Active SOTA",
  "kind": "Variant",
  "id": 9
 },
 {
  "group": "1. CKKS and its variants",
  "name": "Discrete CKKS (BLEACH)",
  "year": 2024,
  "venue": "J. Cryptology 2024",
  "authors": "Drucker, Moshkowich, Pelleg, Shaul",
  "title": "BLEACH: Cleaning Errors in Discrete Computations over CKKS",
  "paper": "https://eprint.iacr.org/2022/1298",
  "assumption": "RLWE",
  "plaintext": "Bits and small integers inside CKKS",
  "simd": "Yes",
  "boot": "Yes",
  "pq": "Yes",
  "llm": "Exact logic and comparisons inside CKKS, for example for argmax and sampling, without switching schemes.",
  "libs": [],
  "followups": "XBOOT free-XOR gates (TCHES 2025, 2025/074); faster logical operations (2026/732).",
  "status": "Active",
  "kind": "Variant",
  "id": 10
 },
 {
  "group": "1. CKKS and its variants",
  "name": "Bit-CKKS (bootstrapping bits with CKKS)",
  "year": 2024,
  "venue": "EUROCRYPT 2024",
  "authors": "Bae, Cheon, Kim, Stehlé",
  "title": "Bootstrapping Bits with CKKS",
  "paper": "https://eprint.iacr.org/2024/767",
  "assumption": "RLWE",
  "plaintext": "Bits",
  "simd": "Yes",
  "boot": "Yes, amortized faster than TFHE for large batches",
  "pq": "Yes",
  "llm": "Turns CKKS into a high-throughput boolean FHE.",
  "libs": [],
  "followups": "",
  "status": "Active SOTA",
  "kind": "Variant",
  "id": 11
 },
 {
  "group": "1. CKKS and its variants",
  "name": "CKKS integer computer",
  "year": 2025,
  "venue": "TCHES 2025",
  "authors": "Kim",
  "title": "Efficient Homomorphic Integer Computer from CKKS",
  "paper": "https://eprint.iacr.org/2025/066",
  "assumption": "RLWE",
  "plaintext": "Exact 64-bit integer arithmetic via discrete CKKS",
  "simd": "Yes",
  "boot": "Yes",
  "pq": "Yes",
  "llm": "Exact integer arithmetic for quantized-integer LLM layers within one scheme.",
  "libs": [],
  "followups": "Large finite rings with CKKS (2026/2190).",
  "status": "Active SOTA",
  "kind": "Variant",
  "id": 12
 },
 {
  "group": "1. CKKS and its variants",
  "name": "CKKS functional bootstrapping",
  "year": 2025,
  "venue": "CRYPTO 2025",
  "authors": "Alexandru, Kim, Polyakov",
  "title": "General Functional Bootstrapping using CKKS",
  "paper": "https://eprint.iacr.org/2024/1623",
  "assumption": "RLWE",
  "plaintext": "Lookup tables on small integers",
  "simd": "Yes",
  "boot": "Yes, evaluates a LUT while refreshing",
  "pq": "Yes",
  "llm": "TFHE-like LUTs at CKKS throughput. The SoK names it a robustness direction for piecewise non-linearities.",
  "libs": [
   [
    "OpenFHE",
    "https://github.com/openfheorg/openfhe-development"
   ]
  ],
  "followups": "Fourier-extension FBS (2026/367); SWIFT shallow FBS (2026/1163); low-rank FBS (2026/1264).",
  "status": "Active SOTA",
  "kind": "Variant",
  "id": 13
 },
 {
  "group": "2. Exact word-wise FHE (BGV / BFV family)",
  "name": "BGV",
  "year": 2012,
  "venue": "ITCS 2012",
  "authors": "Brakerski, Gentry, Vaikuntanathan",
  "title": "(Leveled) Fully Homomorphic Encryption without Bootstrapping",
  "paper": "https://eprint.iacr.org/2011/277",
  "assumption": "RLWE / LWE",
  "plaintext": "Exact integers mod p",
  "simd": "Yes",
  "boot": "Yes, slow (digit extraction)",
  "pq": "Yes",
  "llm": "Exact arithmetic suits integer-quantized LLMs, but there is no cheap rescaling of real values and bootstrapping is costly.",
  "libs": [
   [
    "OpenFHE",
    "https://github.com/openfheorg/openfhe-development"
   ],
   [
    "HElib",
    "https://github.com/homenc/HElib"
   ],
   [
    "SEAL",
    "https://github.com/microsoft/SEAL"
   ],
   [
    "Lattigo",
    "https://github.com/tuneinsight/lattigo"
   ]
  ],
  "followups": "Bootstrapping for BGV and BFV revisited (2022/1363); relaxed functional bootstrapping (2024/172).",
  "status": "Widely used",
  "kind": "Scheme",
  "id": 14
 },
 {
  "group": "2. Exact word-wise FHE (BGV / BFV family)",
  "name": "BFV",
  "year": 2012,
  "venue": "CRYPTO 2012 / ePrint 2012",
  "authors": "Brakerski; Fan, Vercauteren",
  "title": "Somewhat Practical Fully Homomorphic Encryption",
  "paper": "https://eprint.iacr.org/2012/144",
  "assumption": "RLWE",
  "plaintext": "Exact integers mod p",
  "simd": "Yes",
  "boot": "Yes, slow",
  "pq": "Yes",
  "llm": "Most used for linear layers in HE+MPC hybrids such as Cheetah, BOLT and BumbleBee.",
  "libs": [
   [
    "OpenFHE",
    "https://github.com/openfheorg/openfhe-development"
   ],
   [
    "SEAL",
    "https://github.com/microsoft/SEAL"
   ],
   [
    "Lattigo",
    "https://github.com/tuneinsight/lattigo"
   ],
   [
    "Phantom",
    "https://github.com/encryptorion-lab/phantom-fhe"
   ],
   [
    "HEonGPU",
    "https://github.com/Alisah-Ozcan/HEonGPU"
   ]
  ],
  "followups": "Scale-invariant LWE scheme (Brakerski, 2012/078); RNS BFV/BGV (Kim–Polyakov–Zucca, 2021/204).",
  "status": "Widely used",
  "kind": "Scheme",
  "id": 15
 },
 {
  "group": "2. Exact word-wise FHE (BGV / BFV family)",
  "name": "CLPX (high-precision BFV)",
  "year": 2018,
  "venue": "CT-RSA 2018",
  "authors": "Chen, Laine, Player, Xia",
  "title": "High-Precision Arithmetic in Homomorphic Encryption",
  "paper": "https://eprint.iacr.org/2017/809",
  "assumption": "RLWE",
  "plaintext": "Exact large integers / rationals (plaintext modulus x−b)",
  "simd": "Limited",
  "boot": "Yes",
  "pq": "Yes",
  "llm": "Exact high-precision values without CKKS error, at the cost of SIMD width.",
  "libs": [],
  "followups": "Generalized by GBFV.",
  "status": "Niche",
  "kind": "Scheme",
  "id": 16
 },
 {
  "group": "2. Exact word-wise FHE (BGV / BFV family)",
  "name": "Generalized BFV (GBFV)",
  "year": 2025,
  "venue": "EUROCRYPT 2025",
  "authors": "Geelen, Vercauteren",
  "title": "Fully Homomorphic Encryption for Cyclotomic Prime Moduli",
  "paper": "https://eprint.iacr.org/2024/1587",
  "assumption": "RLWE",
  "plaintext": "Exact, polynomial plaintext modulus t(x)",
  "simd": "Yes, tunable",
  "boot": "Yes",
  "pq": "Yes",
  "llm": "Unifies BFV and CLPX and trades SIMD width for precision. A flexible exact alternative to CKKS.",
  "libs": [],
  "followups": "Bootstrapping GBFV with CKKS (2025/888); FHE on the ring of Gaussian periods (CT-RSA 2026, 2026/927).",
  "status": "Active SOTA",
  "kind": "Scheme",
  "id": 17
 },
 {
  "group": "2. Exact word-wise FHE (BGV / BFV family)",
  "name": "High-precision exact FHE",
  "year": 2026,
  "venue": "CRYPTO 2026",
  "authors": "Peikert, Zarchy, Zyskind",
  "title": "High-Precision Exact FHE Made Simple, General, and Fast",
  "paper": "https://eprint.iacr.org/2025/2321",
  "assumption": "(R)LWE",
  "plaintext": "Exact arithmetic mod huge p or 2^k",
  "simd": "Yes",
  "boot": "Yes",
  "pq": "Yes",
  "llm": "Exact large-modulus arithmetic. Could replace CKKS where exact fixed-point semantics matter.",
  "libs": [],
  "followups": "",
  "status": "Active SOTA (emerging)",
  "kind": "Scheme",
  "id": 18
 },
 {
  "group": "2. Exact word-wise FHE (BGV / BFV family)",
  "name": "Module-LWE HE (ModHE)",
  "year": 2024,
  "venue": "TCHES 2024",
  "authors": "Mukherjee, Aikata, Mert, Lee, Kwon, Deryabin, Roy",
  "title": "ModHE: Modular Homomorphic Encryption Using Module Lattices: Potentials and Limitations",
  "paper": "https://eprint.iacr.org/2023/895",
  "assumption": "Module-LWE",
  "plaintext": "Exact or approximate (BGV/BFV/CKKS-style)",
  "simd": "Yes",
  "boot": "Yes",
  "pq": "Yes",
  "llm": "Module lattices allow finer parameter choice than power-of-two rings.",
  "libs": [],
  "followups": "Revisiting module-lattice HE (CIC 2025, 2025/1218).",
  "status": "Niche",
  "kind": "Scheme",
  "id": 19
 },
 {
  "group": "3. Bit-wise / lookup-table FHE (GSW, FHEW, TFHE family)",
  "name": "GSW",
  "year": 2013,
  "venue": "CRYPTO 2013",
  "authors": "Gentry, Sahai, Waters",
  "title": "Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based",
  "paper": "https://eprint.iacr.org/2013/340",
  "assumption": "LWE",
  "plaintext": "Bits / small integers",
  "simd": "No",
  "boot": "Yes (via AP14)",
  "pq": "Yes",
  "llm": "Basis of blind rotation in FHEW/TFHE. Not used directly for ML.",
  "libs": [],
  "followups": "Faster bootstrapping with polynomial error (Alperin-Sheriff–Peikert, 2014/094); CCA1-secure GG-GSW (2026/316).",
  "status": "Foundational",
  "kind": "Scheme",
  "id": 20
 },
 {
  "group": "3. Bit-wise / lookup-table FHE (GSW, FHEW, TFHE family)",
  "name": "FHEW (DM)",
  "year": 2015,
  "venue": "EUROCRYPT 2015",
  "authors": "Ducas, Micciancio",
  "title": "FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second",
  "paper": "https://eprint.iacr.org/2014/816",
  "assumption": "LWE + RGSW",
  "plaintext": "Bits / small integers via LUT",
  "simd": "No (amortized variants exist)",
  "boot": "Yes, fast per gate",
  "pq": "Yes",
  "llm": "Exact non-linear lookups, but no SIMD, so large matrix products are impractical.",
  "libs": [
   [
    "OpenFHE",
    "https://github.com/openfheorg/openfhe-development"
   ]
  ],
  "followups": "Ring packing and amortized FHEW bootstrapping (2018/532).",
  "status": "Widely used",
  "kind": "Scheme",
  "id": 21
 },
 {
  "group": "3. Bit-wise / lookup-table FHE (GSW, FHEW, TFHE family)",
  "name": "TFHE (CGGI)",
  "year": 2016,
  "venue": "ASIACRYPT 2016 / J. Cryptology 2020",
  "authors": "Chillotti, Gama, Georgieva, Izabachène",
  "title": "TFHE: Fast Fully Homomorphic Encryption over the Torus",
  "paper": "https://eprint.iacr.org/2018/421",
  "assumption": "Torus LWE / GLWE",
  "plaintext": "Bits / small integers via LUT",
  "simd": "No",
  "boot": "Yes, programmable bootstrapping in ms",
  "pq": "Yes",
  "llm": "Main CKKS rival for non-linearities: exact activations by LUT. Slow for large linear algebra. Concrete ML targets quantized models.",
  "libs": [
   [
    "TFHE-rs",
    "https://github.com/zama-ai/tfhe-rs"
   ],
   [
    "TFHE (C++)",
    "https://github.com/tfhe/tfhe"
   ],
   [
    "Concrete ML",
    "https://github.com/zama-ai/concrete-ml"
   ],
   [
    "OpenFHE",
    "https://github.com/openfheorg/openfhe-development"
   ]
  ],
  "followups": "Programmable bootstrapping for DNNs (2021/091); floating point in TFHE (2025/257).",
  "status": "Widely used",
  "kind": "Scheme",
  "id": 22
 },
 {
  "group": "3. Bit-wise / lookup-table FHE (GSW, FHEW, TFHE family)",
  "name": "FHEW with small keys (LMKCDEY)",
  "year": 2023,
  "venue": "EUROCRYPT 2023",
  "authors": "Lee, Micciancio, Kim, Choi, Deryabin, Eom, Yoo",
  "title": "Efficient FHEW Bootstrapping with Small Evaluation Keys, and Applications to Threshold Homomorphic Encryption",
  "paper": "https://eprint.iacr.org/2022/198",
  "assumption": "RLWE (automorphism-based blind rotation)",
  "plaintext": "Bits / small integers",
  "simd": "No",
  "boot": "Yes, small keys",
  "pq": "Yes",
  "llm": "Small keys and good threshold support. In OpenFHE.",
  "libs": [
   [
    "OpenFHE",
    "https://github.com/openfheorg/openfhe-development"
   ]
  ],
  "followups": "LFHE: bootstrapping keys under 1 MB (2023/767); large-plaintext FBS with small keys (2025/1717).",
  "status": "Active",
  "kind": "Scheme",
  "id": 23
 },
 {
  "group": "3. Bit-wise / lookup-table FHE (GSW, FHEW, TFHE family)",
  "name": "FINAL (NTRU + LWE)",
  "year": 2022,
  "venue": "ASIACRYPT 2022",
  "authors": "Bonte, Iliashenko, Park, Pereira, Smart",
  "title": "FINAL: Faster FHE Instantiated with NTRU and LWE",
  "paper": "https://eprint.iacr.org/2022/074",
  "assumption": "NTRU + LWE",
  "plaintext": "Bits",
  "simd": "No",
  "boot": "Yes, fast",
  "pq": "Yes",
  "llm": "NTRU-based gate bootstrapping with smaller keys than TFHE.",
  "libs": [
   [
    "FINAL",
    "https://github.com/KULeuven-COSIC/FINAL"
   ]
  ],
  "followups": "FINALLY multi-key NTRU FHE (CIC 2024, 2024/1505).",
  "status": "Niche",
  "kind": "Scheme",
  "id": 24
 },
 {
  "group": "3. Bit-wise / lookup-table FHE (GSW, FHEW, TFHE family)",
  "name": "SIMD ALU FHE with O(1) bootstrapping",
  "year": 2026,
  "venue": "CRYPTO 2026",
  "authors": "Gao, Zheng",
  "title": "FHE for SIMD Arithmetic Logic Units with Amortized O(1) Bootstrapping per Ciphertext",
  "paper": "https://eprint.iacr.org/2026/233",
  "assumption": "(R)LWE",
  "plaintext": "Machine words (e.g. 64-bit) with SIMD",
  "simd": "Yes",
  "boot": "Yes, amortized O(1) per ciphertext",
  "pq": "Yes",
  "llm": "Brings SIMD to word-level arithmetic and logic, narrowing the TFHE vs CKKS gap.",
  "libs": [],
  "followups": "High-precision homomorphic ALU over arbitrary moduli (2026/1869).",
  "status": "Active SOTA (emerging)",
  "kind": "Scheme",
  "id": 25
 },
 {
  "group": "4. Matrix-native FHE",
  "name": "Gentry–Lee (GL) matrix FHE",
  "year": 2025,
  "venue": "IACR ePrint 2025/1935",
  "authors": "Gentry, Lee",
  "title": "Fully Homomorphic Encryption for Matrix Arithmetic",
  "paper": "https://eprint.iacr.org/2025/1935",
  "assumption": "RLWE-style (matrix rings)",
  "plaintext": "Approximate real matrices (CKKS-like)",
  "simd": "Native matrices",
  "boot": "Yes",
  "pq": "Yes",
  "llm": "Strongest candidate successor to CKKS for LLMs. Matrix products need few rotations and few keys. The SoK expects its findings to transfer.",
  "libs": [],
  "followups": "Efficient GL bootstrapping (2026/956); low-depth bootstrapping (2026/811); Trace-Factored BigSwitch keys (2026/2058); first GPU Transformer on GL: Terrazzo (2026/1870).",
  "status": "Active SOTA (emerging)",
  "kind": "Scheme",
  "id": 26
 },
 {
  "group": "4. Matrix-native FHE",
  "name": "Generalized BGV/BFV/CKKS over matrix rings",
  "year": 2025,
  "venue": "IACR ePrint 2025/972",
  "authors": "Mali",
  "title": "Generalized BGV, BFV, and CKKS for Homomorphic Encryption over Matrix Rings",
  "paper": "https://eprint.iacr.org/2025/972",
  "assumption": "Matrix-ring LWE",
  "plaintext": "Exact or approximate matrices",
  "simd": "Native matrices",
  "boot": "Yes",
  "pq": "Yes",
  "llm": "Native plaintext-ciphertext and ciphertext-ciphertext matrix products without slot packing.",
  "libs": [],
  "followups": "",
  "status": "Active SOTA (emerging)",
  "kind": "Scheme",
  "id": 27
 },
 {
  "group": "5. Earlier and other FHE constructions",
  "name": "Gentry's FHE",
  "year": 2009,
  "venue": "STOC 2009",
  "authors": "Gentry",
  "title": "Fully Homomorphic Encryption Using Ideal Lattices",
  "paper": "https://doi.org/10.1145/1536414.1536440",
  "assumption": "Ideal lattices + sparse subset sum",
  "plaintext": "Bits",
  "simd": "No",
  "boot": "Yes (first ever)",
  "pq": "Yes",
  "llm": "Historical. It introduced bootstrapping, but it is far too slow.",
  "libs": [],
  "followups": "Gentry–Halevi implementation (EUROCRYPT 2011).",
  "status": "Foundational",
  "kind": "Scheme",
  "id": 28
 },
 {
  "group": "5. Earlier and other FHE constructions",
  "name": "DGHV (FHE over the integers)",
  "year": 2010,
  "venue": "EUROCRYPT 2010",
  "authors": "van Dijk, Gentry, Halevi, Vaikuntanathan",
  "title": "Fully Homomorphic Encryption over the Integers",
  "paper": "https://eprint.iacr.org/2009/616",
  "assumption": "Approximate GCD",
  "plaintext": "Bits",
  "simd": "Limited (later batch variants)",
  "boot": "Yes",
  "pq": "Yes",
  "llm": "Conceptually simple but has large keys. Not used for ML.",
  "libs": [],
  "followups": "",
  "status": "Foundational",
  "kind": "Scheme",
  "id": 29
 },
 {
  "group": "5. Earlier and other FHE constructions",
  "name": "Smart–Vercauteren (SIMD FHE)",
  "year": 2010,
  "venue": "PKC 2010",
  "authors": "Smart, Vercauteren",
  "title": "Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes",
  "paper": "https://eprint.iacr.org/2009/571",
  "assumption": "Principal ideal lattices",
  "plaintext": "Bits / small field elements",
  "simd": "Yes (first SIMD packing)",
  "boot": "Yes",
  "pq": "No (later attacks on principal ideals)",
  "llm": "Introduced the SIMD slot packing that CKKS relies on.",
  "libs": [],
  "followups": "Fully homomorphic SIMD operations (2011/133).",
  "status": "Foundational",
  "kind": "Scheme",
  "id": 30
 },
 {
  "group": "5. Earlier and other FHE constructions",
  "name": "BV11 (FHE from LWE)",
  "year": 2011,
  "venue": "FOCS 2011",
  "authors": "Brakerski, Vaikuntanathan",
  "title": "Efficient Fully Homomorphic Encryption from (Standard) LWE",
  "paper": "https://eprint.iacr.org/2011/344",
  "assumption": "LWE",
  "plaintext": "Bits",
  "simd": "No",
  "boot": "Yes",
  "pq": "Yes",
  "llm": "First FHE from standard LWE. Its relinearization and modulus switching are used by all modern schemes.",
  "libs": [],
  "followups": "Ring-LWE version: Brakerski–Vaikuntanathan CRYPTO 2011.",
  "status": "Foundational",
  "kind": "Scheme",
  "id": 31
 },
 {
  "group": "5. Earlier and other FHE constructions",
  "name": "LTV (NTRU multi-key FHE)",
  "year": 2012,
  "venue": "STOC 2012",
  "authors": "López-Alt, Tromer, Vaikuntanathan",
  "title": "On-the-Fly Multiparty Computation on the Cloud via Multikey Fully Homomorphic Encryption",
  "paper": "https://eprint.iacr.org/2013/094",
  "assumption": "NTRU",
  "plaintext": "Bits",
  "simd": "Limited",
  "boot": "Yes",
  "pq": "Weakened (overstretched NTRU)",
  "llm": "First multi-key FHE. Overstretched-NTRU attacks limit its parameters.",
  "libs": [],
  "followups": "YASHE (2013/075), also affected.",
  "status": "Foundational",
  "kind": "Scheme",
  "id": 32
 },
 {
  "group": "5. Earlier and other FHE constructions",
  "name": "YASHE",
  "year": 2013,
  "venue": "IMA Cryptography and Coding 2013",
  "authors": "Bos, Lauter, Loftus, Naehrig",
  "title": "Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme",
  "paper": "https://eprint.iacr.org/2013/075",
  "assumption": "NTRU + RLWE",
  "plaintext": "Exact integers",
  "simd": "Yes",
  "boot": "Leveled",
  "pq": "Broken parameters (subfield attacks)",
  "llm": "Once competitive with BFV. Abandoned after overstretched-NTRU attacks.",
  "libs": [],
  "followups": "",
  "status": "Deprecated",
  "kind": "Scheme",
  "id": 33
 },
 {
  "group": "5. Earlier and other FHE constructions",
  "name": "CCA-secure FHE",
  "year": 2025,
  "venue": "CRYPTO 2025",
  "authors": "Yang, Yu, Susilo",
  "title": "Fully Homomorphic Encryption with Chosen-Ciphertext Security from LWE",
  "paper": "https://eprint.iacr.org/2026/1756",
  "assumption": "Circular-secure LWE",
  "plaintext": "Bits",
  "simd": "No",
  "boot": "Yes",
  "pq": "Yes",
  "llm": "Stronger security when the server may act as a decryption oracle, which CKKS cannot provide.",
  "libs": [],
  "followups": "GG-GSW: IND-CCA1 leveled FHE (2026/316).",
  "status": "Active (theory)",
  "kind": "Scheme",
  "id": 34
 },
 {
  "group": "6. Multi-party FHE (threshold and multi-key)",
  "name": "Threshold FHE (AJLTVW)",
  "year": 2012,
  "venue": "EUROCRYPT 2012",
  "authors": "Asharov, Jain, López-Alt, Tromer, Vaikuntanathan, Wichs",
  "title": "Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE",
  "paper": "https://eprint.iacr.org/2011/613",
  "assumption": "LWE",
  "plaintext": "Any (scheme-agnostic)",
  "simd": "Depends on base scheme",
  "boot": "Yes",
  "pq": "Yes",
  "llm": "Splits the decryption key so the model owner and user can jointly control decryption.",
  "libs": [],
  "followups": "Threshold cryptosystems from threshold FHE (Boneh et al., CRYPTO 2018, 2017/956).",
  "status": "Foundational",
  "kind": "Scheme",
  "id": 35
 },
 {
  "group": "6. Multi-party FHE (threshold and multi-key)",
  "name": "Multiparty HE (MHE) for BFV/CKKS",
  "year": 2021,
  "venue": "PETS 2021",
  "authors": "Mouchet, Troncoso-Pastoriza, Bossuat, Hubaux",
  "title": "Multiparty Homomorphic Encryption from Ring-Learning-with-Errors",
  "paper": "https://eprint.iacr.org/2020/304",
  "assumption": "RLWE",
  "plaintext": "Approximate (CKKS) or exact (BFV)",
  "simd": "Yes",
  "boot": "Yes, interactive or collective",
  "pq": "Yes",
  "llm": "Practical threshold CKKS for jointly protecting data and model weights.",
  "libs": [
   [
    "Lattigo",
    "https://github.com/tuneinsight/lattigo"
   ],
   [
    "OpenFHE",
    "https://github.com/openfheorg/openfhe-development"
   ]
  ],
  "followups": "Low-communication threshold FHE from Module-LWE (ASIACRYPT 2025, 2025/409); Shamir-based ThFHE (CCS 2026, 2026/1559); Ajax threshold FHEW (USENIX Security 2026, 2025/1834).",
  "status": "Active SOTA",
  "kind": "Scheme",
  "id": 36
 },
 {
  "group": "6. Multi-party FHE (threshold and multi-key)",
  "name": "Multi-key CKKS / BFV (CDKS19)",
  "year": 2019,
  "venue": "CCS 2019",
  "authors": "Chen, Dai, Kim, Song",
  "title": "Efficient Multi-Key Homomorphic Encryption with Packed Ciphertexts with Application to Oblivious Neural Network Inference",
  "paper": "https://eprint.iacr.org/2019/524",
  "assumption": "RLWE",
  "plaintext": "Approximate or exact",
  "simd": "Yes",
  "boot": "Yes",
  "pq": "Yes",
  "llm": "Client and model owner each keep their own key, and inference runs on their joint ciphertexts.",
  "libs": [],
  "followups": "MK-FHE without setup in the plain model (CRYPTO 2026, 2026/322).",
  "status": "Active",
  "kind": "Scheme",
  "id": 37
 },
 {
  "group": "6. Multi-party FHE (threshold and multi-key)",
  "name": "Multi-key TFHE",
  "year": 2019,
  "venue": "ASIACRYPT 2019",
  "authors": "Chen, Chillotti, Song",
  "title": "Multi-Key Homomorphic Encryption from TFHE",
  "paper": "https://eprint.iacr.org/2019/116",
  "assumption": "Torus LWE",
  "plaintext": "Bits",
  "simd": "No",
  "boot": "Yes",
  "pq": "Yes",
  "llm": "Multi-key gate bootstrapping for joint data from several parties.",
  "libs": [],
  "followups": "Mukherjee–Wichs two-round MPC (2015/345); Clear–McGoldrick (2014/798); FINALLY (2024/1505).",
  "status": "Niche",
  "kind": "Scheme",
  "id": 38
 },
 {
  "group": "7. Scheme switching and hybrid (transciphering) HE",
  "name": "CHIMERA",
  "year": 2020,
  "venue": "J. Mathematical Cryptology 2020",
  "authors": "Boura, Gama, Georgieva, Jetchev",
  "title": "CHIMERA: Combining Ring-LWE-based Fully Homomorphic Encryption Schemes",
  "paper": "https://eprint.iacr.org/2018/758",
  "assumption": "RLWE / TLWE",
  "plaintext": "Mixed (TFHE, BFV, CKKS)",
  "simd": "Yes (CKKS/BFV side)",
  "boot": "Yes",
  "pq": "Yes",
  "llm": "Use CKKS for linear layers and TFHE for exact non-linearities.",
  "libs": [],
  "followups": "",
  "status": "Foundational",
  "kind": "Scheme",
  "id": 39
 },
 {
  "group": "7. Scheme switching and hybrid (transciphering) HE",
  "name": "PEGASUS (CKKS ↔ FHEW)",
  "year": 2021,
  "venue": "IEEE S&P 2021",
  "authors": "Lu, Huang, Hong, Ma, Qu",
  "title": "PEGASUS: Bridging Polynomial and Non-polynomial Evaluations in Homomorphic Encryption",
  "paper": "https://eprint.iacr.org/2020/1606",
  "assumption": "RLWE / LWE",
  "plaintext": "Approximate + LUT",
  "simd": "Yes",
  "boot": "Yes",
  "pq": "Yes",
  "llm": "Avoids high-degree polynomials for Softmax and GELU, but switching is costly.",
  "libs": [
   [
    "OpenPEGASUS",
    "https://github.com/Alibaba-Gemini-Lab/OpenPEGASUS"
   ],
   [
    "OpenFHE",
    "https://github.com/openfheorg/openfhe-development"
   ]
  ],
  "followups": "Hybrid CKKS/TFHE LLM decoding: ROSETTA (2026/2047).",
  "status": "Active",
  "kind": "Scheme",
  "id": 40
 },
 {
  "group": "7. Scheme switching and hybrid (transciphering) HE",
  "name": "HERA / Rubato (CKKS transciphering)",
  "year": 2021,
  "venue": "ASIACRYPT 2021; EUROCRYPT 2022",
  "authors": "Cho, Ha, Kim, Lee, Lee, Lee, Moon, Yoon; Ha, Kim, Lee, Lee, Son",
  "title": "Transciphering Framework for Approximate Homomorphic Encryption",
  "paper": "https://eprint.iacr.org/2020/1335",
  "assumption": "Symmetric cipher + RLWE",
  "plaintext": "Approximate real (to CKKS)",
  "simd": "Yes",
  "boot": "Uses CKKS bootstrapping",
  "pq": "Partly (cipher-dependent)",
  "llm": "Client sends small symmetric ciphertexts and the server converts them to CKKS. This cuts upload size for long prompts.",
  "libs": [],
  "followups": "Rubato (2022/537); key-recovery attack on Rubato (2023/822); HHE survey (2025/071).",
  "status": "Active",
  "kind": "Scheme",
  "id": 41
 },
 {
  "group": "7. Scheme switching and hybrid (transciphering) HE",
  "name": "Pasta / Rasta / Kreyvium / Elisabeth (HHE ciphers)",
  "year": 2021,
  "venue": "TCHES 2023 (Pasta, ePrint 2021); CRYPTO 2018 (Rasta); FSE 2016 (Kreyvium); ASIACRYPT 2022 (Elisabeth)",
  "authors": "Dobraunig et al.; Canteaut et al.; Cosseron et al.",
  "title": "Pasta: A Case for Hybrid Homomorphic Encryption",
  "paper": "https://eprint.iacr.org/2021/731",
  "assumption": "Symmetric (HE-friendly)",
  "plaintext": "Exact (BFV) or bits (TFHE)",
  "simd": "Depends",
  "boot": "n/a",
  "pq": "Symmetric security",
  "llm": "HE-friendly symmetric ciphers that shrink client-side ciphertext expansion.",
  "libs": [
   [
    "Swift-HE ciphers (Pasta)",
    "https://github.com/IAIK/hybrid-HE-framework"
   ]
  ],
  "followups": "Rasta (2018/181); Kreyvium (2015/113); Elisabeth (2022/180).",
  "status": "Active",
  "kind": "Scheme",
  "id": 42
 },
 {
  "group": "8. Partially homomorphic encryption",
  "name": "Paillier",
  "year": 1999,
  "venue": "EUROCRYPT 1999",
  "authors": "Paillier",
  "title": "Public-Key Cryptosystems Based on Composite Degree Residuosity Classes",
  "paper": "https://doi.org/10.1007/3-540-48910-X_16",
  "assumption": "Decisional composite residuosity",
  "plaintext": "Integers mod n, additions only",
  "simd": "No",
  "boot": "n/a (no multiplication)",
  "pq": "No",
  "llm": "Only linear operations on encrypted data. Used for secure aggregation, not full Transformers.",
  "libs": [
   [
    "python-paillier",
    "https://github.com/data61/python-paillier"
   ]
  ],
  "followups": "Damgård–Jurik generalization (PKC 2001).",
  "status": "Widely used",
  "kind": "Scheme",
  "id": 43
 },
 {
  "group": "8. Partially homomorphic encryption",
  "name": "Damgård–Jurik",
  "year": 2001,
  "venue": "PKC 2001",
  "authors": "Damgård, Jurik",
  "title": "A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System",
  "paper": "https://doi.org/10.1007/3-540-44586-2_9",
  "assumption": "Decisional composite residuosity",
  "plaintext": "Integers mod n^s, additions",
  "simd": "No",
  "boot": "n/a",
  "pq": "No",
  "llm": "Larger plaintext space than Paillier. Used in voting and threshold settings.",
  "libs": [],
  "followups": "",
  "status": "Niche",
  "kind": "Scheme",
  "id": 44
 },
 {
  "group": "8. Partially homomorphic encryption",
  "name": "ElGamal (multiplicative / exponential)",
  "year": 1985,
  "venue": "IEEE Trans. Inf. Theory 1985",
  "authors": "ElGamal",
  "title": "A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms",
  "paper": "https://doi.org/10.1109/TIT.1985.1057074",
  "assumption": "DDH",
  "plaintext": "Group elements (× or + in exponent)",
  "simd": "No",
  "boot": "n/a",
  "pq": "No",
  "llm": "One operation only. Exponential EC-ElGamal is used for small encrypted sums.",
  "libs": [],
  "followups": "",
  "status": "Foundational",
  "kind": "Scheme",
  "id": 45
 },
 {
  "group": "8. Partially homomorphic encryption",
  "name": "RSA (multiplicative)",
  "year": 1978,
  "venue": "Commun. ACM 1978",
  "authors": "Rivest, Shamir, Adleman",
  "title": "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems",
  "paper": "https://doi.org/10.1145/359340.359342",
  "assumption": "RSA / factoring",
  "plaintext": "Integers mod n, multiplications only",
  "simd": "No",
  "boot": "n/a",
  "pq": "No",
  "llm": "Textbook RSA is multiplicatively homomorphic but not semantically secure.",
  "libs": [],
  "followups": "",
  "status": "Foundational",
  "kind": "Scheme",
  "id": 46
 },
 {
  "group": "8. Partially homomorphic encryption",
  "name": "Goldwasser–Micali",
  "year": 1984,
  "venue": "JCSS 1984",
  "authors": "Goldwasser, Micali",
  "title": "Probabilistic Encryption",
  "paper": "https://doi.org/10.1016/0022-0000(84)90070-9",
  "assumption": "Quadratic residuosity",
  "plaintext": "Bits, XOR only",
  "simd": "No",
  "boot": "n/a",
  "pq": "No",
  "llm": "First semantically secure scheme, XOR-homomorphic.",
  "libs": [],
  "followups": "",
  "status": "Foundational",
  "kind": "Scheme",
  "id": 47
 },
 {
  "group": "8. Partially homomorphic encryption",
  "name": "BGN (one multiplication)",
  "year": 2005,
  "venue": "TCC 2005",
  "authors": "Boneh, Goh, Nissim",
  "title": "Evaluating 2-DNF Formulas on Ciphertexts",
  "paper": "https://doi.org/10.1007/978-3-540-30576-7_18",
  "assumption": "Subgroup decision (pairings)",
  "plaintext": "Small integers, unlimited + and one ×",
  "simd": "No",
  "boot": "n/a",
  "pq": "No",
  "llm": "Can do quadratic forms, enough for one quadratic layer only.",
  "libs": [],
  "followups": "",
  "status": "Foundational",
  "kind": "Scheme",
  "id": 48
 },
 {
  "group": "8. Partially homomorphic encryption",
  "name": "Castagnos–Laguillaumie (class groups)",
  "year": 2015,
  "venue": "CT-RSA 2015",
  "authors": "Castagnos, Laguillaumie",
  "title": "Linearly Homomorphic Encryption from DDH",
  "paper": "https://eprint.iacr.org/2015/047",
  "assumption": "DDH in class groups",
  "plaintext": "Integers mod a prime, additions",
  "simd": "No",
  "boot": "n/a",
  "pq": "No",
  "llm": "Additive HE with flexible prime message space. Used in threshold ECDSA and MPC.",
  "libs": [],
  "followups": "",
  "status": "Niche",
  "kind": "Scheme",
  "id": 49
 },
 {
  "group": "9. Non-HE cryptographic alternatives to CKKS",
  "name": "Additive secret sharing with SHE triples (SPDZ)",
  "year": 2012,
  "venue": "CRYPTO 2012",
  "authors": "Damgård, Pastro, Smart, Zakarias",
  "title": "Multiparty Computation from Somewhat Homomorphic Encryption",
  "paper": "https://eprint.iacr.org/2011/535",
  "assumption": "SHE (BGV) for preprocessing; information-theoretic online",
  "plaintext": "Fixed point over Z_p / Z_2^k",
  "simd": "Vectorized",
  "boot": "n/a",
  "pq": "Depends",
  "llm": "Basis of many 2PC/MPC LLM protocols. Needs interaction and non-colluding parties.",
  "libs": [
   [
    "MP-SPDZ",
    "https://github.com/data61/MP-SPDZ"
   ],
   [
    "CrypTen",
    "https://github.com/facebookresearch/CrypTen"
   ]
  ],
  "followups": "",
  "status": "Widely used",
  "kind": "Primitive",
  "id": 50
 },
 {
  "group": "9. Non-HE cryptographic alternatives to CKKS",
  "name": "Replicated secret sharing (3PC, ABY3)",
  "year": 2018,
  "venue": "CCS 2018",
  "authors": "Mohassel, Rindal",
  "title": "ABY3: A Mixed Protocol Framework for Machine Learning",
  "paper": "https://eprint.iacr.org/2018/403",
  "assumption": "Honest majority (information-theoretic)",
  "plaintext": "Fixed point / bits",
  "simd": "Vectorized",
  "boot": "n/a",
  "pq": "Yes",
  "llm": "Used by PUMA for LLaMA-7B in minutes. Requires three non-colluding servers.",
  "libs": [
   [
    "SecretFlow-SPU",
    "https://github.com/secretflow/spu"
   ],
   [
    "MP-SPDZ",
    "https://github.com/data61/MP-SPDZ"
   ]
  ],
  "followups": "",
  "status": "Widely used",
  "kind": "Primitive",
  "id": 51
 },
 {
  "group": "9. Non-HE cryptographic alternatives to CKKS",
  "name": "Garbled circuits (Yao)",
  "year": 1986,
  "venue": "FOCS 1986",
  "authors": "Yao",
  "title": "How to Generate and Exchange Secrets",
  "paper": "https://doi.org/10.1109/SFCS.1986.25",
  "assumption": "OT + symmetric crypto",
  "plaintext": "Bits / boolean circuits",
  "simd": "No",
  "boot": "n/a",
  "pq": "Yes (with PQ OT)",
  "llm": "Exact comparisons and activations, used for non-linear layers in Gazelle and Delphi. Communication heavy.",
  "libs": [
   [
    "emp-toolkit",
    "https://github.com/emp-toolkit"
   ],
   [
    "EzPC",
    "https://github.com/mpc-msri/EzPC"
   ]
  ],
  "followups": "",
  "status": "Foundational",
  "kind": "Primitive",
  "id": 52
 },
 {
  "group": "9. Non-HE cryptographic alternatives to CKKS",
  "name": "Function secret sharing (FSS)",
  "year": 2015,
  "venue": "EUROCRYPT 2015",
  "authors": "Boyle, Gilboa, Ishai",
  "title": "Function Secret Sharing",
  "paper": "https://doi.org/10.1007/978-3-662-46803-6_12",
  "assumption": "PRG / OWF",
  "plaintext": "Fixed point (DPF/DCF gates)",
  "simd": "Vectorized",
  "boot": "n/a",
  "pq": "Yes",
  "llm": "Basis of SIGMA (GPU 2PC GPT inference). Low online rounds but needs a dealer.",
  "libs": [
   [
    "EzPC",
    "https://github.com/mpc-msri/EzPC"
   ]
  ],
  "followups": "",
  "status": "Active SOTA",
  "kind": "Primitive",
  "id": 53
 },
 {
  "group": "9. Non-HE cryptographic alternatives to CKKS",
  "name": "Homomorphic secret sharing (HSS)",
  "year": 2016,
  "venue": "CRYPTO 2016",
  "authors": "Boyle, Gilboa, Ishai",
  "title": "Breaking the Circuit Size Barrier for Secure Computation Under DDH",
  "paper": "https://eprint.iacr.org/2016/585",
  "assumption": "DDH (later LWE, DCR)",
  "plaintext": "Small integers / branching programs",
  "simd": "No",
  "boot": "n/a",
  "pq": "Depends",
  "llm": "Two servers evaluate locally on shares with no interaction, a middle ground between FHE and MPC.",
  "libs": [],
  "followups": "",
  "status": "Niche",
  "kind": "Primitive",
  "id": 54
 },
 {
  "group": "9. Non-HE cryptographic alternatives to CKKS",
  "name": "Inner-product functional encryption",
  "year": 2015,
  "venue": "PKC 2015",
  "authors": "Abdalla, Bourse, De Caro, Pointcheval",
  "title": "Simple Functional Encryption Schemes for Inner Products",
  "paper": "https://eprint.iacr.org/2015/017",
  "assumption": "DDH / LWE / DCR",
  "plaintext": "Inner products in the clear",
  "simd": "No",
  "boot": "n/a",
  "pq": "LWE variant yes",
  "llm": "Server learns the result of a linear layer, not the input. This leaks more than FHE.",
  "libs": [
   [
    "CiFEr / GoFE",
    "https://github.com/fentec-project/gofe"
   ]
  ],
  "followups": "Quadratic FE for private inference (Ryffel et al., NeurIPS 2019).",
  "status": "Niche",
  "kind": "Primitive",
  "id": 55
 }
]