Generalized Goldwasser and Micali's Type Cryptosystem |
| |
| Authors: | Ying Guo Zhen-Fu Cao Xiao-Lei Dong |
| |
| Affiliation: | 1.Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China;2.Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai 200062, China;3.Cyberspace Security Research Center, Peng Cheng Laboratory, Shenzhen 518055, China;4.Institute of Intelligent Science and Technology, Tongji University, Shanghai 200092, China |
| |
| Abstract: | In 1982, Goldwasser and Micali proposed the first probabilistic public key cryptosystem with indistinguishability under chosen plaintext attack security based on the quadratic residuosity assumption. Ciphertext expansion of Goldwasser's scheme is quite large, thereby the scheme is inefficient. A lot of schemes have been proposed to reduce the ciphertext expansion. Some schemes use the same encryption algorithm as Goldwasser's scheme with different parameters and keys, which we call them Goldwasser and Micali's type (GM-type) schemes. GM-type schemes can be divided into two categories according to different parameters and decryption algorithms. In this paper, we propose the first generalized GM-type scheme combining these two categories. All GM-type schemes are special cases of our generalized GM-type scheme. The ciphertext expansion of our scheme is smaller than that of any other GM-type schemes. |
| |
| Keywords: | Goldwasser and Micali's type (GM-type) scheme k-th power residuosity discrete logarithm problem |
|
| 点击此处可从《计算机科学技术学报》浏览原始摘要信息 |
|
点击此处可从《计算机科学技术学报》下载全文 |
|
