Toward understanding efficient privacy-preserving homomorphic comparison (2023)
Source: IEEE Access. Unidade: IME
Subjects: COMPUTAÇÃO EM NUVEM, SEGURANÇA DE REDES, CRIPTOLOGIA, APROXIMAÇÃO POR POLINÔMIOS
ABNT
PULIDO-GAYTAN, Bernardo et al. Toward understanding efficient privacy-preserving homomorphic comparison. IEEE Access, v. 11, p. 102189-102206, 2023Tradução . . Disponível em: https://doi.org/10.1109/ACCESS.2023.3315655. Acesso em: 01 nov. 2024.APA
Pulido-Gaytan, B., Tchernykh, A., Leprévost, F., Bouvry, P., & Goldman, A. (2023). Toward understanding efficient privacy-preserving homomorphic comparison. IEEE Access, 11, 102189-102206. doi:10.1109/ACCESS.2023.3315655NLM
Pulido-Gaytan B, Tchernykh A, Leprévost F, Bouvry P, Goldman A. Toward understanding efficient privacy-preserving homomorphic comparison [Internet]. IEEE Access. 2023 ; 11 102189-102206.[citado 2024 nov. 01 ] Available from: https://doi.org/10.1109/ACCESS.2023.3315655Vancouver
Pulido-Gaytan B, Tchernykh A, Leprévost F, Bouvry P, Goldman A. Toward understanding efficient privacy-preserving homomorphic comparison [Internet]. IEEE Access. 2023 ; 11 102189-102206.[citado 2024 nov. 01 ] Available from: https://doi.org/10.1109/ACCESS.2023.3315655