Provably Secure Data Hiding and Tamper Resistance for a Simple Loop Program

Rida Bazzi, Kasim Candan, Raphael Badin, Aziz Fajri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

We study the problem of computing with encrypted data. We propose a hiding scheme that allows a client to execute a simple loop program with real or complex inputs securely on a server. This is the first hiding scheme that we are aware of that applies to real and complex data. The scheme allows the client to efficiently determine with high probability whether the results returned by the server are correct. The scheme we propose uses new techniques that have not been used previously in this context.

Original languageEnglish (US)
Title of host publicationProceedings of SPIE - The International Society for Optical Engineering
EditorsE.M. Carapezza
Pages517-527
Number of pages11
Volume5071
DOIs
StatePublished - 2003
EventSensors, and Command, Control, Communications, and Intelligence (C31) Technologies for Homeland Defense and Law Enforcement II - Orlando, FL, United States
Duration: Apr 21 2003Apr 25 2003

Other

OtherSensors, and Command, Control, Communications, and Intelligence (C31) Technologies for Homeland Defense and Law Enforcement II
CountryUnited States
CityOrlando, FL
Period4/21/034/25/03

    Fingerprint

Keywords

  • Encryption
  • Hiding
  • Security
  • Tamper resistance

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Condensed Matter Physics

Cite this

Bazzi, R., Candan, K., Badin, R., & Fajri, A. (2003). Provably Secure Data Hiding and Tamper Resistance for a Simple Loop Program. In E. M. Carapezza (Ed.), Proceedings of SPIE - The International Society for Optical Engineering (Vol. 5071, pp. 517-527) https://doi.org/10.1117/12.486836