Efficient oblivious transfer from algebraic signaling over the Gaussian channel

Authors:
Motohiko Isaka
Affiliations:
Department of Informatics, Kwansei Gakuin University, Sanda, Japan
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Year:
2009

Citing 7
Cited 0

Universal classes of hash functions (Extended Abstract)

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Efficient cryptographic protocols based on noisy channels

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Efficient unconditional oblivious transfer from almost any noisy channel

SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Generalized privacy amplification

IEEE Transactions on Information Theory - Part 2
Sphere-bound-achieving coset codes and multilevel coset codes

IEEE Transactions on Information Theory
On the Oblivious-Transfer Capacity of Noisy Resources

IEEE Transactions on Information Theory
The Commitment Capacity of the Gaussian Channel Is Infinite

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.