Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Symposium on Information Theory and its Applications

An unconditionally secure protocol based on lattices over the Gaussian channel

Motohiko Isaka

Published Dec 1, 2008• 1 citation
Publisher

Abstract

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.
DOI
10.1109/isita.2008.4895618

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, 2009•4 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 Sciences•Jan 1, 2010•4 citations

On unconditionally secure oblivious transfer from continuous channels

Motohiko Isaka

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.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2010•4 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, 2008•5 citations

A practical scheme for string commitment based on the Gaussian channel

Frédérique Oggier, Kirill Morozov

We consider the problem of information-theoretically secure string commitment using a channel with additive white Gaussian noise. While the current results in the literature mainly present existence results for such schemes, we present here a practical scheme using lattice codes and analyze its security parameters for finite code lengths.

IEEE Information Theory Workshop (ITW)•May 1, 2008•6 citations

On secret key agreement from the additive white Gaussian noise channel

Motohiko Isaka, Kawata Seiya

It is known that noise on communication channels can be a powerful resource for certain cryptographic purposes, basically by utilizing the randomness to ensure the secrecy. In this paper, we study information theoretically secure key agreement through the use of the additive white Gaussian noise channel and public discussion. We present a protocol for key agreement that defines the computation and communications between the two communicating parties to share a common secret information, about which negligible amount of information is revealed to other third parties. We discuss the signal design, secrecy and the achievable rate of the protocol.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2009•1 citation
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.
It is known that noise on communication channels can be a powerful resource for certain cryptographic purposes, basically by utilizing the randomness to ensure the secrecy. In this paper, we study information theoretically secure key agreement through the use of the additive white Gaussian noise channel and public discussion. We present a protocol for key agreement that defines the computation and communications between the two communicating parties to share a common secret information, about which negligible amount of information is revealed to other third parties. We discuss the signal design, secrecy and the achievable rate of the protocol.