Mehdi Tibouchi
Artificial Intelligence · 2011–2015
A researcher in the Science corpus: 6 papers; trusts 15 researchers and is trusted by 32 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 52 citations into it; #4,745 of 35,345 by trust here, #7,062 by citations
- Computational Theory and Mathematics — 23 citations into it; #1,202 of 12,182 by trust here, #1,047 by citations
- Privacy & Security — 21 citations into it; #478 of 709 by trust here, #642 by citations
- Computer Vision and Pattern Recognition — 14 citations into it
- Information Systems — 13 citations into it; #1,739 of 8,771 by trust here, #2,471 by citations
- Mathematical Optimization — 6 citations into it
Whom Mehdi Tibouchi trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Craig Gentry
- Zvika Brakerski
- Vinod Vaikuntanathan
- Shai Halevi
- Nigel P. Smart
- Phong Q. Nguyen
- Marten van Dijk
- Jean-Sébastien Coron
- Damien Stehlé
- Oded Regev
Who trusts Mehdi Tibouchi overall
- Erdinç Öztürk
- Yarkin Doröz
- Ciara Moore
- Xiaolin Cao
- Abbas Acar
- Ilaria Chillotti
- Máire O’neill
- Berk Sunar
- Erkay Savas
- Shai Halevi
Papers from Mehdi Tibouchi's perspective
Ordered by how strongly the researchers Mehdi Tibouchi trusts endorse each paper. Same corpus, a different order for every researcher.
- A fully homomorphic encryption scheme
- Predicting Lattice Reduction (International Conference on the Theory and Application of Cryptographic Techniques)
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Fully homomorphic encryption using ideal lattices
- Implementing Gentry's Fully-Homomorphic Encryption Scheme
- Faster Fully Homomorphic Encryption (International Conference on the Theory and Application of Cryptology and Information Security)
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes (International Conference on Theory and Practice of Public Key Cryptography)
- New lattice based cryptographic constructions
- On lattices, learning with errors, random linear codes, and cryptography
Their papers
- Practical Multilinear Maps over the Integers (2013) — 435 citations
- Scale-Invariant Fully Homomorphic Encryption over the Integers (2014) — 199 citations
- Fully Homomorphic Encryption over the Integers with Shorter Public Keys (2011) — 487 citations
- Batch Fully Homomorphic Encryption over the Integers (2013) — 376 citations
- Cryptanalysis of a (Somewhat) Additively Homomorphic Encryption Scheme Used in PIR (2015) — 14 citations
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers (2012) — 299 citations