Publication Details

Warning: All material on this website, including papers, text, figures, and graphics is covered by Copyright © unless otherwise stated. You may browse them at your convenience (in the same spirit as you may read a journal or a proceeding article in a public library). Retrieving, copying, or distributing these files, however, may violate the copyright protection law. We recommend that the user abides international law in accessing this directory.
infoAbstract pdfPaper/Preprint bibBibTeX doiDOI plusSupplementary Material slidesSlides posterPoster
[All] → [Schneider2014]
Teaser
 
Teaser

Matthias Schneider and Thomas Schneider. Notes on Non-Interactive Secure Comparison in “Image Feature Extraction in the Encrypted Domain with Privacy-Preserving SIFT”. In ACM Workshop on Information Hiding and Multimedia Security (IH&MMSEC'14), pages 135-140, New York, NY, USA, Jun 2014. ACM.

Protocols for secure comparison are a fundamental building block of many privacy-preserving protocols such as privacy-preserving face recognition or privacy-preserving fingerprint authentication. So far, all existing secure comparison protocols that have been used in practical implementations require interaction. In recent work, Hsu et al. (IEEE Transactions on Image Processing 2012) propose protocols for privacy-preserving computation of the scale-invariant feature transform (SIFT) in the encrypted domain. Their fundamental building block is a new protocol for performing secure comparisons under additively homomorphic encryption that requires no interaction. In this paper we present potential for optimization and shortcomings of their secure comparison protocol. More specifically, we show that it 1) allows optimizations by shifting computation from the server to the user, 2) removes the gain that the user has in outsourcing computations to the server, and most importantly is 3) either computationally intractable for the server or insecure. As alternatives we propose to use either interactive comparison protocols or non-interactive somewhat or fully homomorphic encryption.
@InProceedings{Schneider2014, title = {Notes on Non-Interactive Secure Comparison in ``{I}mage Feature Extraction in the Encrypted Domain with Privacy-Preserving {SIFT}''}, author = {Schneider, Matthias and Schneider, Thomas}, booktitle = {ACM Workshop on Information Hiding and Multimedia Security (IH\&MMSEC'14)}, year = {2014}, address = {New York, NY, USA}, month = {Jun}, pages = {135--140}, publisher = {ACM}, abstract = {Protocols for secure comparison are a fundamental building block of many privacy-preserving protocols such as privacy-preserving face recognition or privacy-preserving fingerprint authentication. So far, all existing secure comparison protocols that have been used in practical implementations require interaction. In recent work, Hsu et al. (IEEE Transactions on Image Processing 2012) propose protocols for privacy-preserving computation of the scale-invariant feature transform (SIFT) in the encrypted domain. Their fundamental building block is a new protocol for performing secure comparisons under additively homomorphic encryption that requires no interaction. In this paper we present potential for optimization and shortcomings of their secure comparison protocol. More specifically, we show that it 1) allows optimizations by shifting computation from the server to the user, 2) removes the gain that the user has in outsourcing computations to the server, and most importantly is 3) either computationally intractable for the server or insecure. As alternatives we propose to use either interactive comparison protocols or non-interactive somewhat or fully homomorphic encryption.}, doi = {10.1145/2600918.2600927}, keywords = {homomorphic encryption, privacy-preserving comparison, signal processing in the encrypted domain} }