Velasquez, K., Perez Abreu, D., Assis, M. R. M., Senna, C.
, Aranha, D. F., Bittencourt, L. F., Laranjeiro, N., Curado, M., Vieira, M., Monteiro, E. & Madeira, E. (2018).
Fog orchestration for the Internet of Everything: state-of-the-art and research challenges.
Journal of Internet Services and Applications,
9(14), Article 14.
https://doi.org/10.1186/s13174-018-0086-3
Damgård, I., Jakobsen, T. P.
, Nielsen, J. B., Pagter, J. I. & Østergaard, M. B. (2022).
Fast threshold ECDSA with honest majority.
Journal of Computer Security,
30(1), 167-196.
https://doi.org/10.3233/JCS-200112
Davi Resende, A. C., Railsback, D., Dowsley, R., Nascimento, A. C. A.
& Aranha, D. F. (2022).
Fast Privacy-Preserving Text Classification based on Secure Multiparty Computation.
IEEE Transactions on Information Forensics and Security,
17, 428-442.
https://doi.org/10.1109/TIFS.2022.3144007
Davi Resende, A. C.
& Aranha, D. F. (2018).
Faster Unbalanced Private Set Intersection. In S. Meiklejohn & K. Sako (Eds.),
Financial Cryptography and Data Security - 22nd International Conference, FC 2018, Revised Selected Papers: 22nd International Conference, FC 2018, Nieuwpoort, Curaçao, February 26 – March 2, 2018, Revised Selected Papers (1 ed., pp. 203-221). Springer.
https://doi.org/10.1007/978-3-662-58387-6
Frederiksen, T. K., Jakobsen, T. P. & Nielsen, J. B. (2014).
Faster Maliciously Secure Two-Party Computation Using the GPU. In M. Abdalla & R. D. Prisco (Eds.),
Security and Cryptography for Networks: 9th International Conference, SCN 2014, Amalfi, Italy, September 3-5, 2014. Proceedings (pp. 358-379 ). Springer.
https://doi.org/10.1007/978-3-319-10879-7_21
Segal, S., Adi, Y., Pinkas, B.
, Baum, C., Ganesh, C. & Keshet, J. (2021).
Fairness in the Eyes of the Data: Certifying Machine-Learning Models. In
AIES 2021 - Proceedings of the 2021 AAAI/ACM Conference on AI, Ethics, and Society (pp. 926-935). Association for Computing Machinery.
https://doi.org/10.1145/3461702.3462554
Nielsen, P. M.
, Schori, C., Sørensen, J. L., Salvail, L., Damgård, I. B. & Polzik, E. S. (2001).
Experimental quantum key distribution with proven security against realistic attacks.
Journal of Modern Optics,
48, 1921-1942.
Hansen, K. M., Antolin Rafael, P., Camara, J., Carro, S., Metha, G., Rosengren, P.
, Pagter, J. I. & Pedersen, M. Ø. (2005).
eu-DOMAIN D3.1 + D4.1 Software Architecture Specification.
Boudgoust, K., Jeudy, C., Roux-Langlois, A. & Wen, W. (2023).
Entropic Hardness of Module-LWE from Module-NTRU. In T. Isobe & S. Sarkar (Eds.),
Progress in Cryptology – INDOCRYPT 2022: 23rd International Conference on Cryptology in India, Kolkata, India, December 11–14, 2022, Proceedings (pp. 78-99). Springer.
https://doi.org/10.1007/978-3-031-22912-1_4
Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L.
& Scholl, P. (2020).
Efficient pseudorandom correlation generators from ring-lpn. In D. Micciancio & T. Ristenpart (Eds.),
Advances in Cryptology - CRYPTO 2020 (pp. 387-416). Springer.
https://doi.org/10.1007/978-3-030-56880-1_14
Cramer, R.
, Damgård, I. B. & MacKenzie, P. (2000).
Efficient Zero-Knowledge Proofs of Knowledge without Intractability Assumptions. In H. Imai & Y. Zheng (Eds.),
Public Key Cryptography: Third International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Melbourne, Victoria, Australia, January 18-20, 2000. Proceedings (pp. 354-373). Springer.
https://doi.org/10.1007/978-3-540-46588-1_24
Fleischhacker, N., Krupp, J., Malavolta, G., Schneider, J., Schröder, D.
& Simkin, M. (2018).
Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys.
IET Information Security,
12(3), 166-183.
https://doi.org/10.1049/iet-ifs.2017.0041
Cascudo, I.
, Damgård, I., David, B., Döttling, N., Dowsley, R. & Giacomelli, I. (2019).
Efficient UC Commitment Extension with Homomorphism for Free (and Applications). In S. D. Galbraith & S. Moriai (Eds.),
Advances in Cryptology – ASIACRYPT 2019 - 25th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (pp. 606-635). Springer.
https://doi.org/10.1007/978-3-030-34621-8_22
Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Rindal, P.
& Scholl, P. (2019).
Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. In L. Cavallaro, J. Kinder, X. Wang & J. Katz (Eds.),
CCS 2019 - Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security (pp. 291-308). Association for Computing Machinery.
https://doi.org/10.1145/3319535.3354255
Aranha, D. F., Azarderakhsh, R. & Karabina, K. (2017).
Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves. In S. S. Ali, J.-L. Danger & T. Eisenbarth (Eds.),
Security, Privacy, and Applied Cryptography Engineering - 7th International Conference, SPACE 2017, Proceedings: 7th International Conference, SPACE 2017, Goa, India, December 13-17, 2017, Proceedings (pp. 74-92). Springer.
https://doi.org/10.1007/978-3-319-71501-8_5
Hazay, C., Mikkelsen, G. L., Rabin, T., Toft, T. & Nicolosi, A. A. (2019).
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting.
Journal of Cryptology,
32(2), 265-323.
https://doi.org/10.1007/s00145-017-9275-7
Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L.
& Scholl, P. (2019).
Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. In D. Micciancio & A. Boldyreva (Eds.),
Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings: CRYPTO 2019 (pp. 489-518). Springer.
https://doi.org/10.1007/978-3-030-26954-8_16