Practical Multilinear Maps over the Integers
By Jean-Sébastien Coron, Tancrède Lepoint, Mehdi Tibouchi. 2013
435 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Brent Waters
- Shai Halevi
- Dan Boneh
- Vinod Vaikuntanathan
- Craig Gentry
- Amit Sahai
- Chris Peikert
- Mariana Raykova
In Computational Theory and Mathematics
- Brent Waters
- Shai Halevi
- Amit Sahai
- Craig Gentry
- Dan Boneh
- Vinod Vaikuntanathan
- Chris Peikert
- Allison Bishop
In Information Systems
- Brent Waters
- Vinod Vaikuntanathan
- Amit Sahai
- Shai Halevi
- Craig Gentry
- Matthew D. Green
- Dan Boneh
- Ran Canetti
Citations in the corpus
- Theory of Cryptography (2014, methodology): “While we currently do not know how how to use the construction of [14] to instantiate our scheme, we can get a candidate construction with public encoding based on the construction of [12], by publishing encodings of all powers of 2 as part of the public parameters.”
- GGHLite: More Efficient Multilinear Maps from Ideal Lattices (2014, background): “Based on their work, Coron, Lepoint and Tibouchi [7] recently described an alternative construction of graded encoding scheme.”
- Homomorphic Encryption (2017, background): “We currently have three candidate constructions for multilinear maps [34, 26, 39]”
- Attribute-based encryption for circuits (2013, background): “[2013] gave a construction of attribute-based encryption for general circuits under a DBDHlike assumption in multilinear groups; the construction extends to so-called graded encodings for which we have candidates under nonstandard assumptions in ideal lattices [Garg et al. 2012; Coron et al. 2013].”
- Fairness in an Unfair World: Fair Multiparty Computation from Public Bulletin Boards (2017, background): “Since present constructions [26, 27, 36, 38] of multilinear maps are quite inefficient, we view our first construction as a feasibility result.”
- Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits (2013, methodology): “We can also instantiate Multilinear Jigsaw Puzzles by eliminating some parts from the recent work of [21] over the integers.”