Constant Ciphertext-Rate Non-committing Encryption from Standard Assumptions-Reference-Cited by-同舟云学术

Constant Ciphertext-Rate Non-committing Encryption from Standard Assumptions

Published:2020 Issue: Volume: Page:58-87
ISSN:0302-9743
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Brakerski Zvika,Branco Pedro,Döttling Nico,Garg Sanjam,Malavolta Giulio

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-64375-1_3

Reference23 articles.

1. Lecture Notes in Computer Science;D Beaver,1997

2. Lecture Notes in Computer Science;E Boyle,2016

3. Lecture Notes in Computer Science;Z Brakerski,2019

4. Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively secure multi-party computation. In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, pp. 639–648. STOC 1996. ACM, New York (1996). http://doi.acm.org/10.1145/237814.238015

5. Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, pp. 494–503. STOC 202, Association for Computing Machinery, New York (2002). https://doi.org/10.1145/509907.509980

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

1. Algebraic Restriction Codes and Their Applications;Algorithmica;2023-07-24

2. A Framework for Statistically Sender Private OT with Optimal Rate;Advances in Cryptology – CRYPTO 2023;2023

3. Batch-OT with Optimal Rate;Advances in Cryptology – EUROCRYPT 2022;2022

4. New and Improved Constructions for Partially Equivocable Public Key Encryption;Lecture Notes in Computer Science;2022

5. Amortizing Rate-1 OT and Applications to PIR and PSI;Theory of Cryptography;2021