{
"@context": "http://schema.org",
"@type": "ScholarlyArticle",
"@id": "https://doi.org/10.4230/lipics.fsttcs.2008.1744",
"identifier": {
"@type": "PropertyValue",
"propertyID": "DOI",
"value": "https://doi.org/10.4230/lipics.fsttcs.2008.1744"
},
"url": "http://drops.dagstuhl.de/opus/volltexte/2008/1744/",
"additionalType": "ConferencePaper",
"name": "Increasing the power of the verifier in Quantum Zero Knowledge",
"author": [
{
"name": "Andre Chailloux",
"givenName": "Andre",
"familyName": "Chailloux",
"@type": "Person"
},
{
"name": "Iordanis Kerenidis",
"givenName": "Iordanis",
"familyName": "Kerenidis",
"@type": "Person"
}
],
"editor": {
"name": "Marc Herbstritt",
"givenName": "Marc",
"familyName": "Herbstritt",
"contributorType": "Editor",
"@type": "Person"
},
"description": "In quantum zero knowledge, the assumption was made that the\nverifier is only using unitary operations. Under this assumption,\nmany nice properties have been shown about quantum zero\nknowledge, including the fact that Honest-Verifier Quantum\nStatistical Zero Knowledge ($HVQSZK$) is equal to\nCheating-Verifier Quantum Statistical Zero Knowledge ($QSZK$)\n(see ~\\cite{Wat02,Wat06}).\n\nIn this paper, we study what happens when we allow an honest\nverifier to flip some coins in addition to using unitary\noperations. Flipping a coin is a non-unitary operation but\ndoesn\\'t seem at first to enhance the cheating possibilities of\nthe verifier since a classical honest verifier can flip coins. In\nthis setting, we show an unexpected result: any classical\nInteractive Proof has an Honest-Verifier Quantum Statistical Zero\nKnowledge proof with coins. Note that in the classical case,\nhonest verifier $SZK$ is no more powerful than $SZK$ and hence it\nis not believed to contain even $NP$. On the other hand, in the\ncase of cheating verifiers, we show that Quantum Statistical Zero\nKnowledge where the verifier applies any non-unitary operation is\nequal to Quantum Zero-Knowledge where the verifier uses only\nunitaries.\n\nOne can think of our results in two complementary ways. If we\nwould like to use the honest verifier model as a means to study\nthe general model by taking advantage of their equivalence, then\nit is imperative to use the unitary definition without coins,\nsince with the general one this equivalence is most probably not\ntrue. On the other hand, if we would like to use quantum zero\nknowledge protocols in a cryptographic scenario where the\nhonest-but-curious model is sufficient, then adding the unitary\nconstraint severely decreases the power of quantum zero knowledge\nprotocols.",
"keywords": "Computer Science, 000 Computer science, knowledge, general works",
"inLanguage": "eng",
"contentSize": "12 pages",
"encodingFormat": "application/pdf",
"datePublished": "2008",
"schemaVersion": "http://datacite.org/schema/kernel-2.1",
"publisher": {
"@type": "Organization",
"name": "Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany"
}
}