English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Secure sum computation of private data inputs is an interesting example ofSecure Multiparty Computation (SMC) which has attracted many researchers todevise secure protocols with lower probability of data leakage. In this paper,we provide a novel protocol to compute the sum of individual data inputs withzero probability of data leakage when two neighbor parties collude to know thedata of a middle party. We break the data block of each party into number ofsegments and redistribute the segments among parties before the computation.These entire steps create a scenario in which it becomes impossible for semihonest parties to know the private data of some other party.

A Distributed k-Secure Sum Protocol for Secure Multi-Party Computations