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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Secure multiparty computation (smc) is a research focus in the international cryptographic community, while secure multiparty geometry computation is an important field of smc. In this paper, we study an important secure computational geometric problem, that is, to privately determine the location relation between two rectangles. The existing protocols for this problem are of low efficiency. To efficiently solve this problem, we use sorting technique to design a protocol for privately determining the location relation between two rectangles. Finally, we analyze the theoretical efficiency to show that our protocol is efficient.

An Efficient Protocol for Privately Determining the Relationship between Two Rectangles