Finding and evaluating parameters for BGV

DOI10.1007/978-3-031-37679-5_16MaRDI QIDQ6186361zbMATH OpenFDO

Authors Johannes Mono, Chiara Marcolla, Georg Land, Tim Güneysu, Najwa Aaraj

Publication date 2 February 2024

Published in Progress in Cryptology - AFRICACRYPT 2023 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-37679-5_16

zbMATH Keywords

BGV schemeDCRT representationfully homomorphic encryptionparameter generationRLWE security

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Parameter optimization and larger precision for (T)FHE
• Fully homomorphic encryption scheme based on public key compression and batch processing
• Revisiting homomorphic encryption schemes for finite fields
• (Finite) field work: choosing the best encoding of numbers for FHE computation

Cites work

• An improved RNS variant of the BFV homomorphic encryption scheme
• Better key sizes (and attacks) for LWE-based encryption
• Fully homomorphic encryption from ring-LWE and security for key dependent messages
• Fully homomorphic encryption using ideal lattices
• Homomorphic evaluation of the AES circuit
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Lattice-based Cryptography
• Maliciously secure matrix multiplication with applications to private deep learning
• Multiparty Computation from Somewhat Homomorphic Encryption
• On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• On the complexity of the BKW algorithm on LWE
• On the concrete hardness of learning with errors
• Optimisations and tradeoffs for HElib
• Predicting Lattice Reduction
• Revisiting homomorphic encryption schemes for finite fields
• Which ring based somewhat homomorphic encryption scheme is best?

Cited in

(4)

• Rotation key reduction for client-server systems of deep neural network on fully homomorphic encryption
• Faster homomorphic operations and beyond: expediting homomorphic computation via Boolean circuit optimization
• Breaking the power-of-two barrier: noise estimation for BGV in NTT-friendly rings
• Guidance for efficient selection of secure parameters for fully homomorphic encryption

This page was built for publication: Finding and evaluating parameters for BGV

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186361)