arrow
Return

Batch Public Key Cryptosystem with batch multi-exponentiation

delete2016-09-01
delete3
PRE
AI
Q
Qianhong Wu
Y
Yang Sun
B
Bo Qin
胡坚堃 cover
胡坚堃 (Jiankun Hu)
W
Weiran Liu
J
Jianwei Liu
丁勇 cover
丁勇 (Yong Ding) *
DOI:10.1016/j.future.2015.12.009delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
A Public Key Cryptosystem (PKC) is a fundamental tool to protect data security. Most PKC schemes involve complicated operations, e.g., modular exponentiations, which are expensive for cloud environment where enormous data are collected from capability-limited devices, e.g., wireless sensors, mobile phones and tablets. To address this problem, this paper investigate how to reduce the laborious computations of a large number of exponentiations in public key encryption and decryption systems. Firstly, we propose algorithms to speed up batch multi-exponentiation in different configurations. Our algorithms improve the existing multi-exponentiation and batch single-base exponentiations by allowing a large number of multi-base exponentiations to be processed in batch. Secondly, we build a batch PKC scheme from the famous Cramer-Shoup cryptosystem by allowing batch encryption and batch decryption. For batch encryption, we exploit our proposed batch multi-exponentiation approach so that multiple messages can be encrypted in batch to reduce the computation overhead; and for batch decryption, we further incorporate techniques derived from batch signature verification so that the received ciphertexts can be decrypted in batch. We conduct thorough theoretical and experimental performance analysis of the proposed batch cryptosystem. The analyses show that the batch multi-exponentiation algorithms greatly accelerate calculation speed of the Cramer-Shoup system, compared with the naive implementations with existing multi-exponentiation approaches, by more than 40% in encryption and 80% in decryption. We also provide optimal batch size configurations in the case that some ciphertexts are erroneous. This work will help make PKC towards practical applications in the cloud environment. (C) 2015 Elsevier B.V. All rights reserved.
Keywords:
Modular exponentiation
Batch multi-exponentiation
Batch encryption
Batch decryption
Cramer-Shoup cryptosystem
Cloud security
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

F
Future Generation Computer Systems-The International Journal of eScience
IF:
6.1
Papers:
6.8K
Citations:
2.3W

Organization

B
Beihang University
Scholars:
5.1W
Papers: 4.1W
Citations: 37
R
Renmin University of China
Scholars:
8.1K
Papers: 7.7K
Citations: 1.1W
G
Guilin University of Electronic Technology
Scholars:
7.4K
Papers: 5.2K
Citations: 5.4K
researcher View more organizations