Efficient and Privacy-preserving Min and k-th
Min Computations in Mobile Sensing Systems
Protecting the privacy of mobile phone user participants is extremely important for mobile phone sensing applications. In this paper, we study how an aggregator can expeditiously compute the minimum value or the k-th minimum value of all users’data without knowing them. We construct two secure protocols using probabilistic coding schemes and a cipher system that
allows homomorphic bitwise XOR computations for our problems. Following the standard cryptographic security definition in the semi-honest model, we formally prove our protocols’ security. The protocols proposed by us can support time-series data and need not to assume the aggregator is trusted. Moreover, different from existing protocols that are based on secure arithmetic sum computations, our protocols are based on secure bitwise XOR computations, thus are more efficient. In this paper, we study how to protect users’ privacyin a general mobile sensing scenario: an aggregatorwants to periodically learn the minimum value(Min) of all users’ time-series data. Notice that wedo not assume the aggregator is trusted here, so ourtarget is to protect every user’s data against otherusers as well as against the aggregator. Besides theMin, we also study how to securely compute the k-thminimum value (k-th Min) of all users’ data, where kis a positive integer that is no greater than the totalnumber of users.
EXISTING SYSTEM:
As far as we know, there are only a couple of works that study the privacy-preserving Min or k-th Min computation in mobile phone sensing scenarios. In, the authors first propose an additively homomorphic encryption based on a slicing technique, and then use it to run binary searches securely to look for the minimum value. In , the authors propose to let the aggregator traverse the entire space of data from the smallest to the largest till it finds the first data that is owned by at least one user. The security of the above process relies on another additively homomorphic encryption proposed by Castelluccia et al. Despite many differences between them, both works are based on additive-homomorphic encryptions that can securely compute arithmetic sums.
PROPOSED SYSTEM:
In this paper, we propose new Min and k-th Min computation protocols for time-series data based on another technique, XOR-homomorphic encryption.
Our protocols can be used by an untrusted aggregator to securely compute the minimum value or k-th minimum values in the aggregation of all users’ private data. We rigorously define and prove the security of our two protocols in a standard cryptographic model .Our protocols support time-series data well in the sense that they only need to establish the keys for once only. Due
to the fact that we construct our protocols based on secure bitwise XOR computations, rather than based on secure arithmetic sum computations, our protocols are more efficient in general
ANDROID MODULES:
User
1. Upload Encrypted Report
2. Upload Image Report
3. Fetch GPS Location
4. View Published news
Admin
1.View User Registration
2. View and Decrypt news
3. Publish News
User
- Upload Encrypted Report
In the user module there are main 2 modes. First one is reporter module and second one is user mode. News reporters can upload latest news reports to the admin in encrypted format. No one can hack the data without the passsword. User can send the password to admin via email.
- Upload Image Report
In the reporters modes reporters can upload data files and images also. The images can upload with gps location. It will send to the Admin and the Admin publish the report to the public
- Fetch GPS Location
In the reporter mode reporters can upload both data and image to admin with current location address. The admin will also publish the location of the incedent
- View Published news
In the users mode user can view the published news from the Admin side. The reporter sended data can be published from the Admin side. The Admin published report ca view in the user module.
Admin
- View User Registration
User need to register to application before enter to the system. The registered user can view in the Admin side.
- View and Decrypt news
The reporter uploaded news can be view in the Admin side in encrypted format. The password can be send via email. Admin can get password in email and decrypt using the password. The decrypted news can be published to public and every one can view the news.
- Publish News
After the data decryption Admin can publish the data to the public. Admin can publish data report and image report seperatly . Admin upload data include with the location address.
{\displaystyle \ell _{2}={\frac {x-x_{0}}{x_{2}-x_{0}}}\cdot {\frac {x-x_{1}}{x_{2}-x_{1}}}={\frac {x-2}{5-2}}\cdot {\frac {x-4}{5-4}}={\frac {1}{3}}x^{2}-2x+{\frac {8}{3}}\,\!}SYSTEM SPECIFICATION:
HARDWARE REQUIREMENTS:
System : Pentium IV 2.4 GHz.
Hard Disk: 40 GB.
Floppy Drive: 1.44 Mb.
Monitor: 14’ Colour Monitor.
Mouse: Optical Mouse.
Ram: 4 GB.
SOFTWARE REQUIREMENTS:
Operating system : Windows 7 Ultimate.
Coding Language: Java.
Front-End: Android Studio.
Data Base: SQLite Manger,MySQLi.
CONCLUSION:
In this paper, we study how a data aggregator in a mobile phone sensing scenario can efficiently compute the minimum value or the k-th minimum value in all mobile phone users’ private data. Using standard definitions and paradigms in cryptography, we formally prove our protocols are secure and thus are able to protect all users’ private data. Compared with existing protocols that are based on arithmetic sum computation, our protocols are based on bitwise XOR computation and thus are more efficient.