Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments-Reference-Cited by-同舟云学术

Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments

Published:2010 Issue: Volume: Page:193-208
ISSN:0302-9743
Container-title:Public Key Cryptography – PKC 2010
language:
Short-container-title:

Author:

Cao Zhenfu,Visconti Ivan,Zhang Zongyang

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-13013-7_12.pdf

Reference26 articles.

1. Dolev, D., Dwork, C., Naor, M.: Nonmalleable cryptography. SIAM J. Comput. 30(2), 391–437 (2000)

2. Crescenzo, G.D., Ishai, Y., Ostrovsky, R.: Non-interactive and non-malleable commitment. In: STOC 1998: Proceedings of the thirtieth annual ACM symposium on Theory of computing, pp. 141–150. ACM, New York (1998)

3. Lecture Notes in Computer Science;M. Fischlin,2000

4. Pass, R., Rosen, A.: New and improved constructions of non-malleable cryptographic protocols. In: Gabow, H.N., Fagin, R. (eds.) STOC, pp. 533–542. ACM, New York (2005)

5. Pass, R., Rosen, A.: New and improved constructions of nonmalleable cryptographic protocols. SIAM J. Comput. 38(2), 702–752 (2008)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Four-Round Black-Box Non-malleable Schemes from One-Way Permutations;Theory of Cryptography;2022

2. Non-malleability vs. CCA-Security: The Case of Commitments;Public-Key Cryptography – PKC 2018;2018

3. Four-Round Concurrent Non-Malleable Commitments from One-Way Functions;Advances in Cryptology – CRYPTO 2017;2017

4. Concurrent Non-Malleable Commitments (and More) in 3 Rounds;Advances in Cryptology – CRYPTO 2016;2016

5. On Adaptively Secure Protocols;Lecture Notes in Computer Science;2014