Oblivious transfer from any non-trivial elastic noisy channel via secret key agreement

4Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A (γ, δ)-elastic channel is a binary symmetric channel between a sender and a receiver where the error rate of an honest receiver is δ while the error rate of a dishonest receiver lies within the interval [γ, δ]. In this paper, we show that from any non-trivial elastic channel (i.e., 0 < γ < δ < ½) we can implement oblivious transfer with information-theoretic security. This was previously (Khurana et al., Eurocrypt 2016) only known for a subset of these parameters. Our technique relies on a new way to exploit protocols for information-theoretic key agreement from noisy channels. We also show that informationtheoretically secure commitments where the receiver commits follow from any non-trivial elastic channel.

Cite

CITATION STYLE

APA

Cascudo, I., Damgård, I., Lacerda, F., & Ranellucci, S. (2016). Oblivious transfer from any non-trivial elastic noisy channel via secret key agreement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9985 LNCS, pp. 204–234). Springer Verlag. https://doi.org/10.1007/978-3-662-53641-4_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free