STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Communications of the ACM
The Decision Diffie-Hellman Problem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Fairplay—a secure two-party computation system
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Privacy-preserving regression algorithms
SMO'07 Proceedings of the 7th WSEAS International Conference on Simulation, Modelling and Optimization
Cryptanalysis on an Elgamal-like cryptosystem for encrypting large messages
AIC'06 Proceedings of the 6th WSEAS International Conference on Applied Informatics and Communications
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
FairplayMP: a system for secure multi-party computation
Proceedings of the 15th ACM conference on Computer and communications security
Secure Multiparty Computation Goes Live
Financial Cryptography and Data Security
Efficient receipt-free voting based on homomorphic encryption
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
A new multi party aggregation algorithm using infinite product series
ACE'10 Proceedings of the 9th WSEAS international conference on Applications of computer engineering
Privacy-preserving Bayesian network parameter learning
CIMMACS'05 Proceedings of the 4th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics
A practical implementation of secure auctions based on multiparty integer computation
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
Efficiency tradeoffs for malicious two-party computation
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
| Hi-index | 0.00 |
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.