aqora

Information theoretic secure oblivious polynomial evaluation: Model, bounds and constructions

J. Mueller-Quade, A Otsuka, G Hanaoka +3 more

Jan 1, 20040 citations

Formalization of information-theoretic security for key agreement, revisited

Junji Shikata

In this paper, we investigate relationships between the following formalizations of information-theoretic security for key agreement protocols which may have agreement-errors: formalizations extended (or relaxed) from Shannon's perfect secrecy by using mutual information and statistical distance; and the ones of composable security by Maurer et al. and Canetti. Then, we explicitly show that those are essentially equivalent. We also derive lower bounds on the adversary's (or distinguisher's) advantage and the size of a correlated randomness resource required under all of the above formalizations at once through our relationships. In addition, we observe impossibility results which easily follow from the lower bounds.In this paper, we investigate relationships between the following formalizations of information-theoretic security for key agreement protocols which may have agreement-errors: formalizations extended (or relaxed) from Shannon's perfect secrecy by using mutual information and statistical distance; and the ones of composable security by Maurer et al. and Canetti. Then, we explicitly show that those are essentially equivalent. We also derive lower bounds on the adversary's (or distinguisher's) advantage and the size of a correlated randomness resource required under all of the above formalizations at once through our relationships. In addition, we observe impossibility results which easily follow from the lower bounds.

IEEE International Symposium on Information Theory (ISIT)Jul 1, 20137 citations

Information Theoretic Security

Kaoru Kurosawa

Lecture notes in computer scienceJan 1, 20104 citations

Information Theoretic Security

Hutchison, David, Gerhard Weikum, Moshe Y. Vardi +13 more

Lecture notes in computer scienceJan 1, 200818 citations

Impossibility bounds for secure computing

Himanshu Tyagi, Shun Watanabe

We derive impossibility (converse) bounds for the efficiency of implementing information theoretically secure oblivious transfer and bit commitment using correlated observations. Our approach is based on relating these problems to that of testing if the observations of the parties are conditionally independent given the adversary's observation. The resulting bounds strengthen and improve upon several previously known results.

IEEE International Symposium on Information Theory (ISIT)Jun 1, 20150 citations

Information Theoretic Security

Lecture notes in computer scienceJan 1, 2009135 citations

Information Theoretic Security Based on Bounded Observability

Related papers

Information Theoretic Security Based on Bounded Observability

Related papers