Homomorphic Encryption: The holy grail in real life

Homomorphic Encryption (HE) is considered as the holy grail of cryptography  for performing secure computations  in untrusted environments. Since its conceptualization, HE suffers from two main limitations: performance and algorithm translation challenges in homomorphic domain. To handle these limitations research in homomorphic encryption has progressed in two major directions. Starting from partial or limited homomorphic schemes, the first direction explores the plausible construction of efficient encryption schemes which is fully  homomorphic in nature to support theoretically arbitrary and unbounded numbers of encrypted computations. The second direction further explores how far end to end implementations of  encrypted real world algorithms  are feasible considering our existing underlying processors are unencrypted in nature. Further, fully HE schemes are both performance and memory hungry.  With all these bottlenecks it is interesting to investigate the recent and possible future applications where this cryptographic holy grail can be adapted to use ‘data for public good’ ensuring  data confidentiality for critical resources.