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

Relativistic cryptography is a proposal for achieving unconditional securitythat exploits the fact that no information carrier can travel faster than thespeed of light. It is based on space-time constraints but doesn't requirequantum hardware. Nevertheless, it was unclear whether this proposal isrealistic or not. Recently, Alikhani et al. [ABC+21] performed animplementation of a relativistic zero-knowledge for NP. Their implementedscheme shows the feasibility of relativistic cryptography but it is only secureagainst classical adversaries. In this work, we present a new relativisticprotocol for NP which is secure against quantum adversaries and which isefficient enough so that it can be implemented on everyday laptops and internetconnections. We use Stern's zero-knowledge scheme for the Syndrome Decodingproblem, which was used before in post-quantum cryptography. The main technicalcontribution is a generalization of the consecutive measurement framework of[CL17] to prove the security of our scheme against quantum adversaries, and weperform an implementation that demonstrates the feasibility and efficiency ofour proposed scheme.

Relativistic zero-knowledge protocol for NP over the internet unconditionally secure against quantum adversaries