Michael Brenner, J. Wiebelitz, Gabriele von Voigt, Matthew Smith
{"title":"Secret program execution in the cloud applying homomorphic encryption","authors":"Michael Brenner, J. Wiebelitz, Gabriele von Voigt, Matthew Smith","doi":"10.1109/DEST.2011.5936608","DOIUrl":null,"url":null,"abstract":"A growing number of compute and data storage jobs is performed on remote resources. In a cloud environment the customer can't be sure where a particular job is physically executed and thus cannot rely on the security and confidentiality of the remote resource. A solution for this problem is operating on encrypted functions and encrypted data. This enables a customer to generate a program that can be executed by a third party, without revealing the underlying algorithm or the processed data. This helps securing applications and data in a distributed digital ecosystem. We present a method to compute a secret program on an untrusted resource using fully homomorphic encrypted circuits. We sketch an algebraic homomorphism as a cryptographic foundation and define a sample system architecture for which we provide a software implementation. Our concept solves the problems of encrypted storage access with encrypted addresses and encrypted branching: in contrast to other approaches, like static one-pass circuit simulations, our system supports dynamic parameters and non-linear programs, that render branch-decisions at runtime and cannot be represented in a circuit with hard-wired in-circuit parameters and data. Our implementation comprises the runtime environment for an encrypted program and an assembler to generate the encrypted machine code.","PeriodicalId":297420,"journal":{"name":"5th IEEE International Conference on Digital Ecosystems and Technologies (IEEE DEST 2011)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"84","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"5th IEEE International Conference on Digital Ecosystems and Technologies (IEEE DEST 2011)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DEST.2011.5936608","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 84
Abstract
A growing number of compute and data storage jobs is performed on remote resources. In a cloud environment the customer can't be sure where a particular job is physically executed and thus cannot rely on the security and confidentiality of the remote resource. A solution for this problem is operating on encrypted functions and encrypted data. This enables a customer to generate a program that can be executed by a third party, without revealing the underlying algorithm or the processed data. This helps securing applications and data in a distributed digital ecosystem. We present a method to compute a secret program on an untrusted resource using fully homomorphic encrypted circuits. We sketch an algebraic homomorphism as a cryptographic foundation and define a sample system architecture for which we provide a software implementation. Our concept solves the problems of encrypted storage access with encrypted addresses and encrypted branching: in contrast to other approaches, like static one-pass circuit simulations, our system supports dynamic parameters and non-linear programs, that render branch-decisions at runtime and cannot be represented in a circuit with hard-wired in-circuit parameters and data. Our implementation comprises the runtime environment for an encrypted program and an assembler to generate the encrypted machine code.