<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06080107</id>
  <dt>a</dt>
  <an>06080107</an>
  <augroup>
    <au>Simon, Hans Ulrich</au>
  </augroup>
  <ti>Boolean composition of visual secret sharing schemes.</ti>
  <so>Hirsch, Edward A. (ed.) et al., Computer science -- theory and applications. 7th international computer science symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3--7, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30641-9/pbk). Lecture Notes in Computer Science 7353, 314-325 (2012).</so>
  <py>2012</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-30642-6_29</li>
  </ligroup>
  <abgroup>
    <ab>Summary: In this paper, we analyze the disjunction and the conjunction of two access structures for visual secret sharing schemes. The latter operation, when applied to $k$-out-of-$n$ schemes, leads to schemes with multiple thresholds. We precisely determine the maximum relative contrast for schemes of this type. As in the case of classical schemes with a single threshold, the analysis proceeds by revealing a central relation between the relative contrast in a visual secret sharing scheme and the error-term in a related problem of approximation-theoretic flavor.</ab>
    <rv></rv>
  </abgroup>
</item>