Multi-Key Fully-Homomorphic Aggregate MAC for Arithmetic Circuits

Suvasree Biswas; Arkady Yerukhimovich

Paper 2024/1499

Multi-Key Fully-Homomorphic Aggregate MAC for Arithmetic Circuits

Suvasree Biswas, George Washington University

Arkady Yerukhimovich, George Washington University

Abstract

Homomorphic message authenticators allow a user to perform computation on previously authenticated data producing a tag $σ$ that can be used to verify the authenticity of the computation. We extend this notion to consider a multi-party setting where we wish to produce a tag that allows verifying (possibly different) computations on all party's data at once. Moreover, the size of this tag should not grow as a function of the number of parties or the complexity of the computations. We construct the first aggregate homomorphic MAC scheme that achieves such aggregation of homomorphic tags. Moreover, the final aggregate tag consists of only a single group element. Our construction supports aggregation of computations that can be expressed by bounded-depth arithmetic circuits and is secure in the random oracle model based on the hardness of the Computational Co-Diffie-Hellman problem over an asymmetric bilinear map.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
Keywords: homomorphic authenticators aggregate MAC verifiable computation
Contact author(s): suvasree @ gwu edu
arkady @ gwu edu
History: 2024-09-30: approved; 2024-09-24: received; See all versions
Short URL: https://ia.cr/2024/1499
License: CC BY

BibTeX

@misc{cryptoeprint:2024/1499,
      author = {Suvasree Biswas and Arkady Yerukhimovich},
      title = {Multi-Key Fully-Homomorphic Aggregate {MAC} for Arithmetic Circuits},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/1499},
      year = {2024},
      url = {https://eprint.iacr.org/2024/1499}
}