Postgrad LIVE! Study Fairs

Birmingham | Edinburgh | Liverpool | Sheffield | Southampton | Bristol

Wellcome Trust Featured PhD Programmes
University of St Andrews Featured PhD Programmes
University of Sussex Featured PhD Programmes
University of Hong Kong Featured PhD Programmes
University of Manchester Featured PhD Programmes

Generic applications of multilinear maps

This project is no longer listed in the FindAPhD
database and may not be available.

Click here to search the FindAPhD database
for PhD studentship opportunities
  • Full or part time
    Prof J. Davenport
  • Application Deadline
    Applications accepted all year round
  • Self-Funded PhD Students Only
    Self-Funded PhD Students Only

Project Description

Cryptographic bilinear maps -- i.e. bilinear functions f such that x=f(a,b) can easily be computed, but a cannot readily be computed from x and b, nor b from x and a -- have had a great deal of use in advanced cryptography. Extending these to multilinear maps has long been a wish of cryptographers. New constructions have recently been produced, shot down, strengthened, shot down again, and so on, in a struggle that shows no sign of ending. Hence one important question is what the generic characteristics of these multilinear map candidates are, and what protocols can be designed independent of the specific multilinear map, allowing modular replacement, as has been done in other areas of security

Funding Notes

We welcome all year round applications from self-funded candidates and candidates who can source their own funding.


See El Kaafarani,A., Chen,L., Ghadafi,E. & Davenport,J., Attribute-Based Signatures with User-Controlled Linkability. Cryptology and Network Security 2014, Springer Lecture Notes in Computer Science 8813, pp. 256-269.

Related Subjects

FindAPhD. Copyright 2005-2018
All rights reserved.