IEEE International Symposium on Information Theory (ISIT)

On unconditionally secure oblivious transfer from continuous channels

Motohiko Isaka

Published Jun 1, 2010• 4 citations

Abstract

In this paper, we consider an information theoretically secure cryptographic primitive known as oblivious transfer based on noisy channels. We present a protocol and two approaches to base the primitive on much wider class of signal sets and continuous channels than the existing results on the Gaussian channel. We also evaluate the associated information theoretic efficiency of the protocol for some cases of interest.

DOI: 10.1109/isit.2010.5513725

Related papers

Efficient oblivious transfer from algebraic signaling over the Gaussian channel

Motohiko Isaka

We study the use of the additive white Gaussian noise channel to achieve oblivious transfer which is an important cryptographic primitive in multiparty computation. An efficient protocol for unconditionally secure oblivious transfer is presented. We show that channel input alphabets with a certain algebraic structure and their partitions are useful in achieving privacy for players and ensuring high efficiency of the protocol. Security and information theoretic efficiency of the protocol is investigated.

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

Oblivious Transfer from the Additive White Gaussian Noise Channel

Motohiko Isaka

We consider the use of the additive white Gaussian noise channel to achieve information theoretically secure oblivious transfer. A protocol for this primitive that ensures the correctness and privacy for players is presented together with the signal design. We also study the information theoretic efficiency of the protocol, and some more practical issues where the parameter of the channel is unknown to the players.

IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesJan 1, 20104 citations

Cryptographic primitives based on discrete-input AWGN channels

Motohiko Isaka, Y. Shimizu

Two cryptographic primitives, commitment and oblivious transfer, are devised based on the additive white Gaussian noise channel and discrete input alphabet. We present protocols and analyze the security and information theoretic efficiencies.

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

An unconditionally secure protocol based on lattices over the Gaussian channel

Motohiko Isaka

We propose to achieve an information theoretically secure oblivious transfer using lattice partitions based on the additive white Gaussian noise channel. A protocol is presented and the security and efficiency is discussed.

International Symposium on Information Theory and its ApplicationsDec 1, 20081 citation

Unconditional secure cooperation on real-world networks : the case of oblivious transfer

Paolo Palmieri

Historically, cryptography was created and used to deliver messages between people in such a way that only the intended receiver would be able to read them. The two persons communicating trusted each other, but not the rest of the world - for instance, not the message bearer. But what happens if we assume instead that even the receiver of a message may not be trusted by the sender, while both still have an interest in communicating? This problem is addressed by secure multi-party computation, that studies communication and shared computation between mutually distrusting parties. In a world where most of the communication happens over the Internet, and where an ever-increasing amount of computation is outsourced, for example to the cloud, multi-party computation is a subject of crucial importance. However, unconditionally secure multi-party protocols have never found practical application: the lack of realistic noisy channel models, that are required to achieve security against computationally unbounded adversaries, prevents implementation over real-world, standard communication protocols.\n\nIn this thesis, we study the properties and characteristics of noisy channels, and we introduce new models based on real-world error sources that have never been studied in this context, such as delays. On the contrary, previous works mostly focused on theoretical noisy channels that have little in common with the reality of network communication. We show that the models we propose are suitable for multi-party computation by building on each of them a protocol for oblivious transfer, a fundamental cryptographic primitive that implies any secure computation. Thanks to the realism of our noisy channels, we are able to provide the first working implementation of unconditionally secure oblivious transfer over both wired and wireless networks and different Internet protocols, which we test thoroughly in an extensive set of experiments. Our constructions are not only more realistic, but also more flexible, as they allow larger ranges of error probabilities. This will eventually open the way for the widespread use of unconditionally secure multi-party computation.

Jan 1, 20130 citations

On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions

Ivan Damgård, Joe Kilian, Louis Salvail

We consider the problem of basing Oblivious Transfer (OT) and Bit Commitment (BC), with information theoretic security, on seemingly weaker primitives.We introduce a general model for describing such primitives, called Weak Generic Transfer (WGT). This model includes as important special cases Weak Oblivious Transfer (WOT), where both the sender and receiver may learn too much about the other party's input, and a new, more realistic model of noisy channels, called unfair noisy channels. An unfair noisy channel has a known range of possible noise levels; protocols must work for any level within this range against adversaries who know the actual noise level. We give a precise characterization for when one can base OT on WOT. When the deviation of the WOT from the ideal is above a certain threshold, we show that no information-theoretic reductions from OT (even against passive adversaries) and BC exist; when the deviation is below this threshold, we give a reduction from OT (and hence BC) that is information-theoretically secure against active adversaries. For unfair noisy channels we show a similar threshold phenomenon for bit commitment. If the upper bound on the noise is above a threshold (given as function of the lower bound) then no information-theoretic reduction from OT (even against passive adversaries) or BC exist; when it is below this threshold we give a reduction from BC. As a partial result, we give a reduction from OT to UNC for smaller noise intervals.

BRICS Report SeriesJun 7, 19987 citations