The week's pick
Random Articles
Reseach Article
Review on HEROIC Framework: Homomorphically EncRypted One Instruction Computer
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 131 - Number 17 |
| Year of Publication: 2015 |
| Authors: Sreelekshmi S., Devi Dath |
10.5120/ijca2015907647
|
Sreelekshmi S., Devi Dath . Review on HEROIC Framework: Homomorphically EncRypted One Instruction Computer. International Journal of Computer Applications. 131, 17 ( December 2015), 7-9. DOI=10.5120/ijca2015907647
Abstract
Outsourcing to cloud brings a new face to computation. In outsourcing, maintenance cost as well as upgrade cost is low to zero. Outsourcing’s features are held back by data privacy concerns. In cloud, privacy of data can be assured by encryption schemes. Common encryption schemes will decrypt the data before processing and re encrypt data after processing, key sharing required. The sensitive data inside the processor are vulnerable to eavesdropping and other attacks.HEROIC Framework (Homomorphically EncRypted One Instruction Computer),a secure architecture for processing data in encrypted form is introduced as a promising solution to the security and privacy concerns. It is single instruction architecture which rules out the need for storing private key inside the processor. In this framework a variant of Paillier encryption scheme is used for homomorphically encrypting both data and instruction.
References
- Wikipedia,https://en.wikipedia.org/wiki/Outsourcingcomputing
- C. Fontaine and F. Galand, ”A survey of homomorphic encryption for nonspecialists,” EURASIP Journal on Information Security, vol. 2007, no. 1, pp. 26-35, 2007.
- Nektarios Georgios Tsoutsos, Michail Maniatakos ”HEROIC: Homomorphically EncRypted One Instruction Computer” 2014
- G. T. Becker, F. Regazzoni, C. Paar, and W. P. Burleson, ”Stealthy dopant-level hardware trojans,” in Cryptographic Hardware and Embedded Systems Workshop, 2013, pp. 197- 214.
- A. Teller, ”Turing completeness in the language of genetic programming with indexed memory,” in Proc. 1st IEEE Conf. Evol. Comput., Orlando, FL, USA, 1994, pp. 136-141.
- C. Bohm and G. Jacopini, ”Flow diagrams, Turing machines and languages with only two formation rules,” Commun. ACM, vol. 9, no. 5, pp. 366-371, 1966.
- O. Mazonka and A. Kolodin, ”A simple multi-processor computer based on subleq,” arXiv preprint arXiv:1106.2593, 2011
- R. L. Rivest, A. Shamir, and L. Adleman, ”A method for obtaining digital signatures and public-key cryptosystems,” Commun. ACM, vol. 21, no. 2, pp. 120-126, 1978.
- HSR Hochschule fr Technik Rapperswil, Homomorphic Tallying with Paillier Cryptosystem, Seminar on e Voting
- X. He, M.-O. Pun, and C.-C. Kuo, ”Secure and efficient cryptosystem for smart grid using homomorphic encryption,” in Innovative Smart Grid Technologies, 2012, pp. 1-8.
Index Terms
Keywords