An Unconditionally Hiding Auditing Procedure for Multi-Party Computations
In this work an unconditionally hiding auditing procedure for computations on documents stored in distributed fashion is introduced. We propose a computationally hiding solution that uses bilinear maps and produces no additional overhead in the online phase. In addition, we introduce a second variation that provides unconditional (or information theoretic) hidingness. We achieve this by combining bilinear maps with unconditionally hiding commitments leading to only a small overhead in the online phase. The auditing procedures presented here are an important contribution for distributed storage solutions, e.g. cloud of clouds, allowing information-theoretic confidentiality. Using our technique, they can be extended to perform auditable computations on the data stored.