Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments-Reference-Cited by-同舟云学术

Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments

Published:2018 Issue: Volume: Page:225-254
ISSN:0302-9743
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Damgård Ivan,Kazana Tomasz,Obremski Maciej,Raj Varun,Siniscalchi Luisa

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-03810-6_9

Reference50 articles.

1. Lecture Notes in Computer Science;D Aggarwal,2016

2. Aggarwal, D., Dodis, Y., Lovett, S.: Non-malleable codes from additive combinatorics. In: STOC. ACM (2014)

3. Aggarwal, D., Döttling, N., Nielsen, J.B., Obremski, M., Purwanto, E.: Information theoretic continuously non-malleable codes in the constant split-state model. In: Presented at IMS Workshop on Information Theoretic Cryptography in NUS, Singapore (2016). Unpublished Manuscript, available on eprint

4. Lecture Notes in Computer Science;D Aggarwal,2017

5. Lecture Notes in Computer Science;S Agrawal,2015

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

1. Non-Malleable Code in the Split-State Model;Entropy;2022-07-28

2. Continuously Non-malleable Codes Against Bounded-Depth Tampering;Advances in Cryptology – ASIACRYPT 2022;2022

3. Non-malleable Encryption: Simpler, Shorter, Stronger;Journal of Cryptology;2020-08-04

4. Continuously Non-malleable Codes in the Split-State Model;Journal of Cryptology;2020-07-24

5. Upper and Lower Bounds for Continuous Non-Malleable Codes;Public-Key Cryptography – PKC 2019;2019