Paper 2016/218

Semantic Security and Key-Privacy With Random Split of St-Gen Codes

Danilo Gligoroski and Simona Samardjiska

Abstract

Recently we have defined Staircase-Generator codes (St-Gen codes) and their variant with a random split of the generator matrix of the codes. One unique property of these codes is that they work with arbitrary error sets. In this paper we give a brief overview of St-Gen codes and the list decoding algorithm for their decoding. We also analyze the semantic security against chosen plaintext attack (IND-CPA) and key-privacy i.e. indistinguishability of public keys under chosen plaintext attack (IK-CPA) of the encryption scheme with random split of St-Gen codes. In a similar manner as it was done by Nojima et al., and later by Yamakawa et al., we show that padding the plaintext with a random bit-string provides IND-CPA and IK-CPA in the standard model. The difference with McEliece scheme is that with our scheme the length of the padded random string is significantly shorter.

Note: Minor typos are corrected

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
Public Key CryptographyCode Based CryptosystemsSemantic SecurityKey-Privacy
Contact author(s)
danilog @ item ntnu no
History
2016-03-18: revised
2016-02-29: received
See all versions
Short URL
https://ia.cr/2016/218
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2016/218,
      author = {Danilo Gligoroski and Simona Samardjiska},
      title = {Semantic Security and Key-Privacy With Random Split of St-Gen Codes},
      howpublished = {Cryptology ePrint Archive, Paper 2016/218},
      year = {2016},
      note = {\url{https://eprint.iacr.org/2016/218}},
      url = {https://eprint.iacr.org/2016/218}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.