The field of secure computing and coding theory is rapidly advancing, with a focus on developing innovative solutions to protect data and ensure privacy. Recent research has concentrated on improving the security and efficiency of various cryptographic schemes, including secure coded distributed computation, demand private coded caching, and fully homomorphic encryption. Notably, new constructions and techniques have been proposed to achieve optimal security and efficiency in these areas. Additionally, there has been significant progress in characterizing the optimal memory-rate tradeoff in secure coded caching and secure gradient coding. Some noteworthy papers include: Optimal Secure Coded Distributed Computation over all Fields, which presents optimal secure coded distributed schemes for all fields, and Accurate BGV Parameters Selection, which provides a new method for estimating noise growth in the Brakerski-Gentry-Vaikuntanathan scheme. Overall, these advancements have the potential to significantly impact the development of secure and efficient computing systems.