Author:
Sugizaki Yukimasa,Tsuchida Hikaru,Hayashi Takuya,Nuida Koji,Nakashima Akira,Isshiki Toshiyuki,Mori Kengo
Publisher
Springer Nature Switzerland
Reference36 articles.
1. Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169–203 (2015). https://doi.org/10.1515/jmc-2015-0016
2. Araki, T., Furukawa, J., Lindell, Y., Nof, A., Ohara, K.: High-throughput semi-honest secure three-party computation with an honest majority. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (CCS 2016), pp. 805–817. Association for Computing Machinery, New York (2016). https://doi.org/10.1145/2976749.2978331
3. Asharov, G., Jain, A., López-Alt, A., Tromer, E., Vaikuntanathan, V., Wichs, D.: Multiparty computation with low communication, computation and interaction via threshold FHE. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 483–501. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29011-4_29
4. Badawi, A.A., et al.: OpenFHE: Open-Source Fully Homomorphic Encryption Library. Cryptology ePrint Archive, Paper 2022/915 (2022). https://eprint.iacr.org/2022/915
5. Beaver, D.: Commodity-based cryptography (extended abstract). In: STOC, pp. 446–455. ACM (1997)