TY - GEN
T1 - Secure image filtering
AU - Hu, Nan
AU - Cheung, Sen Ching S.
AU - Nguyen, Thinh
PY - 2006
Y1 - 2006
N2 - In today's heterogeneous network environment, there is a growing demand for distrusted parties to jointly execute distributed algorithms on private data whose secrecy needed to be safeguarded. Protocols that support such kind of joint computation without complete sharing of information are called Secure Multiparty Computation (SMC) protocols. Applying SMC protocols in image processing is a challenging problem. Most of the existing SMC protocols are implemented based on cryptographic primitives like Oblivious Transfer that are too computational intensive for pixel-based operations. In this paper, we develop two efficient SMC protocols for distributed linear image filtering between two parties, one party with the original image and the other with the image filter. The first protocol is based on a combination of rank reduction and random permutation. The second one uses random perturbation with the help of a non-colluding third party. Experimental results show that both of them execute significantly faster than oblivious-transfer based techniques.
AB - In today's heterogeneous network environment, there is a growing demand for distrusted parties to jointly execute distributed algorithms on private data whose secrecy needed to be safeguarded. Protocols that support such kind of joint computation without complete sharing of information are called Secure Multiparty Computation (SMC) protocols. Applying SMC protocols in image processing is a challenging problem. Most of the existing SMC protocols are implemented based on cryptographic primitives like Oblivious Transfer that are too computational intensive for pixel-based operations. In this paper, we develop two efficient SMC protocols for distributed linear image filtering between two parties, one party with the original image and the other with the image filter. The first protocol is based on a combination of rank reduction and random permutation. The second one uses random perturbation with the help of a non-colluding third party. Experimental results show that both of them execute significantly faster than oblivious-transfer based techniques.
KW - Communication system security
KW - Cryptography
KW - Distributed algorithms
KW - Image processing
UR - http://www.scopus.com/inward/record.url?scp=78049409143&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78049409143&partnerID=8YFLogxK
U2 - 10.1109/ICIP.2006.312603
DO - 10.1109/ICIP.2006.312603
M3 - Conference contribution
AN - SCOPUS:78049409143
SN - 1424404819
SN - 9781424404810
T3 - Proceedings - International Conference on Image Processing, ICIP
SP - 1553
EP - 1556
BT - 2006 IEEE International Conference on Image Processing, ICIP 2006 - Proceedings
T2 - 2006 IEEE International Conference on Image Processing, ICIP 2006
Y2 - 8 October 2006 through 11 October 2006
ER -