All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Adaptive versus non-adaptive strategies in the quantum setting with applications

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F16%3A00088206" target="_blank" >RIV/00216224:14330/16:00088206 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-662-53015-3_2" target="_blank" >http://dx.doi.org/10.1007/978-3-662-53015-3_2</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-662-53015-3_2" target="_blank" >10.1007/978-3-662-53015-3_2</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Adaptive versus non-adaptive strategies in the quantum setting with applications

  • Original language description

    We prove a general relation between adaptive and non-adaptive strategies in the quantum setting, i.e., between strategies where the adversary can or cannot adaptively base its action on some auxiliary quantum side information. Our relation holds in a very general setting, and is applicable as long as we can control the bit-size of the side information, or, more generally, its “information content”. Since adaptivity is notoriously difficult to handle in the analysis of (quantum) cryptographic protocols, this gives us a very powerful tool: as long as we have enough control over the side information, it is sufficient to restrict ourselves to non-adaptive attacks. We demonstrate the usefulness of this methodology with two examples. The first is a quantum bit commitment scheme based on 1-bit cut-and-choose.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    BD - Information theory

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GAP202%2F12%2F1142" target="_blank" >GAP202/12/1142: Weak Sources of Entanglement and Randomness</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2016

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of CRYPTO 2016

  • ISBN

    9783662530146

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    27

  • Pages from-to

    33-59

  • Publisher name

    Springer Berlin Heidelberg

  • Place of publication

    Santa Barbara, CA

  • Event location

    Santa Barbara, CA

  • Event date

    Jan 1, 2016

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article