Security notions for information theoretically secure encryptions

@article{Iwamoto2011SecurityNF,
  title={Security notions for information theoretically secure encryptions},
  author={Mitsugu Iwamoto and Kazuo Ohta},
  journal={2011 IEEE International Symposium on Information Theory Proceedings},
  year={2011},
  pages={1777-1781}
}
This paper is concerned with several security notions for information theoretically secure encryptions defined by the variational (statistical) distance. To ensure the perfect secrecy (PS), the mutual information is often used to evaluate the statistical independence between a message and a cryptogram. On the other hand, in order to recognize the information theoretically secure encryptions and computationally secure ones comprehensively, it is necessary to reconsider the notion of PS in terms… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 1 time. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

How to fool an unbounded adversary with a short key

IEEE Trans. Information Theory • 2006
View 6 Excerpts
Highly Influenced

Communication theory of secrecy systems ,

C. E. Shannon
Bell Tech. J., • 1949
View 7 Excerpts
Highly Influenced

Probabilistic Encryption

J. Comput. Syst. Sci. • 1984
View 1 Excerpt

Vernam, “Cipher printing telegraph systems for sec ret wire and radio telegraphic communications,

G S.
J. of American Institute for Electrical Engineering, • 1926
View 1 Excerpt

How to foil an unbounded adversary with a short key

H. Delfs, H. Knebel
IEEE Trans . Iriformation Theory

Similar Papers

Loading similar papers…