research-article

Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary

Authors:

Kannan Srinathan,

Ashish Choudhary,

C. Pandu RanganAuthors Info & Claims

ASIACCS '09: Proceedings of the 4th International Symposium on Information, Computer, and Communications Security

Pages 171 - 182

https://doi.org/10.1145/1533057.1533083

Published: 10 March 2009 Publication History

Abstract

In this paper, we re-visit the problem of unconditionally secure message transmission (USMT) from a sender S to a receiver R, who are part of a distributed synchronous network, modeled as an arbitrary directed graph. Some of the intermediate nodes between S and R can be under the control of an adversary having unbounded computing power. Desmedt and Wang [4] have given the characterization of USMT in directed networks. However, in their model, the underlying network is abstracted as directed node disjoint paths (also called as wires/channels) between S and R, where the intermediate nodes are oblivious, message passing nodes and perform no other computation. In this work, we first show that the characterization of USMT given by Desmedt et.al [4] does not hold good for arbitrary directed networks, where the intermediate nodes can perform some computation, beside acting as message forwarding nodes. We then give the characterization of USMT in arbitrary directed networks, considering the entire network as a whole. As far our knowledge is concerned, this is the first ever characterization of USMT in arbitrary directed networks.

References

[1]

B. Altmann, M. Fitzi, and U. M. Maurer. Byzantine agreement secure against general adversaries in the dual failure model. In DISC 99, pages 123--137, 1999.

Digital Library

[2]

M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In STOC, pages 1--10, 1988.

Digital Library

[3]

D. Chaum, C. Crépeau, and I. Damgård. Multiparty unconditionally secure protocols (extended abstract). In STOC, pages 11--19, 1988.

Digital Library

[4]

Y. Desmedt and Y. Wang. Perfectly secure message transmission revisited. In Eurocrypt, pages 502--517, 2002.

Digital Library

[5]

D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly secure message transmission. JACM, 40(1):17--47, 1993.

Digital Library

[6]

M. Fitzi, M. Hirt, and U. Maurer. Trading correctness for privacy in unconditional multi-party computation. In CRYPTO 98, pages 121--136, 1998.

Digital Library

[7]

M. Fitzi, M. Hirt, and U. M. Maurer. General adversaries in unconditional multi-party computation. In ASIACRYPT 99, pages 232--246, 1999.

Digital Library

[8]

M. Franklin and R. Wright. Secure communication in minimal connectivity models. Journal of Cryptology, 13(1):9--30, 2000.

Digital Library

[9]

O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In STOC, pages 218--229, 1987.

Digital Library

[10]

F. J. MacWilliams and N. J. A. Sloane. The Theory of Error Correcting Codes. North-Holland Publishing Company, 1978.

[11]

A. Patra, A. Choudhary, K. Srinathan, and C. Pandu Rangan. Unconditionally reliable and secure message transmission in undirected synchronous networks tolerating mixed adversary: Possibility, feasibility and optimality. Cryptology ePrint Archive, Report 2008/141, 2008.

[12]

T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In STOC, pages 73--85, 1989.

Digital Library

[13]

K. Srinathan, A. Patra, A. Choudhary, and C. Pandu Rangan. Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary. Cryptology ePrint Archive, Report 2008/506, 2008.

[14]

K. Srinathan and C. Pandu Rangan. Possibility and complexity of probabilistic reliable communication in directed networks. In PODC, pages 265--274, 2006.

Digital Library

[15]

A. C. Yao. Protocols for secure computations. In Proc. of 23rd IEEE FOCS, pages 160--164, 1982.

Digital Library

Cited By

Kishore RKumar AVanarasa CSrinathan K(2018)On the Price of Proactivizing Round-Optimal Perfectly Secret Message TransmissionIEEE Transactions on Information Theory10.1109/TIT.2017.277609964:2(1404-1422)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1109/TIT.2017.2776099
Pagourtzis APanagiotakos GSakavalas D(2017)Reliable Communication via Semilattice Properties of Partial KnowledgeFundamentals of Computation Theory10.1007/978-3-662-55751-8_29(367-380)Online publication date: 16-Aug-2017
https://doi.org/10.1007/978-3-662-55751-8_29
Nayak MAgrawal SSrinathan K(2011)Minimal connectivity for unconditionally secure message transmission in synchronous directed networksProceedings of the 5th international conference on Information theoretic security10.5555/2009144.2009148(32-51)Online publication date: 21-May-2011
https://dl.acm.org/doi/10.5555/2009144.2009148

Index Terms

Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary
1. General and reference
  1. Cross-computing tools and techniques
    1. Reliability
2. Software and its engineering
  1. Software organization and properties
    1. Extra-functional properties
      1. Software reliability

Recommendations

Perfectly secure message transmission in directed networks tolerating threshold and non threshold adversary
CANS'07: Proceedings of the 6th international conference on Cryptology and network security

In this paper we study Perfectly Secure Message Transmission (PSMT) between a sender S and a receiver R, connected in a directed synchronous network through multiple parallel edges (called wires), each of which are directed from S to R or vice-versa. ...
Perfectly reliable and secure message transmission tolerating mobile adversary

We study the problem of perfectly reliable message transmission (PRMT) and perfectly secure message transmission (PSMT) in an undirected synchronous network tolerating an all powerful threshold mobile Byzantine adversary. Specifically, we show that the ...
Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary
ACISP '08: Proceedings of the 13th Australasian conference on Information Security and Privacy

In this paper, we study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous network, a part of which is under the influence of an all ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ASIACCS '09: Proceedings of the 4th International Symposium on Information, Computer, and Communications Security

March 2009

408 pages

ISBN:9781605583945

DOI:10.1145/1533057

General Chairs:
Wanqing Li
University of Wollongong, Australia
,
Willy Susilo
University of Wollongong, Australia
,
Udaya Tupakula
Macquarie University, Australia
,
Program Chairs:
Rei Safavi-Naini
University of Calgary, Canada
,
Vijay Varadharajan
Macquarie University, Australia

Copyright © 2009 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 March 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

Asia CCS 09

Sponsor:

SIGSAC

Asia CCS 09: Asia CCS 2009 ACM Symposium on Information, Computer and Communications Security

March 10 - 12, 2009

Sydney, Australia

Acceptance Rates

Overall Acceptance Rate 418 of 2,322 submissions, 18%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
234
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Kishore RKumar AVanarasa CSrinathan K(2018)On the Price of Proactivizing Round-Optimal Perfectly Secret Message TransmissionIEEE Transactions on Information Theory10.1109/TIT.2017.277609964:2(1404-1422)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1109/TIT.2017.2776099
Pagourtzis APanagiotakos GSakavalas D(2017)Reliable Communication via Semilattice Properties of Partial KnowledgeFundamentals of Computation Theory10.1007/978-3-662-55751-8_29(367-380)Online publication date: 16-Aug-2017
https://doi.org/10.1007/978-3-662-55751-8_29
Nayak MAgrawal SSrinathan K(2011)Minimal connectivity for unconditionally secure message transmission in synchronous directed networksProceedings of the 5th international conference on Information theoretic security10.5555/2009144.2009148(32-51)Online publication date: 21-May-2011
https://dl.acm.org/doi/10.5555/2009144.2009148

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten