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

We consider two-party quantum protocols starting with a transmission of somerandom BB84 qubits followed by classical messages. We show a general "compiler"improving the security of such protocols: if the original protocol is secureagainst an "almost honest" adversary, then the compiled protocol is secureagainst an arbitrary computationally bounded (quantum) adversary. Thecompilation preserves the number of qubits sent and the number of rounds up toa constant factor. The compiler also preserves security in thebounded-quantum-storage model (BQSM), so if the original protocol wasBQSM-secure, the compiled protocol can only be broken by an adversary who haslarge quantum memory and large computing power. This is in contrast to knownBQSM-secure protocols, where security breaks down completely if the adversaryhas larger quantum memory than expected. We show how our technique can beapplied to quantum identification and oblivious transfer protocols.

Improving the Security of Quantum Protocols via Commit-and-Open