Paper 2016/546

An Unconditionally Hiding Auditing Procedure for Multi-Party Computations

Lucas Schabhüser, Denise Demirel, and Johannes Buchmann


In this work an unconditionally hiding auditing procedure for computations on documents stored in distributed fashion is introduced. There is only one multi-party computation (MPC) scheme providing auditability which computationally protects the inputs of the computations. Building on this, we propose a computationally hiding solution that uses bilinear maps and therefore produces no additional overhead in the online phase. In addition, we introduce a second variation that is the first auditable MPC scheme providing 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. We prove our solutions secure and give arguments for practicability and efficiency. The auditing procedures presented here are an important contribution since distributed storage solutions, e.g. cloud of clouds, allow for information-theoretic confidentiality. Using our technique, they can be extended to perform auditable computations on the data stored.

Available format(s)
Publication info
Preprint. MINOR revision.
unconditional hidingnessauditable multi-party computationscloud computingdistributed storage
Contact author(s)
lschabhueser @ cdc informatik tu-darmstadt de
2016-06-02: received
Short URL
Creative Commons Attribution


      author = {Lucas Schabhüser and Denise Demirel and Johannes Buchmann},
      title = {An Unconditionally Hiding Auditing Procedure for Multi-Party Computations},
      howpublished = {Cryptology ePrint Archive, Paper 2016/546},
      year = {2016},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.