%0 Conference Proceedings
%T Secure Outsourcing in Discrete-Logarithm-Based and Pairing-Based Cryptography (Invited Talk)
%+ Institut universitaire de France (IUF)
%+ ALgorithms for coMmunicAtion SecuriTY (ALMASTY)
%A Vergnaud, Damien
%Z Part 1: Invited Papers
%< avec comité de lecture
%( Information Security Theory and Practice
%B 12th IFIP International Conference on Information Security Theory and Practice (WISTP)
%C Brussels, Belgium
%Y Olivier Blazy
%Y Chan Yeob Yeun
%I Springer International Publishing
%3 Lecture Notes in Computer Science
%V 11469
%P 7-11
%8 2018-12-10
%D 2018
%R 10.1007/978-3-030-20074-9_2
%Z Computer Science [cs]Conference papers
%X Cryptographic operations are performed everywhere, from standard laptop to smart cards. Some devices computational resources can be very limited and it is natural to delegate costly operations to another device capable of carrying out cryptographic algorithms. In this setting, it is obviously important to ensure the limited device that the computation is carried out correctly and that the powerful device does not learn anything about what is actually computing (including the secret inputs and outputs). We briefly review the recent advances on secure outsourcing of group exponentiation (in groups of known prime order as well as in groups of unknown order) and pairing computation.
%G English
%Z TC 11
%Z WG 11.2
%2 https://hal.science/hal-02294605v1/document
%2 https://hal.science/hal-02294605v1/file/484602_1_En_2_Chapter.pdf
%L hal-02294605
%U https://hal.science/hal-02294605
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC11
%~ IFIP-WISTP
%~ IFIP-WG11-2
%~ IFIP-LNCS-11469