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

It is an important question to find constructions of quantum cryptographicprotocols which rely on weaker computational assumptions than classicalprotocols. Recently, it has been shown that oblivious transfer and multi-partycomputation can be constructed from one-way functions, whereas this isimpossible in the classical setting in a black-box way. In this work, we studythe question of building quantum public-key encryption schemes from one-wayfunctions and even weaker assumptions. Firstly, we revisit the definition ofIND-CPA security to this setting. Then, we propose three schemes for quantumpublic-key encryption from one-way functions, pseudorandom function-like stateswith proof of deletion and pseudorandom function-like states, respectively.

Encryption with Quantum Public Keys