Threshold Linearly Homomorphic Encryption on $\mathbf{Z}/2^k\mathbf{Z}$
| hal.structure.identifier | Lithe and fast algorithmic number theory [LFANT] | |
| dc.contributor.author | CASTAGNOS, Guilhem | |
| hal.structure.identifier | Exact Computing [LIRMM | ECO] | |
| dc.contributor.author | LAGUILLAUMIE, Fabien | |
| hal.structure.identifier | Institute IMDEA Software [Madrid] | |
| dc.contributor.author | TUCKER, Ida | |
| dc.date.accessioned | 2024-04-04T02:36:17Z | |
| dc.date.available | 2024-04-04T02:36:17Z | |
| dc.date.created | 2022 | |
| dc.date.issued | 2022 | |
| dc.date.conference | 2022-12-05 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/190710 | |
| dc.description.abstractEn | A threshold public key encryption protocol is a public key system where the private key is distributed among n different servers. It offers high security since no single server is entrusted to perform the decryption in its entirety. It is the core component of many multiparty computation protocols which involves mutually distrusting parties with common goals. It is even more useful when it is homomorphic, which means that public operations on ciphertexts translate to operations on the underlying plaintexts. In particular, Cramer, Damgård and Nielsen at Eurocrypt 2001 provided a new approach to multiparty computation from linearly homomorphic threshold encryption schemes. On the other hand, there has been recent interest in developing multiparty computations modulo $2^k$ for a certain integer k, that closely match data manipulated by a CPU. Multiparty computation would therefore benefit from an encryption scheme with such a message space that would support a distributed decryption. In this work, we provide the first threshold linearly homomorphic encryption whose message space is $\mathbf{Z}/2^k\mathbf{Z}$ for any $k$. It is inspired by Castagnos and Laguillaumie's encryption scheme from RSA 2015, but works with a class group of discriminant whose factorisation is unknown. Its natural structure à la Elgamal makes it possible to distribute the decryption among servers using linear integer secret sharing, allowing any access structure for the decryption policy. Furthermore its efficiency and its flexibility on the choice of the message space make it a good candidate for applications to multiparty computation. | |
| dc.description.sponsorship | Calcul réparti sécurisé : Cryptographie, Combinatoire, Calcul Formel - ANR-21-CE39-0006 | |
| dc.description.sponsorship | Secure computations - ANR-22-PECY-0003 | |
| dc.language.iso | en | |
| dc.publisher | Springer Nature Switzerland | |
| dc.publisher.location | Cham | |
| dc.source.title | Advances in Cryptology – ASIACRYPT 2022 | |
| dc.subject.en | Class groups of quadratic fields | |
| dc.subject.en | Linearly homomorphic encryption | |
| dc.subject.en | Threshold cryptography | |
| dc.title.en | Threshold Linearly Homomorphic Encryption on $\mathbf{Z}/2^k\mathbf{Z}$ | |
| dc.type | Communication dans un congrès | |
| dc.identifier.doi | 10.1007/978-3-031-22966-4_4 | |
| dc.subject.hal | Informatique [cs]/Cryptographie et sécurité [cs.CR] | |
| dc.description.sponsorshipEurope | Cryptography for Privacy and Integrity of Computation on Untrusted Machines | |
| bordeaux.page | 99-129 | |
| bordeaux.volume | 13792 | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.conference.title | ASIACRYPT 2022 - International Conference on the Theory and Application of Cryptology and Information Security | |
| bordeaux.country | TW | |
| bordeaux.title.proceeding | Advances in Cryptology – ASIACRYPT 2022 | |
| bordeaux.conference.city | Taipei | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-03936038 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.conference.end | 2022-12-09 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-03936038v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.btitle=Advances%20in%20Cryptology%20%E2%80%93%20ASIACRYPT%202022&rft.date=2022&rft.volume=13792&rft.spage=99-129&rft.epage=99-129&rft.au=CASTAGNOS,%20Guilhem&LAGUILLAUMIE,%20Fabien&TUCKER,%20Ida&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||