1. Angel, S., Chen, H., Laine, K., Setty, S.T.V.: PIR with compressed queries and amortized query processing. In: IEEE Symposium on Security and Privacy (2018)
2. Lecture Notes in Computer Science;B Applebaum,2018
3. Araki, T., Furukawa, J., Lindell, Y., Nof, A., Ohara, K.: High-throughput semi-honest secure three-party computation with an honest majority. In: CCS 2016 (2016)
4. Austrin, P., Kaski, P., Kubjas, K.: Tensor network complexity of multilinear maps. In: ITCS 2019 (2019)
5. Ball, M., Holmgren, J., Ishai, Y., Liu, T., Malkin, T.: On the complexity of decomposable randomized encodings, or: how friendly can a garbling-friendly PRF be? In: ITCS 2020, pp. 86:1–86:22 (2020)