An IND-CPA cryptosystem from Demytko's primitive

被引：2

作者：

Galindo, D ^{[1
]}

Martín, S ^{[1
]}

Morillo, P ^{[1
]}

Villar, JL ^{[1
]}

机构：

[1] Univ Politecn Catalunya, Dept Matemat Aplicada 4, E-08028 Barcelona, Spain

来源：

2003 IEEE INFORMATION THEORY WORKSHOP, PROCEEDINGS | 2003年

关键词：

public-key cryptography; semantic security; expansion factor; elliptic curves; Demytko's scheme;

D O I：

10.1109/ITW.2003.1216721

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We propose an elliptic curve scheme over the ring Z(n)2, which is efficient and semantically secure in the standard model. It is based on factoring, and it has expansion factor 2 (previous schemes with these features present expansion factors greater or equal than 4). Demytko's primitive has been used to obtain efficiency and probabilistic encryption. Semantic security of this scheme is based on a new decisional assumption, namely, the Decisional Small Root Assumption. Confidence on this assumption is also discussed.

引用

页码：167 / 170

页数：4

共 18 条

[1] BRENT RP, 1998, AUSTR COMPUTER SCI C, P24
[2] CATALANO D, 2001, ACM CCS 2001
[3] Coppersmith D, 1996, LECT NOTES COMPUT SC, V1070, P155
[4] Cramer R, 2002, LECT NOTES COMPUT SC, V2332, P45
[5] Cramer R, 1998, LECT NOTES COMPUT SC, V1462, P13, DOI 10.1007/BFb0055717
[6] Demytko N., 1994, Lecture Notes in Computer Science, V765, P40
[7] FUJISAKI E, 2000, CRYPTO 99 LNCS, V1666, P53
[8] Elliptic curve Paillier schemes
Galbraith, SD
[J]. JOURNAL OF CRYPTOLOGY, 2002, 15 (02) : 129 - 138
[9] GALINDO D, IN PRESS P WCC 03
[10] Golwasser S., 1984, J COMPUTER SYSTEM SC, V28, P270

← 1 2 →