Secure multi party computation algorithm based on infinite product series
Nowadays, data mining has been extremely interested; because of its ability to give the companies a better view for strategic decisions. In case of, contribution of several companies for a shared data mining, there is a big problem: confidentially of data. Here, the companies are avoided passing the...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
World Scientific and Engineering Academy and Society (WSEAS)
2010
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/26662/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Nowadays, data mining has been extremely interested; because of its ability to give the companies a better view for strategic decisions. In case of, contribution of several companies for a shared data mining, there is a big problem: confidentially of data. Here, the companies are avoided passing their data to the miner directly. The best solution is applying a cryptographic tools named as Multi Party Computation (MPC). In this paper, we represent a secure MPC algorithm for online transactions, where the clients' information, especially joint time and public keys are not clear. The algorithm emerges the excessively useful response time. The mathematic demonstration also ensures the privacy of clients' data. |
|---|