Round-efficient perfectly secure message transmission scheme against general adversary

Authors:
Kaoru Kurosawa
Affiliations:
Department of Computer and Information Sciences, Ibaraki University, Ibaraki, Japan 316-8511
Venue:
Designs, Codes and Cryptography
Year:
2012

Citing 8
Cited 0

Completeness theorems for non-cryptographic fault-tolerant distributed computation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Perfectly secure message transmission

Journal of the ACM (JACM)
Efficient perfectly secure message transmission in synchronous networks

Information and Computation
On perfectly secure communication over arbitrary networks

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Truly efficient 2-round perfectly secure message transmission scheme

IEEE Transactions on Information Theory
General secure multi-party computation from any linear secret-sharing scheme

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
A complete characterization of tolerable adversary structures for secure point-to-point transmissions without feedback

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Asymptotically optimal two-round perfectly secure message transmission

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the model of Perfectly Secure Message Transmission Schemes (PSMTs), there are n channels between a sender and a receiver, and they share no key. An infinitely powerful adversary A can corrupt (observe and forge) the messages sent through some subset of n channels. For non-threshold adversaries called Q 2, Kumar et al. showed a many round PSMT (Ashwin Kumar et al. On perfectly secure communication over arbitrary networks. PODC 2002, pp. 193---202, 2002). In this paper, we show round efficient PSMTs against Q 2-adevrsaries. We first give a 3-round PSMT which runs in polynomial time in the size of the underlying linear secret sharing scheme. We next present a 2-round PSMT which is inefficient in general. (However, it is efficient for some special case.)