Universitat Politècnica de Catalunya
Universitat Politècnica de Catalunya. Departament de Matemàtiques
Universitat Politècnica de Catalunya. MAK - Matemàtica Aplicada a la Criptografia
2013
In this paper we present a new scheme for verifiable delegation of polynomials in a cloud computing scenario. The security of our scheme is based on a standard assumption, the subgroup membership one. Furthermore, the scheme is highly efficient since the number of operations is independent of the degree of the polynomial. We also propose a second scheme that allows to hide the polynomial to be delegated and that improves the efficiency of the scheme by Benabbas et al. in [BGV11]. Moreover, we give a third polynomial delegation scheme which is the first that allows the client to hide the input point.
Peer Reviewed
Postprint (author's final draft)
Conference lecture
English
Àrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi matemàtica; Polynomials; Teoria de nombres; Classificació AMS::11 Number theory::11C Polynomials and matrices
Institute of Electrical and Electronics Engineers (IEEE)
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6596066
info:eu-repo/grantAgreement/MICINN//MTM2009-07694/ES/Criptografia De Clave Publica Y Comparticion De Secretos/
Restricted access - publisher's policy
E-prints [73057]
