for this workshop
Constructing cryptographic multilinear maps
American Institute of Mathematics, San Jose, California
Dan Boneh, Ted Chinburg, Alice Silverberg, and Akshay Venkatesh
This workshop, sponsored by AIM and the NSF, 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.
The workshop will differ from typical conferences in some regards. Participants will be invited to suggest open problems and questions before the workshop begins, and these will be posted on the workshop website. These include specific problems on which there is hope of making some progress during the workshop, as well as more ambitious problems which may influence the future activity of the field. Lectures at the workshop will be focused on familiarizing the participants with the background material leading up to specific problems, and the schedule will include discussion and parallel working sessions.
The deadline to apply for support to participate in this workshop has passed.
For more information email email@example.com