2026-04-17T20:37:41Zhttps://recercat.cat/oai/request

oai:recercat.cat:2117/3437252026-02-07T12:09:51Zcom_2072_1033col_2072_452950

Efficient polynomial delegation under standard assumptions Morillo Bosch, M. Paz Obrador Sureda, Marc Universitat Politècnica de Catalunya. Departament de Matemàtiques Universitat Politècnica de Catalunya. MAK - Matemàtica Aplicada a la Criptografia À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 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) 2013 Conference lecture Morillo, M.; Obrador, M. Efficient polynomial delegation under standard assumptions. A: Annual Conference on Privacy, Security and Trust. "2013 Eleventh Annual Conference on Privacy, Security and Trust (PST 2013): Tarragona, Spain: 10-12 july, 2013: proceedings". Institute of Electrical and Electronics Engineers (IEEE), 2013, p. 301-308. ISBN 9781467358378. DOI 10.1109/PST.2013.6596066. 9781467358378 https://hdl.handle.net/2117/343725 10.1109/PST.2013.6596066 eng 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 8 p. application/pdf Institute of Electrical and Electronics Engineers (IEEE)