New Algorithms for Secure Outsourcing of Modular Exponentiations

DOI10.1007/978-3-642-33167-1_31zbMath1407.94097OpenAlexW1855553159MaRDI QIDQ2856093

Qiang Tang, Xiaofeng Chen, Wenjing Lou, Jin Li, Jian-Feng Ma

Publication date: 23 October 2013

Published in: Computer Security – ESORICS 2012 (Search for Journal in Brave)

Full work available at URL: http://orbilu.uni.lu/handle/10993/18025

zbMATH Keywords

modular exponentiationcloud computingoutsource-secure algorithms

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07) Internet topics (68M11)

Related Items (12)

CRT-Based Outsourcing Algorithms for Modular Exponentiations ⋮ A survey on delegated computation ⋮ Secure outsourcing of modular exponentiations under single untrusted programme model ⋮ Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem ⋮ Hide the Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT ⋮ Efficient and secure delegation of exponentiation in general groups to a single malicious server ⋮ Thrackles: An Improved Upper Bound ⋮ Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions ⋮ Efficient algorithms for secure outsourcing of bilinear pairings ⋮ Enabling Compressed Encryption for Cloud Based Big Data Stores ⋮ Efficient computation outsourcing for inverting a class of homomorphic functions ⋮ Delegating a product of group exponentiations with application to signature schemes

This page was built for publication: New Algorithms for Secure Outsourcing of Modular Exponentiations