Constructing cryptographic multilinear maps
October 23 to October 27, 2017
at the
American Institute of Mathematics,
San Jose, California
organized by
Dan Boneh,
Ted Chinburg,
Alice Silverberg,
and Akshay Venkatesh
Original Announcement
This workshop will be devoted to the problem of constructing secure and efficient cryptographic multilinear maps.
Cryptographic multilinear maps are a powerful tool in cryptography. They solve many long-standing open problems in cryptography and computer security that currently cannot be solved any other way. Unfortunately, all known constructions are extremely inefficient and have been shown to be insecure for some applications.
The aim of this workshop is to make full use of advanced mathematical ideas, including those coming from algebraic geometry, number theory, or topology, in order to make progress on this problem and show the way towards satisfactory solutions.
The plan is for the working groups to have a mixture of expertise from mathematics and computer science, and also from the cryptographic and cryptanalytic sides, to make sure that proposed solutions survive the tests of being both efficient and secure.
Material from the workshop
A list of participants.
The workshop schedule.
A report on the workshop activities.
A list of open problems.
Talk slides
Indistinguishability Obfuscation from
Multilinear Maps by Lin
Cryptanalysis of GGH Multilinear Maps by Cheon and Lee
Approximate Number Theoretic Problems by Cheon and Lee
Papers arising from the workshop:
