Transciphering, Using FiLIP and TFHE for an Efficient Delegation of Computation

Hoffmann, Clément; Méaux, Pierrick; Ricosset, Thomas

doi:10.1007/978-3-030-65277-7_3

Cited by 18 publications

(4 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…But it is worth to notice that several other applications that use the GSW scheme could take advantage of the faster homomorphic operations of NGS. For example, by simply replacing GSW by NGS, one could speed up the transciphering for TFHE [20], or the homomorphic evaluation of maximum and minimum functions from [11], or the tree-based private information retrieval from [29].…”

Section: Our Techniques and Resultsmentioning

confidence: 99%

FINAL: Faster FHE Instantiated with NTRU and LWE

Bonte

Iliashenko

Park

et al. 2022

Advances in Cryptology – ASIACRYPT 2022

View full text Add to dashboard Cite

The NTRU problem is a promising candidate to build efficient Fully Homomorphic Encryption (FHE). However, all the existing proposals (e.g. LTV, YASHE) need so-called 'overstretched' parameters of NTRU to enable homomorphic operations. It was shown by Albrecht et al. (CRYPTO 2016) that these parameters are vulnerable against subfield lattice attacks. Based on a recent, more detailed analysis of the overstretched NTRU assumption by Ducas and van Woerden (ASIACRYPT 2021), we construct two FHE schemes whose NTRU parameters lie outside the overstretched range. The first scheme is based solely on NTRU and demonstrates competitive performance against the state-of-the-art FHE schemes including TFHE. Our second scheme, which is based on both the NTRU and LWE assumptions, outperforms TFHE with a 28% faster bootstrapping and 45% smaller bootstrapping and key-switching keys.

show abstract

Section: Our Techniques and Resultsmentioning

confidence: 99%

FINAL: Faster FHE Instantiated with NTRU and LWE

Bonte

Iliashenko

Park

et al. 2022

Advances in Cryptology – ASIACRYPT 2022

View full text Add to dashboard Cite

show abstract

“…These results have more implications for cryptographic applications: for example in the (improved) filter permutator context [2,32], for hybrid homomorphic encryption, there are efficient ways to evaluate symmetric functions (as illustrated in [33]), and doing one addition is cheap, therefore it is interesting to consider the best function in the S 0 -class of a filter function. In that case, for all contexts where adding one function is cheap, the hunt for optimized functions could be split into finding a cheap function to evaluate, and then determining the one with best cryptographic parameters in its T -class.…”

Section: Beyond Parameters In S 0 -Classesmentioning

confidence: 99%

S0-equivalent classes, a new direction to find better weightwise perfectly balanced functions, and more

Gini,

Méaux

2023

Preprint

Self Cite

View full text Add to dashboard Cite

We investigate the concept of S0 equivalent class, n-variable Boolean functions up to the addition of a symmetric function null in 0n and 1n, as a tool to study weightwise perfectly balanced functions. On the one hand we show that weightwise properties, such as being weightwise perfectly balanced, the weightwise nonlinearity and weightwise algebraic immunity, are invariant of these classes. On the other hand, we analyse the variation of global parameters inside the same class, showing for example that there is always a function with high degree, algebraic immunity, or nonlinearity in the S0 equivalent class of a function. Finally, we discuss how these results extend to other equivalence relations and their applications in cryptography MSC Classification: 94A60 , 94D10

show abstract

“…private key ciphers such as LowMC [ARS + 15], Kreyvium [CCF + 16], FLIP [MJSC16], Rasta [DEG + 18] and FiLIP [MCJS19] have been designed to be homomorphic friendly, that is, with components that can be efficiently evaluated homomorphically. Moreover, the homomorphic evaluation of symmetric functions can be made very efficient as demonstrated in [HMR20,CDPP22,MPP23]. The efficient evaluation of multiplexers for homomorphic schemes like FHEW [DM15] and TFHE [CGGI16] allows to evaluate the Hamming weight of an input as shown in [HMR20] and therefore enable to efficiently evaluate weightwise low degree functions.…”

mentioning

confidence: 99%

“…Moreover, the homomorphic evaluation of symmetric functions can be made very efficient as demonstrated in [HMR20,CDPP22,MPP23]. The efficient evaluation of multiplexers for homomorphic schemes like FHEW [DM15] and TFHE [CGGI16] allows to evaluate the Hamming weight of an input as shown in [HMR20] and therefore enable to efficiently evaluate weightwise low degree functions. The homomorphic evaluation of Boolean functions is a growing research topic, leading to better and better performances as shown recently by [BCBS23, BSS + 23, TCBS23, BOS23,BPR23].…”

mentioning

confidence: 99%