Searchable encryption of image based on secret sharing scheme

Searchable encryption is a technique applied in cryptography that allows specific information in an encrypted content to be searched. The implementation of searchable encryption of images in cloud-based systems with multiple users allows each user to benefit from cloud computing, while the privacy and security of each content of a user cannot be breached by the other users. This is realized by distributing each image using our proposed secret sharing scheme to ensure that only the owner of the encrypted content is able to access it. In this paper, we describe the implementation method and the realization of searchable image encryption in a real-world application.

[1]  Keiichi Iwamura,et al.  Secrecy Computation without Changing Polynomial Degree in Shamir's (K, N) Secret Sharing Scheme , 2016, DCNET.

[2]  Rafail Ostrovsky,et al.  Searchable symmetric encryption: Improved definitions and efficient constructions , 2011, J. Comput. Secur..

[3]  Yuval Ishai,et al.  Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography , 2010, IACR Cryptol. ePrint Arch..

[4]  Craig Gentry,et al.  Fully Homomorphic Encryption over the Integers , 2010, EUROCRYPT.

[5]  Pieter H. Hartel,et al.  Public-Key Encryption with Delegated Search , 2011, ACNS.

[6]  Marcel Keller,et al.  Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits , 2013, ESORICS.

[7]  Ivan Damgård,et al.  Semi-Homomorphic Encryption and Multiparty Computation , 2011, IACR Cryptol. ePrint Arch..

[8]  Ivan Damgård,et al.  Multiparty Computation from Somewhat Homomorphic Encryption , 2012, IACR Cryptol. ePrint Arch..

[9]  Tal Rabin,et al.  Simplified VSS and fast-track multiparty computations with applications to threshold cryptography , 1998, PODC '98.

[10]  Ueli Maurer,et al.  General Secure Multi-party Computation from any Linear Secret-Sharing Scheme , 2000, EUROCRYPT.

[11]  David Chaum,et al.  Multiparty unconditionally secure protocols , 1988, STOC '88.

[12]  Nitesh Saxena,et al.  Password-protected secret sharing , 2011, CCS '11.

[13]  Avi Wigderson,et al.  Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) , 1988, STOC.

[14]  Keiichi Iwamura,et al.  Secrecy Multiplication Based on a (k, n)-Threshold Secret-Sharing Scheme Using Only k Servers , 2015, CSA 2015.

[15]  Charalampos Papamanthou,et al.  Dynamic searchable symmetric encryption , 2012, IACR Cryptol. ePrint Arch..