Threshold public key cryptosystem for encrypting long messages

被引：0

作者：

Yang, Guang ^{[1
]}

Liu, Jiqiang ^{[1
]}

机构：

[1] Computer and Information Technology Department, Beijing Jiaotong University, Beijing

来源：

Journal of Computational Information Systems | 2015年 / 11卷 / 02期

基金：

中国国家自然科学基金;

关键词：

Computational Diffie-Hellman problem; Long messages; Semantic security; Threshold cryptosystem;

D O I：

10.12733/jcis13082

中图分类号：

学科分类号：

摘要：

In this paper, we give two schemes of threshold public key cryptosystem for encrypting long messages. Both of our cryptosystems are highly efficient: for each participant, the first scheme in semi-honest model only needs a modular exponentiation operation and the second scheme needs three modular exponentiation operations. Furthermore, we give a variant of definition of semantic security for encrypting long messages to show that our cryptosystem is semantically secure if the CDH assumption holds. 1553-9105/Copyright © 2015 Binary Information Press

引用

页码：671 / 681

页数：10

共 43 条

[41] Toward Efficient Convertible Authenticated Encryption Schemes Using Self-Certified Public Key System
Wu, Tzong-Sun
Chen, Yih-Sen
Lin, Han-Yu
KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2014, 8 (03): : 1157 - 1177
[42] Somewhat semantic secure public key encryption with filtered-equality-test in the standard model and its extension to searchable encryption
Huang, Kaibin
Tso, Raylin
Chen, Yu-Chi
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2017, 89 : 400 - 409
[43] Two methods of directly constructing probabilistic public-key encryption primitives based on third-order LFSR sequences
Jiang, ZT
Zhan, Y
Chen, D
Wang, YM
APPLIED MATHEMATICS AND COMPUTATION, 2005, 171 (02) : 900 - 911

← 1 2 3 4 5 →