<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-22T11:58:27Z</responseDate>
  <request identifier="12109" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:12109</identifier>
        <datestamp>2024-03-06T10:49:32Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Practical Relativistic Zero-Knowledge for NP</dc:title>
          <dc:creator>Crépeau, Claude</dc:creator>
          <dc:creator>Massenet, Arnaud Y.</dc:creator>
          <dc:creator>Salvail, Louis</dc:creator>
          <dc:creator>Stinchcombe, Lucas Shigeru</dc:creator>
          <dc:creator>Yang, Nan</dc:creator>
          <dc:subject>Multi-Prover Interactive Proofs</dc:subject>
          <dc:subject>Relativistic Commitments</dc:subject>
          <dc:subject>3-COLorability</dc:subject>
          <dc:subject>Quantum Entanglement</dc:subject>
          <dc:subject>Non-Locality</dc:subject>
          <dc:description>In a Multi-Prover environment, how little spatial separation is sufficient to assert the validity of an NP statement in Perfect Zero-Knowledge ? We exhibit a set of two novel Zero-Knowledge protocols for the 3-COLorability problem that use two (local) provers or three (entangled) provers and only require exchanging one edge and two bits with two trits per prover. This greatly improves the ability to prove Zero-Knowledge statements on very short distances with very basic communication gear.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Claude Crépeau and Arnaud Y. Massenet and Louis Salvail and Lucas Shigeru Stinchcombe and Nan Yang</dc:contributor>
          <dc:date>2020</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 163, 1st Conference on Information-Theoretic Cryptography (ITC 2020)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.ITC.2020.4</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-121091</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2020.4</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
