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

While the amount of data produced and accumulated continues to advance atunprecedented rates, protection and concealment of data increase its prominenceas a field of scientific study that requires more action. It is essential toprotect privacy-sensitive data at every phase; at rest, at run, and whilecomputations are executed on data. The zero-knowledge proof (ZKP) schemes are acryptographic tool toward this aim. ZKP allows a party to securely ensure thedata's authenticity and precision without revealing confidential orprivacy-sensitive information during communication or computation. The power ofzero-knowledge protocols is based on intractable problems. There is arequirement to design more secure and efficient zero-knowledge proofs. Thisdemand raises the necessity of determining appropriate intractable problems todevelop novel ZKP schemes. In this paper, we present a brief outline of ZKPschemes, the connection of these structures to group-theoretic intractableproblems, and annotate a list of intractable problems in group theory that canbe employed to devise new ZKP schemes.

Intractable Group-theoretic Problems Around Zero-knowledge Proofs