Secure multi party computation algorithm based on infinite product series
TL;DR: A secure MPC algorithm for online transactions, where the clients' information, especially joint time and public keys are not clear, emerges the excessively useful response time and ensures the privacy of clients' data.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Proceedings Article
Proceedings of the twentieth annual ACM symposium on Theory of computing
J'anos Simon
- 01 Jan 1988
121
References
How to share a secret
TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
How to generate and exchange secrets
Andrew Chi-Chih Yao
- 27 Oct 1986
TL;DR: A new tool for controlling the knowledge transfer process in cryptographic protocol design is introduced and it is applied to solve a general class of problems which include most of the two-party cryptographic problems in the literature.
4.1K
How to play ANY mental game
Oded Goldreich,Silvio Micali,Avi Wigderson +2 more
- 01 Jan 1987
TL;DR: This work presents a polynomial-time algorithm that, given as a input the description of a game with incomplete information and any number of players, produces a protocol for playing the game that leaks no partial information, provided the majority of the players is honest.
•Proceedings Article
Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract)
Michael Ben-Or,Shafi Goldwasser,Avi Wigderson +2 more
- 01 Jan 1988
TL;DR: The above bounds on t , where t is the number of players in actors, are tight!
2.6K
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Michael Ben-Or,Shafi Goldwasser,Avi Wigderson +2 more
- 01 Jan 1988
TL;DR: In this article, the authors show that every function of n inputs can be efficiently computed by a complete network of n processors in such a way that if no faults occur, no set of size t can be found.
2.4K