Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations-Reference-Cited by-同舟云学术

Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations

Published:2017 Issue: Volume: Page:727-757
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2017
language:
Short-container-title:

Author:

Applebaum Benny,Arkis Barak,Raykov Pavel,Vasudevan Prashant Nalini

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-63688-7_24

Reference38 articles.

1. Aaronson, S.: Impossibility of succinct quantum proofs for collision-freeness. Quantum Inf. Comput. 12(1–2), 21–28 (2012)

2. Lecture Notes in Computer Science;B Aiello,2001

3. Ambainis, A.: Polynomial degree and lower bounds in quantum complexity: collision and element distinctness with small range. Theory Comput. 1(1), 37–46 (2005)

4. Ambrona, M., Barthe, G., Schmidt, B.: Generic transformations of predicate encodings: constructions and applications. In: To appear in CRYPTO 2017 (2017). http://eprint.iacr.org/2016/1105

5. Applebaum, B., Arkis, B., Raykov, P., Vasudevan, P.N.: Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations. Cryptology ePrint Archive, Report 2017/164 (2017). Full version of this paper: http://eprint.iacr.org/2017/164

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

1. Relating non-local quantum computation to information theoretic cryptography;Quantum;2024-06-27

2. On the Linear Capacity of Conditional Disclosure of Secrets;IEEE Transactions on Communications;2023-12

3. On Extremal Rates of Secure Storage Over Graphs;IEEE Transactions on Information Forensics and Security;2023

4. Improved Polynomial Secret-Sharing Schemes;Theory of Cryptography;2023

5. Communication Cost of Two-Database Symmetric Private Information Retrieval: A Conditional Disclosure of Multiple Secrets Perspective;2022 IEEE International Symposium on Information Theory (ISIT);2022-06-26