Verifiable Computation
While storage integrity requirements address the integrity of outsourced data, computation integrity requirements address the correctness of outsourced computation. The aim of TREDISEC is to deal with this problem. The main requirements are summarized below.
Verifiable Matching of Biometric Templates
This primitive could be offered as a service to perform biometric authentication on trusted servers while preserving the privacy of the data. It could also be simply adapted to validate ID doc against trusted data sources
Verifiable Matrix Multiplication
It is a cryptographic scheme that enables a cloud provider to compute the multiplication of a given vector with the matrix and to prove to a user that the output is actually correct. The goal of the solution is to render the verification of the proof as efficient as possible.
Verifiable Polynomial Evaluation
Cryptographic scheme that enables a cloud provider to evaluate a polynomial over an input received from the user and to prove to a user that the output is actually correct. We consider a scenario whereby a user wishes to outsource a high-degree polynomial P to the cloud server. Further, a queried requests the evaluation of this polynomial over some inputs x. In addition to the output and the server also provides a proof p on the correctness of the output. Finally, the verifier receiving the output and the proof verifies p and concludes whether y equals P(x).