Bit security of the CDH problems over finite fields

Mingqiang Wang, Tao Zhan, Haibin Zhang*

*此作品的通讯作者

科研成果: 书/报告/会议事项章节会议稿件同行评审

2 引用 (Scopus)

摘要

It is a long-standing open problem to prove the existence of (deterministic) hard-core predicates for the Computational Diffie- Hellman (CDH) problem over finite fields, without resorting to the generic approaches for any one-way functions (e.g., the Goldreich-Levin hard-core predicates). Fazio et al. (FGPS, Crypto ’13) made important progress on this problem by defining a weaker Computational Diffie- Hellman problem over Fp2, i.e., Partial-CDH problem, and proving, when allowing changing field representations, the unpredictability of every single bit of one of the coordinates of the secret Diffie-Hellman value. In this paper, we show that all the individual bits of the CDH problem over Fp2 and almost all the individual bits of the CDH problem over Fpt for t > 2 are hard-core.

源语言英语
主期刊名Selected Areas in Cryptography - SAC 2015 - 22nd International Conference, 2015, Revised Selected Papers
编辑Liam Keliher, Orr Dunkelman
出版商Springer Verlag
441-461
页数21
ISBN(印刷版)9783319313009
DOI
出版状态已出版 - 2016
已对外发布
活动22nd International Conference on Selected Areas in Cryptography, SAC 2015 - Sackville, 加拿大
期限: 12 8月 201514 8月 2015

出版系列

姓名Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
9566
ISSN(印刷版)0302-9743
ISSN(电子版)1611-3349

会议

会议22nd International Conference on Selected Areas in Cryptography, SAC 2015
国家/地区加拿大
Sackville
时期12/08/1514/08/15

指纹

探究 'Bit security of the CDH problems over finite fields' 的科研主题。它们共同构成独一无二的指纹。

引用此