International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Marc Joye

Publications

Year
Venue
Title
2022
TCHES
SoK: Fully Homomorphic Encryption over the [Discretized] Torus
Marc Joye
First posed as a challenge in 1978 by Rivest et al., fully homomorphic encryption—the ability to evaluate any function over encrypted data—was only solved in 2009 in a breakthrough result by Gentry (Commun. ACM, 2010). After a decade of intense research, practical solutions have emerged and are being pushed for standardization. This paper explains the inner-workings of TFHE, a torus-based fully homomorphic encryption scheme. More exactly, it describes its implementation on a discretized version of the torus. It also explains in detail the technique of the programmable bootstrapping. Numerous examples are provided to illustrate the various concepts and definitions.
2022
TCHES
SoK: Fully Homomorphic Encryption over the [Discretized] Torus
Marc Joye
First posed as a challenge in 1978 by Rivest et al., fully homomorphic encryption—the ability to evaluate any function over encrypted data—was only solved in 2009 in a breakthrough result by Gentry (Commun. ACM, 2010). After a decade of intense research, practical solutions have emerged and are being pushed for standardization.This paper explains the inner-workings of TFHE, a torus-based fully homomorphic encryption scheme. More exactly, it describes its implementation on a discretized version of the torus. It also explains in detail the technique of the programmable bootstrapping. Numerous examples are provided to illustrate the various concepts and definitions.
2021
ASIACRYPT
Balanced Non-Adjacent Forms 📺
Marc Joye
Integers can be decomposed in multiple ways. The choice of a recoding technique is generally dictated by performance considerations. The usual metric for optimizing the decomposition is the Hamming weight. In this work, we consider a different metric and propose new modified forms (i.e., integer representations using signed digits) that satisfy minimality requirements under the new metric. Specifically, we introduce what we call balanced non-adjacent forms and prove that they feature a minimal Euclidean weight. We also present efficient algorithms to produce these new minimal forms. We analyze their asymptotic and exact distributions. We extend the definition to modular integers and show similar optimality results. The balanced non adjacent forms find natural applications in fully homomorphic encryption as they optimally reduce the noise variance in LWE-type ciphertexts.
2017
JOFC
2016
PKC
2015
PKC
2015
ASIACRYPT
2014
EUROCRYPT
2014
PKC
2014
ASIACRYPT
2013
CRYPTO
2013
EUROCRYPT
2010
PKC
2010
CHES
2010
CHES
2007
CHES
2006
CHES
2005
CHES
2003
CHES
2003
CHES
2002
CHES
2002
CRYPTO
2002
PKC
2002
PKC
2002
PKC
2002
PKC
2001
CHES
2001
CHES
2001
CHES
2001
PKC
2000
CHES
2000
CRYPTO
2000
EUROCRYPT
1999
JOFC

Program Committees

CHES 2022
PKC 2021
Eurocrypt 2021
CHES 2020
Eurocrypt 2020
PKC 2019
CHES 2019
CHES 2018
CHES 2017
CHES 2016
CHES 2015
Asiacrypt 2015
Eurocrypt 2015
Eurocrypt 2014
Asiacrypt 2014
CHES 2014
CHES 2013
CHES 2012
CHES 2011
CHES 2010
Eurocrypt 2010
Crypto 2009
Asiacrypt 2009
CHES 2009
PKC 2009
Eurocrypt 2008
CHES 2008
CHES 2007
Asiacrypt 2007
CHES 2006
Eurocrypt 2005
Asiacrypt 2004
PKC 2004
CHES 2004 (Program chair)
CHES 2003
PKC 2003
Asiacrypt 2003