Continuously Non-malleable Secret Sharing for General Access Structures-Reference-Cited by-同舟云学术

Continuously Non-malleable Secret Sharing for General Access Structures

Published:2019 Issue: Volume: Page:211-232
ISSN:0302-9743
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Brian Gianluca,Faonio Antonio,Venturi Daniele

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-36033-7_8

Reference36 articles.

1. Aggarwal, D., Agrawal, S., Gupta, D., Maji, H.K., Pandey, O., Prabhakaran, M.: Optimal computational split-state non-malleable codes. In: TCC, pp. 393–417 (2016)

2. Lecture Notes in Computer Science;D Aggarwal,2019

3. Aggarwal, D., Dodis, Y., Kazana, T., Obremski, M.: Non-malleable reductions and applications. In: STOC, pp. 459–468 (2015)

4. Aggarwal, D., Dodis, Y., Lovett, S.: Non-malleable codes from additive combinatorics. In: STOC, pp. 774–783 (2014)

5. Lecture Notes in Computer Science;D Aggarwal,2015

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

1. Unconditionally secure non-malleable secret sharing and circular external difference families;Designs, Codes and Cryptography;2023-11-16

2. Short Leakage Resilient and Non-malleable Secret Sharing Schemes;Advances in Cryptology – CRYPTO 2022;2022

3. Secret Sharing with Statistical Privacy and Computational Relaxed Non-malleability;Information Security and Cryptology – ICISC 2020;2021

4. Adaptive Extractors and Their Application to Leakage Resilient Secret Sharing;Advances in Cryptology – CRYPTO 2021;2021

5. Continuously Non-malleable Secret Sharing: Joint Tampering, Plain Model and Capacity;Theory of Cryptography;2021