Paper 2018/629

Context Hiding Multi-Key Linearly Homomorphic Authenticators

Lucas Schabhüser, Denis Butin, and Johannes Buchmann


Demanding computations are increasingly outsourced to cloud platforms. For such outsourced computations, the efficient verifiability of results is a crucial requirement. When sensitive data is involved, the verification of a computation should preserve the privacy of the input values: it should be context hiding. Context hiding verifiability is enabled by existing homomorphic authenticator schemes. However, until now, no context hiding homomorphic authenticator scheme supports multiple independent clients, e.g. multiple keys. Multi-key support is necessary for datasets involving input authenticated by different clients, e.g. multiple hospitals in e-health scenarios. In this paper, we propose the first perfectly context hiding, publicly verifiable multi-key homomorphic authenticator scheme supporting linear functions. Our scheme is provably unforgeable in the standard model, and succinct. Verification time depends only linearly on the number of clients, in an amortized sense.

Available format(s)
Public-key cryptography
Publication info
Preprint. MINOR revision.
Delegated ComputationHomomorphic AuthenticatorsContext Hiding
Contact author(s)
lschabhueser @ cdc tu-darmstadt de
2018-06-26: received
Short URL
Creative Commons Attribution


      author = {Lucas Schabhüser and Denis Butin and Johannes Buchmann},
      title = {Context Hiding Multi-Key Linearly Homomorphic Authenticators},
      howpublished = {Cryptology ePrint Archive, Paper 2018/629},
      year = {2018},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.