Research Papers about zkFHE stuff.
- zkFHE and Verifiable FHE
- Towards Verifiable FHE in Practice: Proving Correct Execution of TFHE's Bootstrapping using plonky2. IACR Cryptol. ePrint Arch. 2024.
- Verifiable FHE via Lattice-based SNARKs. CIC 2024
- HELIOPOLIS: Verifiable Computation over Homomorphically Encrypted Data from Interactive Oracle Proofs is Practical. IACR Cryptol. ePrint Arch. 2023.
- vFHE: Verifiable Fully Homomorphic Encryption with Blind Hash. arxiv 2023.
- Verifiable fully homomorphic encryption. arxiv 2023.
- Verifiable computing using computation fingerprints within fhe. arxiv 2021.
- Flexible and Efficient Verifiable Computation on Encrypted Data. PKC 2021.
- FHE (partly)
- CKKS: Homomorphic encryption for arithmetic of approximate numbers. Asiacrypt 2017.
- BGV: (Leveled) fully homomorphic encryption without bootstrapping. ACM Transactions on Computation Theory 2014.
- TFHE: Faster fully homomorphic encryption: Bootstrapping in less than 0.1 seconds. Asiacrypt 2016.
- FHEW: FHEW: Bootstrapping Homomorphic Encryption in less than a second. Eurocrypt 2016.
- Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems. EUROCRYPT 2016.
- Efficient Fully Homomorphic Encryption from (Standard). SIAM Journal on computing, 2014.
- Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. Crypto 2013.
- On-the-Fly Multiparty Computation on the Cloud via Multikey Fully Homomorphic Encryption. STOC 2012.
- BFV: Somewhat Practical Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2012.
- Fully homomorphic encryption with polylog overhead. Eurocrypt 2012.
- Fully homomorphic encryption over the integers with shorter public keys. Crypto 2011.
- Implementing gentry's fully-homomorphic encryption scheme. Eurocrypt 2011.
- Fully homomorphic encryption over the integers. Eurocrypt 2010.
- Faster fully homomorphic encryption. Asiacrypt 2010.
- Fully homomorphic encryption using ideal lattices. STOC 2009.
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. Eurocrypt 1999.
- IZK
- Lightweight Authentication of Web Data via Garble-Then-Prove. USENIX 2024.
- AntMan: Interactive Zero-Knowledge Proofs with Sublinear Communication. ACM CCS 2022.
- zkCNN: Zero Knowledge Proofs for Convolutional Neural Network Predictions and Accuracy. ACM CCS 2021.
- Wolverine: Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits. IEEE S&P 2021.
- QuickSilver: Efficient and Affordable Zero-Knowledge Proofs for Circuits and Polynomials over Any Field. ACM CCS 2021.
- Mystique: Efficient Conversions for Zero-Knowledge Proofs with Applications to Machine Learning. USENIX 2021.
- Constant-Overhead Zero-Knowledge for RAM Programs. ACM CCS 2021.
- MPC-in-Multi-Heads: A Multi-Prover Zero-Knowledge Proof System: (or: How to Jointly Prove Any NP Statements in ZK). ESORICS 2021.