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/

Zendy Plus

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

Zendy Tools

Zendy Open

Two-party secure function evaluation (SFE) has become significantly morefeasible, even on resource-constrained devices, because of advances inserver-aided computation systems. However, there are still bottlenecks,particularly in the input validation stage of a computation. Moreover, SFEresearch has not yet devoted sufficient attention to the important problem ofretaining state after a computation has been performed so that expensiveprocessing does not have to be repeated if a similar computation is done again.This paper presents PartialGC, an SFE system that allows the reuse of encryptedvalues generated during a garbled-circuit computation. We show that usingPartialGC can reduce computation time by as much as 96% and bandwidth by asmuch as 98% in comparison with previous outsourcing schemes for securecomputation. We demonstrate the feasibility of our approach with two sets ofexperiments, one in which the garbled circuit is evaluated on a mobile deviceand one in which it is evaluated on a server. We also use PartialGC to build aprivacy-preserving "friend finder" application for Android. The reuse ofprevious inputs to allow stateful evaluation represents a new way of looking atSFE and further reduces computational barriers.

Reuse It Or Lose It: More Efficient Secure Computation Through Reuse of Encrypted Values