<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">475827163</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180406123831.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170329e20000901xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s001450010011</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s001450010011</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Short Non-Interactive Cryptographic Proofs</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Joan Boyar, Ivan Damgård, René Peralta]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Abstract. : We show how to produce short proofs of theorems such that a distrusting Verifier can be convinced that the theorem is true yet obtains no information about the proof itself. We assume the theorem is represented by a boolean circuit, of size m gates, which is satisfiable if and only if the theorem holds. We use bit commitments of size k and bound the probability of false proofs going undetected by 2 -r . We obtain non-interactive zero-knowledge proofs of size O(mk( log m +r)) bits. In the random oracle model, we obtain non-interactive proofs of size O(m( log m+r) + rk) bits. By simulating a random oracle, we obtain non-interactive proofs which are short enough to be used in practice. We call the latter proofs 's'sdiscreet.''</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">International Association for Criptologic Rese, 2000</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Key words. Cryptographic proofs, Non-interactive proofs, Discreet proofs, Circuit complexity, Multiplicative complexity</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Boyar</subfield>
   <subfield code="D">Joan</subfield>
   <subfield code="u">Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark joan@imada.sdu.dk, DK</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Damgård</subfield>
   <subfield code="D">Ivan</subfield>
   <subfield code="u">Department of Computer Science, BRICS, Aarhus University, DC-8000 Aarhus C, Denmark ivan@daimi.au.dk, DK</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Peralta</subfield>
   <subfield code="D">René</subfield>
   <subfield code="u">Department of Computer Science, Yale University, New Haven, CT 06520-8285, U.S.A. peralta-rene@cs.yale.edu, UK</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Journal of Cryptology</subfield>
   <subfield code="d">Springer Berlin Heidelberg</subfield>
   <subfield code="g">13/4(2000-09-01), 449-472</subfield>
   <subfield code="x">0933-2790</subfield>
   <subfield code="q">13:4&lt;449</subfield>
   <subfield code="1">2000</subfield>
   <subfield code="2">13</subfield>
   <subfield code="o">145</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s001450010011</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s001450010011</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Boyar</subfield>
   <subfield code="D">Joan</subfield>
   <subfield code="u">Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark joan@imada.sdu.dk, DK</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Damgård</subfield>
   <subfield code="D">Ivan</subfield>
   <subfield code="u">Department of Computer Science, BRICS, Aarhus University, DC-8000 Aarhus C, Denmark ivan@daimi.au.dk, DK</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Peralta</subfield>
   <subfield code="D">René</subfield>
   <subfield code="u">Department of Computer Science, Yale University, New Haven, CT 06520-8285, U.S.A. peralta-rene@cs.yale.edu, UK</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Journal of Cryptology</subfield>
   <subfield code="d">Springer Berlin Heidelberg</subfield>
   <subfield code="g">13/4(2000-09-01), 449-472</subfield>
   <subfield code="x">0933-2790</subfield>
   <subfield code="q">13:4&lt;449</subfield>
   <subfield code="1">2000</subfield>
   <subfield code="2">13</subfield>
   <subfield code="o">145</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
