Verifiable Computing Frameworks from Functional Encryption and Functional Signatures

Part of the SpringerBriefs in Computer Science book series (BRIEFSCOMPUTER)


In addition to proof or argument based verifiable computing schemes and constructions that rely on homomorphic encryption or homomorphic authenticators, verifiable computing schemes can also be constructed using functional encryption or functional signatures. Thus, in this chapter we present the verifiable computing schemes using one of these primitives. Functional encryption refers to encryption schemes where ciphertexts can be decrypted only if they fulfill certain requirements. There are basically two approaches that use functional encryption to build a verifiable computing scheme. “Verifiable Computation from Attribute Based Encryption” by Parno et al. uses (key-policy) attribute-based encryption, a specific instantiation of functional encryption, while the approach presented in “Delegatable Homomorphic Encryption with Applications to Secure Outsourcing of Computation” by Barbosa and Farshim is constructed directly from functional encryption schemes. Functional signatures come with a secondary parameterized signing key, in addition to the master signing key, that allows to sign messages, but restricts the signing capabilities to messages in a certain range. This property allows to build verifiable computing schemes as shown by Boyle et al. in “Functional Signatures and Pseudorandom Functions”.


  1. 1.
    M. Backes, S. Meiser, D. Schröder, Delegatable functional signatures, in Public-Key Cryptography - PKC 2016 - 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings, Part I, Taipei, 6–9 March 2016, pp. 357–386Google Scholar
  2. 2.
    M. Barbosa, P. Farshim, Delegatable homomorphic encryption with applications to secure outsourcing of computation, in Topics in Cryptology - CT-RSA 2012 - The Cryptographers’ Track at the RSA Conference 2012, Proceedings, San Francisco, CA, 27 February–2 March 2012, pp. 296–312Google Scholar
  3. 3.
    D. Boneh, A. Sahai, B. Waters, Functional encryption: definitions and challenges, in Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011 (2011), pp. 253–273Google Scholar
  4. 4.
    E. Boyle, S. Goldwasser, I. Ivan, Functional signatures and pseudorandom functions, in Public-Key Cryptography - PKC 2014 - 17th International Conference on Practice and Theory in Public-Key Cryptography, Proceedings, Buenos Aires, 26–28 March 2014, pp. 501–519Google Scholar
  5. 5.
    J. Chen, H. Wee, Semi-adaptive attribute-based encryption and improved delegation for Boolean formula, in Security and Cryptography for Networks - 9th International Conference, SCN 2014, Proceedings, Amalfi, 3–5 September 2014, pp. 277–297Google Scholar
  6. 6.
    S.A. Cook, The complexity of theorem-proving procedures, in Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, Shaker Heights, OH, 3–5 May 1971, pp. 151–158Google Scholar
  7. 7.
    S. Garg, C. Gentry, S. Halevi, M. Raykova, A. Sahai, B. Waters, Candidate indistinguishability obfuscation and functional encryption for all circuits, in 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, Berkeley, CA, 26–29 October 2013, pp. 40–49Google Scholar
  8. 8.
    V. Goyal, O. Pandey, A. Sahai, B. Waters, Attribute-based encryption for fine-grained access control of encrypted data, in Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006 (2006), pp. 89–98Google Scholar
  9. 9.
    B. Parno, M. Raykova, V. Vaikuntanathan, How to delegate and verify in public: verifiable computation from attribute-based encryption, in Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Proceedings, Taormina, 19–21 March 2012, pp. 422–439Google Scholar
  10. 10.
    A. Sahai, B. Waters, Fuzzy identity-based encryption, in Advances in Cryptology - EUROCRYPT 2005 (2005), pp. 457–473Google Scholar
  11. 11.
    K. Zhang, J. Gong, S. Tang, J. Chen, X. Li, H. Qian, Z. Cao, Practical and efficient attribute-based encryption with constant-size ciphertexts in outsourced verifiable computation, in Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, AsiaCCS 2016, Xi’an, 30 May–3 June, 2016, pp. 269–279Google Scholar

Copyright information

© The Author(s) 2017

Authors and Affiliations

  1. 1.Theoretische InformatikTechnische Universität DarmstadtDarmstadtGermany

Personalised recommendations