Password-protected Secret-sharing Schemes without Random Oracles

被引：0

作者：

Hasegawa, Shingo ^{[1
]}

Isobe, Shuji ^{[1
]}

Iwazaki, Jun-ya ^{[1
]}

Koizumi, Eisuke ^{[1
]}

Shizuya, Hiroki ^{[1
]}

机构：

[1] Tohoku Univ, Grad Sch Informat Sci, Sendai, Miyagi 9808576, Japan

来源：

2014 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA) | 2014年

关键词：

password-protected secret sharing; standard model; simulation-sound non-interactive zero knowledge proof; subgroup decision problem; decision linear problem;

D O I：

暂无

中图分类号：

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

学科分类号：

0812 ;

摘要：

We propose a password-protected secret sharing scheme which is provably secure without the random oracles. Three tools enable us to achieve this property: the IND-CCA secure threshold encryption scheme of Libert and Yung, the linear encryption scheme and the technique for constructing a simulation-sound non-interactive zero knowledge proof for any language in NP.

引用

页码：566 / 570

页数：5

共 9 条

[1] Bagherzandi A, 2011, PROCEEDINGS OF THE 18TH ACM CONFERENCE ON COMPUTER & COMMUNICATIONS SECURITY (CCS 11), P433
[2] Short group signatures
Boneh, D
Boyen, X
Shacham, H
[J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2004, PROCEEDINGS, 2004, 3152 : 41 - 55
[3] Camenisch J., 2012, CCS 12, P525, DOI DOI 10.1145/2382196.2382252
[4] De Santis A., 2001, Advances in Cryptology - CRTPTO 2001. 21st Annual International Cryptology Conference, Proceedings (Lecture Notes in Computer Science Vol.2139), P566
[5] Groth J, 2006, LECT NOTES COMPUT SC, V4284, P444
[6] Groth J, 2006, LECT NOTES COMPUT SC, V4117, P97
[7] Hasegawa S., STRENGTHENED S UNPUB
[8] Libert B, 2012, LECT NOTES COMPUT SC, V7194, P75, DOI 10.1007/978-3-642-28914-9_5
[9] HOW TO SHARE A SECRET
SHAMIR, A
[J]. COMMUNICATIONS OF THE ACM, 1979, 22 (11) : 612 - 613

← 1 →