Mostrar el registro sencillo del ítem
Linearly Homomorphic Encryption from DDH
| hal.structure.identifier | Lithe and fast algorithmic number theory [LFANT] | |
| hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
| dc.contributor.author | CASTAGNOS, Guilhem | |
| hal.structure.identifier | Arithmetic and Computing [ARIC] | |
| dc.contributor.author | LAGUILLAUMIE, Fabien | |
| dc.date.accessioned | 2024-04-04T03:17:20Z | |
| dc.date.available | 2024-04-04T03:17:20Z | |
| dc.date.conference | 2015-04-20 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/194298 | |
| dc.description.abstractEn | We design a linearly homomorphic encryption scheme whose security relies on the hardness of the decisional Diffie-Hellman problem. Our approach requires some special features of the underlying group. In particular, its order is unknown and it contains a subgroup in which the discrete logarithm problem is tractable. Therefore, our instantiation holds in the class group of a non maximal order of an imaginary quadratic field. Its algebraic structure makes it possible to obtain such a linearly homomorphic scheme whose message space is the whole set of integers modulo a prime p and which supports an unbounded number of additions modulo p from the ciphertexts. A notable difference with previous works is that, for the first time, the security does not depend on the hardness of the factorization of integers. As a consequence, under some conditions, the prime p can be scaled to fit the application needs. | |
| dc.description.sponsorship | Initiative d'excellence de l'Université de Bordeaux - ANR-10-IDEX-0003 | |
| dc.language.iso | en | |
| dc.source.title | Lecture Notes in Computer Science | |
| dc.subject.en | Linearly Homomorphic Encryption | |
| dc.subject.en | Orders of Quadratic Fields | |
| dc.subject.en | Diffie-Hellman Assumptions | |
| dc.title.en | Linearly Homomorphic Encryption from DDH | |
| dc.type | Communication dans un congrès | |
| dc.identifier.doi | 10.1007/978-3-319-16715-2_26 | |
| dc.subject.hal | Informatique [cs]/Cryptographie et sécurité [cs.CR] | |
| dc.description.sponsorshipEurope | Lattices: algorithms and cryptography | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.issue | 9048 | |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.conference.title | The Cryptographer's Track at the RSA Conference 2015 | |
| bordeaux.country | US | |
| bordeaux.title.proceeding | Lecture Notes in Computer Science | |
| bordeaux.conference.city | San Francisco | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-01213284 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.conference.end | 2015-04-24 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-01213284v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.btitle=Lecture%20Notes%20in%20Computer%20Science&rft.issue=9048&rft.au=CASTAGNOS,%20Guilhem&LAGUILLAUMIE,%20Fabien&rft.genre=unknown |
Archivos en el ítem
| Archivos | Tamaño | Formato | Ver |
|---|---|---|---|
|
No hay archivos asociados a este ítem. |
|||