STAR TOPOLOGICAL SECURE SUM PROTOCOL WITH TRUSTED THIRD PARTY
Jyotirmayee Rautaray, Raghvendra Kumar
Abstract
Jyotirmayee Rautaray, Raghvendra Kumar
Abstract
Secure Multiparty Computation allows all parties to compute the common result of their individual data without disclosing their data to others party. Secure sum computation is one of the important tools of the Secure Multiparty Computation. In Secure Multiparty Computation lot of reputed researchers give their protocols, researchers show their interest. In this paper we proposed a new secure multi party computation protocol which is combination of both real and ideal model as well as the star topology for providing the highest privacy to the database with the zero percentage of data leakage and also the complexity of this protocol is very lesser as compare to other protocol and this protocol is useful for multi party computation. The complexity of this protocol is AE (n).
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Secure Multiparty Computation allows all parties to compute the common result of their individual data without disclosing their data to others party. Secure sum computation is one of the important tools of the Secure Multiparty Computation. In Secure Multiparty Computation lot of reputed researchers give their protocols, researchers show their interest. In this paper we proposed a new secure multi party computation protocol which is combination of both real and ideal model as well as the star topology for providing the highest privacy to the database with the zero percentage of data leakage and also the complexity of this protocol is very lesser as compare to other protocol and this protocol is useful for multi party computation. The complexity of this protocol is AE (n).
Key concepts: Secure two-party computation, Secure multi-party computation, Computer science, Computation, Protocol (science), Trusted third party, Universal composability, Ideal (ethics)