The study, conducted by Kashish Dua and Kanupriya Misra Bakhru of the Department of Humanities and Social Sciences at the Jaypee Institute of Information Technology in Noida, India, set out to test a specific statistical proposition: that coping strategies moderate, or condition, the strength of the relationship between self-efficacy and resilience. Self-efficacy, a concept rooted in Albert Bandura’s social cognitive theory, refers to a person’s belief in their capacity to execute the behaviours required to produce desired outcomes. Resilience, meanwhile, is typically understood as the process and outcome of adapting well to difficulty. Prior work had already established self-efficacy as a predictor of resilience, but the mechanisms that govern how strongly that prediction holds, and for whom, had not been examined extensively in this population. The researchers hypothesised that the link would not be fixed but would instead flex depending on how the young people coped.

Methodologically, the team recruited 405 LGBTQ youth and collected cross-sectional data, meaning all measures were captured at a single point in time rather than tracked longitudinally. The analysis was carried out using Partial Least Squares Structural Equation Modelling, or PLS-SEM, implemented in SmartPLS 4. PLS-SEM is a variance-based approach to structural equation modelling that is particularly useful when models include latent constructs, such as self-efficacy or resilience, that cannot be observed directly and must instead be inferred from multiple survey indicators. In the specified model, self-efficacy served as the independent variable, resilience as the dependent variable, and coping strategies as the moderator whose interaction with self-efficacy was the central test. To establish whether the estimated path coefficients were statistically reliable, the researchers employed bootstrapping with 5,000 resamples, a resampling technique that repeatedly re-estimates the model on random subsamples of the data to generate confidence intervals and significance tests for each path.

The headline result was a robust positive association between self-efficacy and resilience. The path coefficient came in at 0.614, with a t-statistic of 19.225 and a p-value below 0.001, indicating that young people who reported stronger beliefs in their own capabilities also reported markedly higher resilience. In structural equation modelling terms, a coefficient of this size is substantial: it suggests that self-efficacy is not a marginal contributor but one of the dominant psychological correlates of resilience in this sample. Coping strategies also showed a direct positive effect on resilience, with a coefficient of 0.163, a t-statistic of 2.391 and a p-value of 0.017, meaning that the mere presence of coping resources, independent of self-efficacy, was associated with better adaptive outcomes.

The moderation test itself produced a more nuanced and, in places, statistically delicate picture. The interaction term combining coping strategies and self-efficacy yielded a coefficient of 0.237 with a t-statistic of 2.221 and a p-value of 0.026, which would conventionally be read as significant at the 0.05 level. However, the 95 percent confidence interval for that interaction ranged from -0.012 to 0.326, an interval that includes zero. In strict statistical terms, a confidence interval that crosses zero signals uncertainty about whether the true effect differs from no effect at all, and the authors’ abstract notes that the interaction term did not reach statistical significance on that criterion. This kind of tension between a p-value and a confidence interval is not unusual in moderation analyses, which typically require large samples and substantial measurement precision to detect interaction effects reliably, because interactions explain variance that main effects leave behind.

Where the analysis becomes genuinely compelling is in the conditional effects, which describe how the self-efficacy-to-resilience relationship changes across levels of coping. At low levels of coping strategies, the effect of self-efficacy on resilience was estimated at 0.377. At the mean level of coping, it rose to 0.614, and at high levels of coping it climbed to 0.850. Read together, these conditional estimates sketch a dose-response pattern: the more coping resources a young person commands, the more their confidence in their own abilities appears to translate into resilience. In practical terms, self-efficacy is never wasted, but it appears to work harder in the presence of adaptive coping, as though the two psychological resources operate in tandem rather than in isolation.

Overall, the full model accounted for 48.4 percent of the variance in resilience, an R-squared value that is notably high for research in this domain. Roughly half of the differences in resilience among the participants could be statistically explained by the combination of self-efficacy, coping strategies and their interaction, leaving the remaining variance to factors the model did not include, such as social support, family acceptance, socioeconomic conditions, experiences of discrimination, and other environmental variables. For intervention designers, that R-squared figure is encouraging, because it identifies a compact set of modifiable psychological targets that carry considerable explanatory weight.

The study’s ethical architecture reflects the sensitivity of working with a vulnerable and, in part, underage population. The protocol was approved by the Institutional Ethics Committee at the Jaypee Institute of Information Technology, and the researchers obtained written parental or guardian consent alongside participant assent for those aged 10 to 17, while participants aged 18 to 24 provided their own written informed consent. All participants were told the purpose of the research, that participation was voluntary, that they could withdraw at any time without penalty, and that their responses would remain confidential and anonymous. The authors declared no competing interests and reported that the study received no external funding.

Like all cross-sectional designs, the study captures a snapshot rather than a trajectory, so it cannot establish whether high self-efficacy causes resilience, whether resilient young people simply come to believe in themselves more, or whether unmeasured third factors drive both. Longitudinal and experimental work will be needed to untangle that directionality. The borderline status of the interaction term, flagged by its confidence interval, likewise invites replication with larger and more diverse samples. Even so, the conditional-effects pattern aligns with a broader theoretical consensus that psychological strengths compound rather than merely add together, and it gives clinicians and programme designers a concrete hypothesis to test: that interventions pairing self-efficacy building with explicit coping-skills training should outperform approaches that target either resource alone.

For LGBTQ youth, whose resilience is forged under the persistent pressure of minority stress, that hypothesis carries real stakes. If adaptive coping genuinely amplifies the protective power of self-belief, then school counselling services, community organisations and digital mental health platforms have a clearer blueprint: teach young people not only that they can handle what comes, but how, concretely, to do it. The findings from this 405-person study suggest that the answer to why some marginalised youth bend without breaking may lie less in any single psychological trait than in the way traits work together, and that understanding those interactions may be the most efficient route to helping the young people who need it most.

Subject of Research: The moderating role of coping strategies in the relationship between self-efficacy and resilience among LGBTQ youth

Article Title: Coping strategies moderate the relationship between self efficacy and resilience among LGBTQ youth

Article References: Dua, K., & Bakhru, K. M. (2026). Coping strategies moderate the relationship between self efficacy and resilience among LGBTQ youth. Discover Psychology. https://doi.org/10.1007/s44202-026-00886-2

Image Credits: AI Generated

DOI: 10.1007/s44202-026-00886-2

Keywords: LGBTQ youth, resilience, self-efficacy, coping strategies, moderation analysis, PLS-SEM, mental health, minority stress, psychology, cross-sectional study, SmartPLS, bootstrapping

The stakes are enormous. Fully homomorphic encryption enables end-to-end encrypted data processing in untrusted environments, meaning a hospital could outsource genome analysis or a bank could delegate fraud detection to a cloud provider without exposing any sensitive records. Schemes such as BGV, BFV, GSW, CKKS, and TFHE have matured steadily over the past decade, and libraries like HElib, SEAL, HEAAN, Lattigo, OpenFHE, and PALISADE now implement their underlying arithmetic. But even with these libraries, the survey reports, encrypted computations on CPUs run four to five orders of magnitude slower than their plaintext equivalents. Well-optimized programs can be hundreds of times faster than naive ones, which makes efficient programming not a nicety but a necessity.

The difficulty begins with the extremely restricted set of primitive operations. Homomorphic programs can only perform vector element-wise addition, element-wise multiplication, and rotation shifts over long ciphertext vectors containing thousands to tens of thousands of slots. Operations that are trivial on a CPU, such as accessing a single array element or shuffling a vector, can require dozens or even hundreds of rotations and consume precious computational budget. Sophisticated tricks, like the single-input single-output convolution scheme that needs only kernel-squared rotations instead of a naive avalanche of masks and shifts, can improve efficiency by orders of magnitude, but designing such non-intuitive implementations demands years of cryptographic and numerical expertise.

A second layer of complexity comes from ciphertext maintenance. In the CKKS scheme, which the survey focuses on because of its dominance in machine learning workloads, every multiplication roughly squares a ciphertext’s scaling factor, and Rescale operations must be strategically inserted to keep scales and noise from growing exponentially. Binary operations also impose strict constraints: their operands must sit at the same level and, for additions, share the same scaling factor. Even seemingly obvious strategies backfire. The survey’s authors walk through a simple computation of x squared plus x to show that the always-rescale approach wastes a level, and a ResNet-style example demonstrates that naively bootstrapping ciphertexts the moment they run out of levels can nullify most of bootstrapping’s benefit, an operation that alone can consume over 80 percent of total runtime in deep inference workloads.

Parameter selection forms a third minefield. The polynomial degree N, the initial level budget L, and the small-prime bit width B interact in complicated ways that determine correctness, security, and speed simultaneously. The approximate nature of CKKS makes this worse: unlike exact schemes such as BFV and BGV, CKKS decryption always carries error, and bootstrapping merely restores multiplication capacity without cleaning the noise. The survey cites a striking case where a ResNet-20 inference program achieves 89.53 percent accuracy with a prime width of 33 bits but collapses to 10.87 percent, essentially random guessing, when that width drops to 31 bits.

Fully homomorphic encryption compilers attack these problems by translating ordinary programs, whether tensor code resembling PyTorch or plain scalar programs with loops, into optimized ciphertext programs. The survey describes a typical workflow: parse the input into an internal graph representation, optionally rewrite primitive operations, insert scale management and bootstrapping operations, choose evaluation keys and cryptographic parameters, and finally emit source code targeting a backend library or a standalone executable. Crucially, these compilers are device-agnostic, introducing minimal overhead compared with dedicated hardware accelerators, and they often generate code that outperforms expert hand-tuned implementations.

The heart of the survey is a systematic dissection of scale-management techniques. EVA, the first compiler to prioritize this problem, introduced watermark-based rescaling and eager level matching, delivering a 2.3-times average speedup over earlier approaches. Hecate extended that framework with a new Downscale operation and a search procedure driven by a cost model, gaining a further 27.85 percent on average but at the price of compilation times that can stretch to hundreds of seconds. ELASM added a scale-to-noise-ratio concept with noise-aware waterlines, letting users trade accuracy against latency, cutting output error by tens to hundreds of times at equal latency. The newest entrant, Reserve, replaces search with a backward static analysis that nearly matches Hecate’s performance while compiling in seconds rather than minutes.

Bootstrapping insertion has undergone a parallel revolution. DaCapo uses liveness analysis, bypass edge detection, and dynamic programming to find cost-minimizing insertion points, achieving a 1.21-times speedup over manual implementations on networks up to ResNet-40 and MobileNet. Fhelipe streamlines the same idea with depth boundaries and shortcut edges, and additionally supports hundreds of tensor data layouts, producing an 18.5-times speedup over the earlier layout compiler CHET. HALO specializes in dynamic loops whose trip counts depend on encrypted values, packing loop-carried variables into a single bootstrapped ciphertext and reducing code size by up to 11 times compared with DaCapo. Orion, tailored to private neural inference, models bootstrapping placement as a shortest-path problem on a level digraph, reducing ResNet-20 compilation to under two seconds, an 8.14-times speedup over DaCapo, and trimming inserted bootstraps by 36.2 percent relative to Fhelipe.

For general scalar programs, the survey contrasts synthesis-based and heuristic-based vectorization. Porcupine uses counter-example-guided program synthesis to discover optimal homomorphic kernels, matching or beating expert code with up to 52 percent improvements, but it can only handle roughly a dozen instructions and needed over 609 seconds for a small image filter. Coyote, building on superword-level parallelism, shows why naive vectorization fails when rotations are expensive, yet its own gains remain modest at 0.74 times expert performance. HECO, by contrast, applies a heuristic batching pipeline that transforms imperative code into efficient vectorized form in under a second, delivering three to four orders of magnitude improvement over naive element-by-element translation while scaling to large programs.

The survey closes with a candid assessment of what remains broken. Most compilers still target only the SEAL library, which lacks bootstrapping support and therefore caps program depth; documentation and user experience lag far behind mainstream compiler infrastructure; and parameter selection often relies on crude fixed defaults rather than precise cost models. The authors call for compilers that integrate state-of-the-art homomorphic algorithms, support general-purpose control flow, span multiple schemes from CKKS to TFHE, and even compile across schemes within a single application, an area where only the HEIR project has made an early start. Their conclusion is unambiguous: just as compilers absorbed the manual optimizations of early CPU programming, fully homomorphic encryption compilers are poised to become the primary gateway through which ordinary programmers, not cryptographers, will unlock computation on encrypted data.

Subject of Research: Compilers for fully homomorphic encryption, the tools that automatically convert ordinary programs into optimized code for computing on encrypted data.

Article Title: A survey on fully homomorphic encryption compilers

Article References: Tian, Z., Fan, S., Deng, X., Hou, R., Meng, D., & Zhang, M. (2026). A survey on fully homomorphic encryption compilers. Cybersecurity, 9(1), Article 218. https://doi.org/10.1186/s42400-026-00641-z

Image Credits: AI Generated

DOI: 10.1186/s42400-026-00641-z

Keywords: fully homomorphic encryption, compilers, CKKS scheme, cryptography, cloud computing privacy, bootstrapping, scale management, SIMD vectorization, machine learning, program synthesis, parameter selection, data privacy