Encryption Switching Protocols Revisited: Switching Modulo $p$
| hal.structure.identifier | Lithe and fast algorithmic number theory [LFANT] | |
| dc.contributor.author | CASTAGNOS, Guilhem | |
| hal.structure.identifier | Exact Computing [ECO] | |
| dc.contributor.author | IMBERT, Laurent | |
| hal.structure.identifier | Arithmetic and Computing [ARIC] | |
| dc.contributor.author | LAGUILLAUMIE, Fabien | |
| dc.date.accessioned | 2024-04-04T03:08:53Z | |
| dc.date.available | 2024-04-04T03:08:53Z | |
| dc.date.issued | 2017 | |
| dc.date.conference | 2017-08-20 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/193566 | |
| dc.description.abstractEn | At CRYPTO 2016, Couteau, Peters and Pointcheval introduced a new primitive called encryption switching protocols, allowing to switch ciphertexts between two encryption schemes. If such an ESP is built with two schemes that are respectively additively and multiplica-tively homomorphic, it naturally gives rise to a secure 2-party computation protocol. It is thus perfectly suited for evaluating functions, such as multivariate polynomials, given as arithmetic circuits. Couteau et al. built an ESP to switch between Elgamal and Paillier encryptions which do not naturally fit well together. Consequently, they had to design a clever variant of Elgamal over Z/nZ with a costly shared decryption. In this paper, we first present a conceptually simple generic construction for encryption switching protocols. We then give an efficient instantiation of our generic approach that uses two well-suited protocols, namely a variant of Elgamal in Z/pZ and the Castagnos-Laguillaumie encryption which is additively homomorphic over Z/pZ. Among other advantages, this allows to perform all computations modulo a prime p instead of an RSA modulus. Overall, our solution leads to significant reductions in the number of rounds as well as the number of bits exchanged by the parties during the interactive protocols. We also show how to extend its security to the malicious setting. | |
| dc.description.sponsorship | AppLicAtions de la MalléaBIlité en Cryptographie - ANR-16-CE39-0006 | |
| dc.language.iso | en | |
| dc.source.title | 37th International Cryptology Conference | |
| dc.subject.en | Malicious adversary | |
| dc.subject.en | Homomorphic encryption | |
| dc.subject.en | Encryption switching protocols | |
| dc.subject.en | Two-party computation | |
| dc.title.en | Encryption Switching Protocols Revisited: Switching Modulo $p$ | |
| dc.type | Communication dans un congrès | |
| dc.identifier.doi | 10.1007/978-3-319-63688-7_9 | |
| dc.subject.hal | Informatique [cs]/Cryptographie et sécurité [cs.CR] | |
| bordeaux.page | 255-287 | |
| bordeaux.volume | LNCS | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.issue | 10401 | |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.conference.title | CRYPTO 2017 | |
| bordeaux.country | US | |
| bordeaux.title.proceeding | 37th International Cryptology Conference | |
| bordeaux.conference.city | Santa Barbara | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | lirmm-01587451 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.conference.end | 2017-08-24 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//lirmm-01587451v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.btitle=37th%20International%20Cryptology%20Conference&rft.date=2017&rft.volume=LNCS&rft.issue=10401&rft.spage=255-287&rft.epage=255-287&rft.au=CASTAGNOS,%20Guilhem&IMBERT,%20Laurent&LAGUILLAUMIE,%20Fabien&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||