Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Alice Pellet-Mary"'
Publikováno v:
CRYPTO 2020
CRYPTO 2020, Aug 2020, Santa Barbara, United States. ⟨10.1007/978-3-030-56880-1_9⟩
Advances in Cryptology – CRYPTO 2020 ISBN: 9783030568795
CRYPTO (2)
Advances in Cryptology – CRYPTO 2020-40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – CRYPTO 2020
CRYPTO 2020, Aug 2020, Santa Barbara, United States. ⟨10.1007/978-3-030-56880-1_9⟩
Advances in Cryptology – CRYPTO 2020 ISBN: 9783030568795
CRYPTO (2)
Advances in Cryptology – CRYPTO 2020-40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – CRYPTO 2020
International audience; Fixing a number field, the space of all ideal lattices, up to isometry, is naturally an Abelian group, called the Arakelov class group. This fact, well known to number theorists, has so far not been explicitly used in the lite
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bab5c58d032b80a953aa3b43d986217d
https://ir.cwi.nl/pub/30072
https://ir.cwi.nl/pub/30072
Publikováno v:
Advances in Cryptology – ASIACRYPT 2022 ISBN: 9783031229688
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b6e9bf4c35ee81c2a10be7ce211321ac
https://doi.org/10.1007/978-3-031-22969-5_24
https://doi.org/10.1007/978-3-031-22969-5_24
Autor:
Alice Pellet-Mary, Damien Stehlé
Publikováno v:
Asiacrypt 2021-27th Annual International Conference on the Theory and Applications of Cryptology and Information Security
Asiacrypt 2021-27th Annual International Conference on the Theory and Applications of Cryptology and Information Security, Dec 2021, Singapore, Singapore. ⟨10.1007/978-3-030-92062-3_1⟩
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – ASIACRYPT 2021
Advances in Cryptology – ASIACRYPT 2021-27th International Conference on the Theory and Application of Cryptology and Information Security, Virtual
Lecture Notes in Computer Science ISBN: 9783030920616
Asiacrypt 2021-27th Annual International Conference on the Theory and Applications of Cryptology and Information Security, Dec 2021, Singapore, Singapore. ⟨10.1007/978-3-030-92062-3_1⟩
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – ASIACRYPT 2021
Advances in Cryptology – ASIACRYPT 2021-27th International Conference on the Theory and Application of Cryptology and Information Security, Virtual
Lecture Notes in Computer Science ISBN: 9783030920616
International audience; The 25 year-old NTRU problem is an important computational assumption in public-key cryptography. However, from a reduction perspective, its relative hardness compared to other problems on Euclidean lattices is not well-unders
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b591ddd2d53d84c0f3bf0d3253f041d
https://hal.science/hal-03348022
https://hal.science/hal-03348022
Autor:
Alice Pellet-Mary, Shweta Agrawal
Publikováno v:
Advances in Cryptology – EUROCRYPT 2020 ISBN: 9783030457204
EUROCRYPT (1)
EUROCRYPT (1)
Candidates of Indistinguishability Obfuscation (\(\mathsf {iO}\)) can be categorized as “direct” or “bootstrapping based”. Direct constructions rely on high degree multilinear maps [28, 29] and provide heuristic guarantees, while bootstrappin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f875e77122a6a8678027d2b915b4aa4e
https://doi.org/10.1007/978-3-030-45721-1_5
https://doi.org/10.1007/978-3-030-45721-1_5
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030346201
ASIACRYPT (2)
Advances in Cryptology – ASIACRYPT 2019-25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8–12, 2019, Proceedings, Part II
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – ASIACRYPT 2019
ASIACRYPT
ASIACRYPT, 2019, Kobe, Japan. pp.59-90, ⟨10.1007/978-3-030-34621-8_3⟩
ASIACRYPT (2)
Advances in Cryptology – ASIACRYPT 2019-25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8–12, 2019, Proceedings, Part II
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – ASIACRYPT 2019
ASIACRYPT
ASIACRYPT, 2019, Kobe, Japan. pp.59-90, ⟨10.1007/978-3-030-34621-8_3⟩
The LLL algorithm takes as input a basis of a Euclidean lattice, and, within a polynomial number of operations, it outputs another basis of the same lattice but consisting of rather short vectors. We provide a generalization to R-modules contained in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e26cdc3a14b289d161d1bc073e86b73
https://doi.org/10.1007/978-3-030-34621-8_3
https://doi.org/10.1007/978-3-030-34621-8_3
Publikováno v:
Advances in Cryptology – EUROCRYPT 2019-38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19–23, 2019, Proceedings, Part II
Eurocrypt 2019-38th Annual International Conference on the Theory and Applications of Cryptographic Techniques
Eurocrypt 2019-38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, May 2019, Darmstadt, Germany. pp.685-716, ⟨10.1007/978-3-030-17656-3_24⟩
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2019
Advances in Cryptology – EUROCRYPT 2019 ISBN: 9783030176556
EUROCRYPT (2)
Eurocrypt 2019-38th Annual International Conference on the Theory and Applications of Cryptographic Techniques
Eurocrypt 2019-38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, May 2019, Darmstadt, Germany. pp.685-716, ⟨10.1007/978-3-030-17656-3_24⟩
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2019
Advances in Cryptology – EUROCRYPT 2019 ISBN: 9783030176556
EUROCRYPT (2)
We describe an algorithm to solve the approximate Shortest Vector Problem for lattices corresponding to ideals of the ring of integers of an arbitrary number field K. This algorithm has a pre-processing phase, whose run-time is exponential in \(\log
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e597ec26a39cdfe07ab2110f046a2c42
Autor:
Léo Ducas, Alice Pellet-Mary
Publikováno v:
Asiacrypt 2018
Asiacrypt 2018, Dec 2018, Brisbane, Australia. pp.465-493
Lecture Notes in Computer Science ISBN: 9783030033255
ASIACRYPT (1)
Asiacrypt 2018, Dec 2018, Brisbane, Australia. pp.465-493
Lecture Notes in Computer Science ISBN: 9783030033255
ASIACRYPT (1)
At EUROCRYPT 2013, Garg, Gentry and Halevi proposed a candidate construction (later referred as GGH13) of cryptographic multilinear map (MMap). Despite weaknesses uncovered by Hu and Jia (EUROCRYPT 2016), this candidate is still used for designing ob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b6ad7a516b04d487820dffb31122629e
https://hal.archives-ouvertes.fr/hal-01895645
https://hal.archives-ouvertes.fr/hal-01895645