%0 Conference Proceedings
%T A More Efficient 1–Checkable Secure Outsourcing Algorithm for Bilinear Maps
%+ Tübitak Bilgem
%+ FernUniversität in Hagen
%A Kalkar, Öznur
%A Kiraz, Mehmet, Sabir
%A Sertkaya, İsa
%A Uzunkol, Osmanbey
%Z Part 5: Protocols and Algorithms
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 11th IFIP International Conference on Information Security Theory and Practice (WISTP)
%C Heraklion, Greece
%Y Gerhard P. Hancke
%Y Ernesto Damiani
%I Springer International Publishing
%3 Information Security Theory and Practice
%V LNCS-10741
%P 155-164
%8 2017-09-28
%D 2017
%R 10.1007/978-3-319-93524-9_10
%K Outsourcing computation
%K Bilinear maps
%K Security
%K Privacy
%Z Computer Science [cs]Conference papers
%X With the rapid advancements in innovative technologies like cloud computing, internet of things, and mobile computing, the paradigm to delegate the heavy computational tasks from trusted and resource-constrained devices to potentially untrusted and more powerful services has gained a lot of attention. Ensuring the verifiability of the outsourced computation along with the security and privacy requirements is an active research area. Several cryptographic protocols have been proposed by using pairing-based cryptographic techniques based on bilinear maps of suitable elliptic curves. However, the computational overhead of bilinear maps forms the most expensive part of those protocols. In this paper, we propose a new 1–checkable algorithm under the one-malicious version of a two-untrusted-program model. Our solution is approximately twice as efficient as the single comparably efficient 1–checkable solution in the literature, and requires only 4 elliptic curve point additions in the preimage and 6 field multiplications in the image of the bilinear map.
%G English
%Z TC 11
%Z WG 11.2
%2 https://inria.hal.science/hal-01875517/document
%2 https://inria.hal.science/hal-01875517/file/469589_1_En_10_Chapter.pdf
%L hal-01875517
%U https://inria.hal.science/hal-01875517
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC11
%~ IFIP-WISTP
%~ IFIP-WG11-2
%~ IFIP-LNCS-10741