DL-Extractable UC-Commitment Schemes

被引：3

作者：

Abdolmaleki, Behzad ^{[1
]}

Baghery, Karim ^{[1
]}

Lipmaa, Helger ^{[1
]}

Siim, Janno ^{[1
]}

Zajac, Michal ^{[2
]}

机构：

[1] Univ Tartu, Tartu, Estonia

[2] Clearmatics, London, England

来源：

APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, ACNS 2019 | 2019年 / 11464卷

基金：

欧盟地平线“2020”;

关键词：

CRS model; Extractable commitment; RPK model; Universal composability; UC commitment; SECURE;

D O I：

10.1007/978-3-030-21568-2_19

中图分类号：

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

学科分类号：

0812 ;

摘要：

We define a new UC functionality (DL-extractable commitment scheme) that allows committer to open a commitment to a group element g(x); however, the simulator will be able to extract its discrete logarithm x. Such functionality is useful in situations where the secrecy of x is important since the knowledge of x enables to break privacy while the simulator needs to know x to be able to simulate the corrupted committer. Based on Fujisaki's UC-secure commitment scheme and the Damgard-Fujisaki integer commitment scheme, we propose an efficient commitment scheme that realizes the new functionality. As another novelty, we construct the new scheme in the weaker RPK (registered public key) model instead of the CRS model used by Fujisaki.

引用

页码：385 / 405

页数：21

共 25 条

[1] Public-Key Encryption Indistinguishable Under Plaintext-Checkable Attacks [J].

Abdalla, Michel ;

Benhamouda, Fabrice ;

Pointcheval, David .

PUBLIC-KEY CRYPTOGRAPHY - PKC 2015, 2015, 9020 :332-352

[2]

[Anonymous], 1991, INPROC 11 ANN INT CR, DOI [10.1007/3-540-46766-1_9, DOI 10.1007/3-540-46766-1_9, DOI 10.1007/3--540-46766-1_9]

[3] Universally composable protocols with relaxed set-up assumptions [J].

Barak, B ;

Canetti, R ;

Nielsen, JB ;

Pass, R .

45TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2004, :186-195

[4]

Belenkiy M, 2008, LECT NOTES COMPUT SC, V4948, P356, DOI 10.1007/978-3-540-78524-8_20

[5] Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs [J].

Ben-Sasson, Eli ;

Chiesa, Alessandro ;

Green, Matthew ;

Tromer, Eran ;

Virza, Madars .

2015 IEEE SYMPOSIUM ON SECURITY AND PRIVACY SP 2015, 2015, :287-304

[6]

Blazy O., 2013, Lecture Notes in Computer Science, V7954, P534

[7]

Blum M., 1988, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, P103, DOI 10.1145/62212.62222

[8]

Camenisch J, 2003, LECT NOTES COMPUT SC, V2729, P126

[9]

Canetti R., 2001, Advances in Cryptology - CRTPTO 2001. 21st Annual International Cryptology Conference, Proceedings (Lecture Notes in Computer Science Vol.2139), P19

[10] Universally composable security: A new paradigm for cryptographic protocols [J].

Canetti, R .

42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, :136-145

← 1 2 3 →