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

  Fast and Secure Multi-party Computation Techniques


   School of Computing, Engineering & the Built Environment

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

Click here to search FindAPhD.com for PhD studentship opportunities
  Dr Baraq Ghaleb, Dr Z Jaroucheh, Prof B Buchanan  Applications accepted all year round  Self-Funded PhD Students Only

About the Project

Multi-party computation (MPC) protocols enable multiple parties — each holding their own private data — to evaluate a computation without ever revealing any of the secret data held by each party. This has proven useful in multiple use cases. For instance and in the context of cryptocurrencies, the private key, a secret used to sign transactions, can be divided into shares that are independently computed by each participating party. The parties then communicate through a couple of rounds to create a signature without revealing their shares to each other. This ensures that the private key is never materialized in a single place. Another use case of MPC is the possibility of utilizing it for privacy-preserving in a variety of applications, for example, to enable privacy-preserving machine learning in the cloud. Unfortunately, the state-of-the-art MPC protocols suffer from high computational and communication overhead as they rely on complex mathematical operations to achieve a high degree of security including homomorphic encryption and zero-knowledge proofs, a fact that would evidently decrease the performance of MPC protocols and render them impractical under many use cases.

The aim of the project include (but are not limited to):

  • Improving the performance and usability of multi-party computation protocols
  • Designing new multi-party computation protocols and/or use cases

Perspective applicants are encouraged to contact the Supervisor before submitting their applications. Applications should make it clear the project you are applying for and the name of the supervisors.

Academic qualifications

A first degree (at least a 2.1) ideally in Computer Science with a good fundamental knowledge of Cryptography.

English language requirement

IELTS score must be at least 6.5 (with not less than 6.0 in each of the four components). Other, equivalent qualifications will be accepted. Full details of the University’s policy are available online.

Essential attributes:

  • Experience of fundamental of cryptography related research
  • Competent in programming and math related concepts
  • Knowledge of multi-party computation, homomorphic encryption and zero knowledge proof
  • Good written and oral communication skills
  • Strong motivation, with evidence of independent research skills relevant to the project
  • Good time management

For enquiries about the content of the project, please email Dr Baraq Ghaleb - [Email Address Removed] 

For information about how to apply, please visit our website https://www.napier.ac.uk/research-and-innovation/research-degrees/how-to-apply

To apply, please select the link for the PhD Computing FT application form.

Computer Science (8)

References

1. Archer, David W., et al. "From keys to databases—real-world applications of secure multi-party computation." The Computer Journal 61.12 (2018): 1749-1771.
2. R. Gennaro and S. Goldfeder. Fast Multiparty Threshold ECDSA with Fast Trustless Setup. In ACM CCS 2018 (this proceedings).
3. Canetti, R., Makriyannis, N. and Peled, U. (1970) UC non-interactive, proactive, THRESHOLD ECDSA, Cryptology ePrint Archive. Available at: https://eprint.iacr.org/2020/492.
4. https://blog.taurushq.com/first-open-source-implementation-of-mpc-cmp/
5. https://www.fireblocks.com/what-is-mpc/

 About the Project