Victoria Oluwaseyi Adedayo-Ajayi

Victoria Oluwaseyi Adedayo-Ajayi

Auto-generated profile, based on publicly available information

Victoria Oluwaseyi Adedayo-Ajayi


Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2025 in Data Science and Management
Verified
Journal Article
Open access
EAEmmanuel Oluwatobi Asani
Emmanuel Oluwatobi Asani
MAMojiire Oluwaseun Ayoola
Mojiire Oluwaseun Ayoola
EAEmmanuel Tunbosun Aderemi
Emmanuel Tunbosun Aderemi
VAVictoria Oluwaseyi Adedayo-Ajayi
Victoria Oluwaseyi Adedayo-Ajayi
JAJoyce A. Ayoola
Joyce A. Ayoola
OOOluwambo Tolulope Olowe
Oluwambo Tolulope Olowe

13 March 2026 in Asian Journal of Current Research
Verified
Journal Article
Closed access
VAVictoria Oluwaseyi Adedayo-Ajayi
Victoria Oluwaseyi Adedayo-Ajayi
AJAlabi John Jesubuyikunmi
Alabi John Jesubuyikunmi
AOAdekunle Kolawole Ojo
Adekunle Kolawole Ojo
AMAikore Abiodun Muyideen
Aikore Abiodun Muyideen
OJOjo Omotayo Job
Ojo Omotayo Job
AOAkinola Olufemi Olaoluwa
Akinola Olufemi Olaoluwa
Homomorphic Encryption (HE) enables arithmetic operations to be performed directly on encrypted data, thereby preserving confidentiality during computation. However, the high computational cost associated with HE continues to limit its large-scale practical deployment. This paper presents a comparative experimental evaluation of three prominent homomorphic encryption schemes, Brakerski/Fan-Vercauteren (BFV), Brakerski-Gentry-Vaikuntanathan (BGV), and Cheon-Kim-Kim-Song (CKKS), using the Microsoft SEAL library. The study investigates the performance of fundamental homomorphic operations, including encryption, decryption, addition, multiplication, and squaring, across multiple polynomial modulus degree settings. Experiments were conducted using Microsoft SEAL’s benchmarking framework, and performance outputs were systematically analyzed to identify runtime trends and operational trade-offs. The results show that execution time increases substantially with higher parameter sizes for all three schemes, reflecting the inherent balance between security strength and computational efficiency. While ciphertext addition incurred minimal overhead, multiplication and squaring represented the dominant performance bottlenecks. Furthermore, CKKS showed relatively competitive efficiency in selected computational scenarios compared to BFV and BGV. The findings contribute empirical insight into the practical behavior of widely used HE schemes and provide guidance for selecting appropriate schemes and parameters in privacy-preserving computing environments.