Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Thomas Plantard"'
Publikováno v:
Journal of Internet Services and Information Security, Vol 6, Iss 4, Pp 1-34 (2016)
In an e-Health scenario, we study how the practitioners are authorized when they are requesting access to medical documents containing sensitive information. Consider the following scenario. A clinician wants to access and retrieve a patient’s Elec
Externí odkaz:
https://doaj.org/article/973fbf330d714b018829bca0e1900dad
Publikováno v:
Information, Vol 11, Iss 3, p 133 (2020)
At PKC 2008, Plantard et al. published a theoretical framework for a lattice-based signature scheme, namely Plantard−Susilo−Win (PSW). Recently, after ten years, a new signature scheme dubbed the Diagonal Reduction Signature (DRS) scheme was pres
Externí odkaz:
https://doaj.org/article/66973ddeecd74eaf8ff8485a9a752a3c
Publikováno v:
Journal of Cryptographic Engineering
Journal of Cryptographic Engineering, 2023, Journal of Cryptographic Engineering (2023), ⟨10.1007/s13389-023-00309-1⟩
Journal of Cryptographic Engineering, 2023, Journal of Cryptographic Engineering (2023), ⟨10.1007/s13389-023-00309-1⟩
International audience; A recent work of Sipasseuth, Plantard and Susilo proposed to accelerate lattice-based signature verifications and compress public key storage at the cost of a precomputation on a public key. This first approach, which focused
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07536b7f75aeba67413b69264fd759e7
https://doi.org/10.1007/s13389-023-00309-1
https://doi.org/10.1007/s13389-023-00309-1
Publikováno v:
IEEE Transactions on Emerging Topics in Computing
IEEE Transactions on Emerging Topics in Computing, 2022, pp.1-12. ⟨10.1109/TETC.2022.3187072⟩
IEEE Transactions on Emerging Topics in Computing, 2022, pp.1-12. ⟨10.1109/TETC.2022.3187072⟩
International audience; Residue Number Systems (RNS) are proven to be effective in speeding up computations involving additions and products. For these representations, there exists efficient modular reduction algorithms that can be used in the conte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::19bb5af52829782d0d8527728f2f17c2
https://doi.org/10.1109/arith54963.2022.00027
https://doi.org/10.1109/arith54963.2022.00027
Publikováno v:
Journal of Mathematical Cryptology, Vol 14, Iss 1, Pp 359-392 (2020)
One family of candidates to build a post-quantum cryptosystem upon relies on euclidean lattices. In order to make such cryptosystems more efficient, one can consider special lattices with an additional algebraic structure such as ideal lattices. Idea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::af7f436507e446d7066ad342da647b7d
https://doi.org/10.1515/jmc-2019-0028
https://doi.org/10.1515/jmc-2019-0028
Publikováno v:
Advances in Cryptology – EUROCRYPT 2022 ISBN: 9783031070815
Lecture Notes in Computer Science-Eurocrypt 2022
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2022
Lecture Notes in Computer Science-Eurocrypt 2022
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2022
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5f2c7577998ad211e00fa9b65f845180
https://doi.org/10.1007/978-3-031-07082-2_21
https://doi.org/10.1007/978-3-031-07082-2_21
Autor:
Thomas Plantard, Shinsaku Kiyomoto, Willy Susilo, Arnaud Sipasseuth, Kazuhide Fukushima, Jean-Claude Bajard
Publikováno v:
ARITH 2021-IEEE 28th Symposium on Computer Arithmetic
ARITH 2021-IEEE 28th Symposium on Computer Arithmetic, Jun 2021, Virtual, France. pp.86-93, ⟨10.1109/ARITH51176.2021.00027⟩
ARITH
ARITH 2021-IEEE 28th Symposium on Computer Arithmetic, Jun 2021, Virtual, France. pp.86-93, ⟨10.1109/ARITH51176.2021.00027⟩
ARITH
International audience; Residue number systems provide efficient techniques for speeding up calculations and/or protecting against side channel attacks when used in the context of cryptographic engineering. One of the interests of such systems is the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::da22c24d1434614abb19fdbb0b319838
https://hal.sorbonne-universite.fr/hal-03457951/document
https://hal.sorbonne-universite.fr/hal-03457951/document
Publikováno v:
Journal of Mathematical Cryptology, Vol 13, Iss 3-4, Pp 169-196 (2019)
We present a technique to enhance the security of the Goldreich, Goldwasser and Halevi (GGH) scheme. The security of GGH has practically been broken by lattice reduction techniques. Those attacks are successful due to the structure of the basis used
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ad067a3273c7f6a59bfd325fd5cffc0
https://doaj.org/article/2939590dc26e40d48e9d7fdd8e413e1d
https://doaj.org/article/2939590dc26e40d48e9d7fdd8e413e1d
Publikováno v:
Information
Volume 11
Issue 3
Information, Vol 11, Iss 3, p 133 (2020)
Volume 11
Issue 3
Information, Vol 11, Iss 3, p 133 (2020)
At PKC 2008, Plantard et al. published a theoretical framework for a lattice-based signature scheme, namely Plantard&ndash
Susilo&ndash
Win (PSW). Recently, after ten years, a new signature scheme dubbed the Diagonal Reduction Signature (DR
Susilo&ndash
Win (PSW). Recently, after ten years, a new signature scheme dubbed the Diagonal Reduction Signature (DR
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1a3bdd3e5694ec6e935e81f53eaa893e
Publikováno v:
Journal of Cryptographic Engineering
Journal of Cryptographic Engineering, Springer, 2019, 9 (2), pp.115-136. ⟨10.1007/s13389-018-0196-7⟩
Journal of Cryptographic Engineering, Springer, 2019, 9 (2), pp.115-136. ⟨10.1007/s13389-018-0196-7⟩
International audience; Digital Signature Algorithm (DSA) (resp. ECDSA) involves modular exponentiation (resp. scalar multiplication) of a public and known base by a random one-time exponent. In order to speed-up this operation, well-known methods ta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ac6d47a313037c3e639d379dcd769aca
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01926767
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01926767