Abstract
Homomorphic authenticators allow to evaluate functions on authenticated data. There exist constructions both in the secret key setting in the form of homomorphic message authentication codes (MACs) and in the public key setting in the form of homomorphic signatures. These solutions can be used to respectively construct privately and publicly verifiable computing schemes. There are homomorphic MAC and signature schemes that are not known to allow verification faster than computing the function, e.g. Gennaro and Wichs (Fully homomorphic message authenticators, in Advances in Cryptology - ASIACRYPT 2013 - 19th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part II, Bengaluru, 1–5 December 2013, pp. 301–320) or Freeman (Improved security for linearly homomorphic signatures: a generic framework, in Public Key Cryptography - PKC 2012 - 15th International Conference on Practice and Theory in Public Key Cryptography, Proceedings, Darmstadt, 21–23 May 2012, pp. 697–714), and are therefore not considered in this chapter. In the following, first, we provide the definitions for schemes using homomorphic authenticators and their correctness and security. Then we present privately verifiable computing schemes using MACs, i.e. “Verifiable Delegation of Computation on Outsourced Data” by Backes et al., “Generalized Homomorphic MACs with Efficient Verification” by Zhang and Safavi-Naini, and “Efficiently Verifiable Computation on Encrypted Data” by Fiore et al. Afterwards, we present the publicly verifiable computing schemes using homomorphic signatures, i.e. “Programmable Hash Functions Go Private” by Catalano et al., “Homomorphic Signatures with Efficient Verification for Polynomial Functions” by Catalano et al., and “Algebraic (Trapdoor) One-Way Functions and their Applications” by Catalano et al. Finally, we present an approach by Lai et al., “Verifiable Computation on Outsourced Encrypted Data”, showing how to combine signature based verifiable computing with homomorphic encryption assuring privacy of the data processed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
M. Backes, D. Fiore, R.M. Reischuk, Verifiable delegation of computation on outsourced data, in 2013 ACM SIGSAC Conference on Computer and Communications Security, CCS’13, Berlin, 4–8 November 2013, pp. 863–874
D. Boneh, D.M. Freeman, J. Katz, B. Waters, Signing a linear subspace: signature schemes for network coding, in Public Key Cryptography - PKC 2009, 12th International Conference on Practice and Theory in Public Key Cryptography, Proceedings, Irvine, CA, 18–20 March 2009, pp. 68–87
D. Catalano, D. Fiore, R. Gennaro, K. Vamvourellis, Algebraic (trapdoor) one-way functions and their applications, in TCC (2013), pp. 680–699
D. Catalano, D. Fiore, B. Warinschi, Homomorphic signatures with efficient verification for polynomial functions, in Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Proceedings, Part I, Santa Barbara, CA, 17–21 August 2014, pp. 371–389
D. Catalano, A. Marcedone, O. Puglisi, Authenticating computation on groups: new homomorphic primitives and applications, in Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part II, Kaoshiung, 7–11 December 2014, pp. 193–212
D. Catalano, D. Fiore, L. Nizzardo, Programmable hash functions go private: constructions and applications to (homomorphic) signatures with shorter public keys, in Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, Proceedings, Part II, Santa Barbara, CA, 16–20 August 2015, pp. 254–274
D. Fiore, R. Gennaro, V. Pastro, Efficiently verifiable computation on encrypted data, in Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, Scottsdale, AZ, 3–7 November 2014, pp. 844–855
D.M. Freeman, Improved security for linearly homomorphic signatures: a generic framework, in Public Key Cryptography - PKC 2012 - 15th International Conference on Practice and Theory in Public Key Cryptography, Proceedings, Darmstadt, 21–23 May 2012, pp. 697–714
R. Gennaro, D. Wichs, Fully homomorphic message authenticators, in Advances in Cryptology - ASIACRYPT 2013 - 19th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part II, Bengaluru, 1–5 December 2013, pp. 301–320
J. Lai, R.H. Deng, H. Pang, J. Weng, Verifiable computation on outsourced encrypted data, in Computer Security - ESORICS 2014 - 19th European Symposium on Research in Computer Security, Proceedings, Part I, Wroclaw, 7–11 September 2014, pp. 273–291
L.F. Zhang, R. Safavi-Naini, Generalized homomorphic MACs with efficient verification, in ASIAPKC’14, Proceedings of the 2nd ACM Workshop on ASIA Public-Key Cryptography, Kyoto, 3 June 2014, pp. 3–12
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 The Author(s)
About this chapter
Cite this chapter
Demirel, D., Schabhüser, L., Buchmann, J. (2017). Homomorphic Authenticators. In: Privately and Publicly Verifiable Computing Techniques. SpringerBriefs in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-53798-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-53798-6_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-53797-9
Online ISBN: 978-3-319-53798-6
eBook Packages: Computer ScienceComputer Science (R0)