Statistically Sender-Private OT from LPN and Derandomization-Reference-Cited by-同舟云学术

Statistically Sender-Private OT from LPN and Derandomization

Published:2022 Issue: Volume: Page:625-653
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2022
language:
Short-container-title:

Author:

Bitansky Nir,Freizeit Sapir

Publisher

Springer Nature Switzerland

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-15982-4_21

Reference48 articles.

1. Aggarwal, D., Döttling, N., Dujmovic, J., Hajiabadi, M., Malavolta, G., Obremski, M.: Algebraic restriction codes and their applications. In: Braverman, M (ed.) 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, LIPIcs, Berkeley, CA, USA, 31 January–3 February 2022, vol. 215, pp. 2:1–2:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)

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

3. Alekhnovich, M.: More on average case versus approximation complexity. In: Proceedings of 44th Symposium on Foundations of Computer Science (FOCS 2003), Cambridge, MA, USA, 11–14 October 2003, pp. 298–307. IEEE Computer Society (2003)

4. Lecture Notes in Computer Science;P Ananth,2017

5. Lecture Notes in Computer Science;S Badrinarayanan,2017

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

1. Lossy Cryptography from Code-Based Assumptions;Lecture Notes in Computer Science;2024

2. Round-Optimal Oblivious Transfer and MPC from Computational CSIDH;Lecture Notes in Computer Science;2023

3. Weak Zero-Knowledge via the Goldreich-Levin Theorem;Advances in Cryptology – ASIACRYPT 2023;2023

4. Combinatorially Homomorphic Encryption;Theory of Cryptography;2023

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