Efficient Pseudorandom Correlation Generators: Silent OT Extension and More-Reference-Cited by-同舟云学术

Efficient Pseudorandom Correlation Generators: Silent OT Extension and More

Published:2019 Issue: Volume: Page:489-518
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2019
language:
Short-container-title:

Author:

Boyle Elette,Couteau Geoffroy,Gilboa Niv,Ishai Yuval,Kohl Lisa,Scholl Peter

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-26954-8_16

Reference63 articles.

1. Aguilar, C., Blazy, O., Deneuville, J.C., Gaborit, P., Zémor, G.: Efficient encryption from random quasi-cyclic codes. Cryptology ePrint Archive, Report 2016/1194 (2016). http://eprint.iacr.org/2016/1194

2. Alekhnovich, M.: More on average case vs approximation complexity. In: 44th FOCS. IEEE Computer Society Press, October 2003

3. Lecture Notes in Computer Science;B Applebaum,2017

4. Applebaum, B., Haramaty, N., Ishai, Y., Kushilevitz, E., Vaikuntanathan, V.: Low-complexity cryptographic hash functions. In: ITCS 2017. LIPIcs, January 2017

5. Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography with constant input locality. J. Cryptol. 22(4), 429–469 (2009)

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

1. PRSD: Efficient protocol for privacy-preserving retrieval of sensitive data based on labeled PSI;Computer Networks;2024-09

2. MPC-PAT: A Pipeline Architecture for Beaver Triple Generation in Secure Multi-party Computation;2024 IEEE International Test Conference in Asia (ITC-Asia);2024-08-18

3. Compact Key Function Secret Sharing with Non-linear Decoder;IACR Communications in Cryptology;2024-07-08

4. Communication-Efficient Secure Logistic Regression;2024 IEEE 9th European Symposium on Security and Privacy (EuroS&P);2024-07-08

5. ScionFL: Efficient and Robust Secure Quantized Aggregation;2024 IEEE Conference on Secure and Trustworthy Machine Learning (SaTML);2024-04-09