The code on this repository is the prototype implementation of the results presented at the 14th International Conference on Applied Cryptography and Network Security http://acns2016.sccs.surrey.ac.uk

regarding the paper entitled : "Verifiable Multi-Party Computation with Perfectly Private Audit Trail"

(the complete reference of the paper will be posted soon)

The modules presented here contain

• the core arithmetic needed to perform natural operations and pairings on BN- elliptic curves, extension fields, etc.
• instanciations of the CCE primitive
• the NIZKPoK needed to compute the PPAT for the test applications
• the test applications presented in the paper

• the file script.py instantiate the CCE primitive: the public parameters, public keys and secret keys
• the test modules for the PPAT is test_ppats.py of the ppat package
• to test the applications, load the testApplications.py module of the applications package and then try the functions:
  • testShortestPath(nbClients) => we recommend < 10 clients
  • testAuctions(nbClients) => we recommend < 1000 clients
  • testLinearSystem(nbClients) => we recommend < 4096 clients and square number

where nbClients is an integer parameter...

Any new multi-party protocol can be implemented -- for example, but not only -- by inheriting the abstract classes of the ppatProtocol.py of the protocols package. Inherit the classes:

• Circuit to design the circuit evaluation (a circuit is composed of the Gate objects)
• Worker
• Client

to compose your multi-party application. See for example the prototype applications presented above.