Sample or Random Security - A Security Model for Segment-Based Visual Cryptography

In some scenarios, especially when visual cryptography is used, the attacker has no access to an encryption oracle, and thus is not able to mount chosen-plaintext attacks. Based on the notion of real-or-random security under chosen-plaintext attacks (ROR-CPA) given by Bellare et al., we propose the notion of sample-or-random security under ciphertext-only attacks (SOR-CO). We prove that the notion of SOR-CO is fundamentally weaker than the notion of ROR-CPA security and demonstrate the usefulness of our notion by applying it to segment-based visual cryptography. An additional contribution of this paper is the construction of a new segment-based visual encryption scheme with noise based on work by Doberitz. To our knowledge, this is the first visual encryption scheme which makes use of noise. We conjecture that it is secure in the sense of SOR-CO security if the key is not used too often and if the encryption schemes security parameters are chosen accordingly.

@InProceedings{Pape14fc,
  author    = {Sebastian Pape},
  title     = {Sample or Random Security - {A} Security Model for Segment-Based Visual Cryptography},
  booktitle = {Financial Cryptography and Data Security - 18th International Conference, {FC} 2014, Christ Church, Barbados, March 3-7, 2014, Revised Selected Papers},
  year      = {2014},
  pages     = {291--303},
  doi       = {10.1007/978-3-662-45472-5_19},
  keywords  = {crypto,select},
  url       = {https://link.springer.com/chapter/10.1007%2F978-3-662-45472-5_19},
}