Don't miss our weekly PhD newsletter | Sign up now Don't miss our weekly PhD newsletter | Sign up now

  Generic applications of multilinear maps


   Department of Computer Science

This project is no longer listed on FindAPhD.com and may not be available.

Click here to search FindAPhD.com for PhD studentship opportunities
  Prof James Davenport  Applications accepted all year round  Self-Funded PhD Students Only

About the Project

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.

References

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.

How good is research at University of Bath in Computer Science and Informatics?


Research output data provided by the Research Excellence Framework (REF)

Click here to see the results for all UK universities

Where will I study?