IEICE TRANSACTIONS on Fundamentals
A New Efficient Algorithm for Secure Outsourcing of Modular Exponentiations
Summary :
Cloud computing enables computational resource-limited devices to economically outsource much computations to the cloud. Modular exponentiation is one of the most expensive operations in public key cryptographic protocols, and such operation may be a heavy burden for the resource-constraint devices. Previous works for secure outsourcing modular exponentiation which use one or two untrusted cloud server model or have a relatively large computational overhead, or do not support the 100% possibility for the checkability. In this letter, we propose a new efficient and verifiable algorithm for securely outsourcing modular exponentiation in the two untrusted cloud server model. The algorithm improves efficiency by generating random pairs based on EBPV generators, and the algorithm has 100% probability for the checkability while preserving the data privacy.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E103-A No.1 pp.221-224
- Publication Date
- 2020/01/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.2019CIL0002
- Type of Manuscript
- Special Section LETTER (Special Section on Cryptography and Information Security)
- Category
Authors
Shaojing FU
National University of Defense Technology,Sate Key Laboratory of Cryptology
Yunpeng YU
National University of Defense Technology,Sate Key Laboratory of Cryptology
Ming XU
National University of Defense Technology,Sate Key Laboratory of Cryptology
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Shaojing FU, Yunpeng YU, Ming XU, "A New Efficient Algorithm for Secure Outsourcing of Modular Exponentiations" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 1, pp. 221-224, January 2020, doi: 10.1587/transfun.2019CIL0002.
Abstract: Cloud computing enables computational resource-limited devices to economically outsource much computations to the cloud. Modular exponentiation is one of the most expensive operations in public key cryptographic protocols, and such operation may be a heavy burden for the resource-constraint devices. Previous works for secure outsourcing modular exponentiation which use one or two untrusted cloud server model or have a relatively large computational overhead, or do not support the 100% possibility for the checkability. In this letter, we propose a new efficient and verifiable algorithm for securely outsourcing modular exponentiation in the two untrusted cloud server model. The algorithm improves efficiency by generating random pairs based on EBPV generators, and the algorithm has 100% probability for the checkability while preserving the data privacy.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2019CIL0002/_p
Copy
@ARTICLE{e103-a_1_221,
author={Shaojing FU, Yunpeng YU, Ming XU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A New Efficient Algorithm for Secure Outsourcing of Modular Exponentiations},
year={2020},
volume={E103-A},
number={1},
pages={221-224},
abstract={Cloud computing enables computational resource-limited devices to economically outsource much computations to the cloud. Modular exponentiation is one of the most expensive operations in public key cryptographic protocols, and such operation may be a heavy burden for the resource-constraint devices. Previous works for secure outsourcing modular exponentiation which use one or two untrusted cloud server model or have a relatively large computational overhead, or do not support the 100% possibility for the checkability. In this letter, we propose a new efficient and verifiable algorithm for securely outsourcing modular exponentiation in the two untrusted cloud server model. The algorithm improves efficiency by generating random pairs based on EBPV generators, and the algorithm has 100% probability for the checkability while preserving the data privacy.},
keywords={},
doi={10.1587/transfun.2019CIL0002},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - A New Efficient Algorithm for Secure Outsourcing of Modular Exponentiations
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 221
EP - 224
AU - Shaojing FU
AU - Yunpeng YU
AU - Ming XU
PY - 2020
DO - 10.1587/transfun.2019CIL0002
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E103-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2020
AB - Cloud computing enables computational resource-limited devices to economically outsource much computations to the cloud. Modular exponentiation is one of the most expensive operations in public key cryptographic protocols, and such operation may be a heavy burden for the resource-constraint devices. Previous works for secure outsourcing modular exponentiation which use one or two untrusted cloud server model or have a relatively large computational overhead, or do not support the 100% possibility for the checkability. In this letter, we propose a new efficient and verifiable algorithm for securely outsourcing modular exponentiation in the two untrusted cloud server model. The algorithm improves efficiency by generating random pairs based on EBPV generators, and the algorithm has 100% probability for the checkability while preserving the data privacy.
ER -
English
