Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Perfectly secure message transmission
Journal of the ACM (JACM)
Robust sharing of secrets when the dealer is honest or cheating
Journal of the ACM (JACM)
Secure hypergraphs: privacy from partial broadcast
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Fault-tolerant Computation in the Full Information Model
SIAM Journal on Computing
On sharing secrets and Reed-Solomon codes
Communications of the ACM
Issues of fault tolerance in concurrent computations (databases, reliability, transactions, agreement protocols, distributed computing)
On perfectly secure communication over arbitrary networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Efficient reliable communication over partially authenticated networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Robust key establishment in sensor networks
ACM SIGMOD Record
Efficient reliable communication over partially authenticated networks
Distributed Computing - Special issue: PODC 02
Possibility and complexity of probabilistic reliable communication in directed networks
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Perfectly reliable message transmission
Information Processing Letters
Unconditionally reliable message transmission in directed networks
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Unconditionally Reliable Message Transmission in Directed Hypergraphs
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Perfectly reliable and secure message transmission tolerating mobile adversary
International Journal of Applied Cryptography
On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
A one-round secure message broadcasting protocol through a key sharing tree
Information Processing Letters
On private computation in incomplete networks
Distributed Computing
Brief announcement: perfectly secure message transmission in directed networks re-visited
Proceedings of the 28th ACM symposium on Principles of distributed computing
Secure communication: a mechanism design approach
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Optimal secure message transmission by public discussion
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Security of trusted repeater quantum key distribution networks
Journal of Computer Security - EU-Funded ICT Research on Trust and Security
On proactive perfectly secure message transmission
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
Almost-everywhere secure computation
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Cryptanalysis of secure message transmission protocols with feedback
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
International Journal of Applied Cryptography
Optimal message transmission protocols with flexible parameters
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Edge-colored graphs with applications to homogeneous faults
Information Processing Letters
Secure message transmission in asynchronous networks
Journal of Parallel and Distributed Computing
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Homogeneous faults, colored edge graphs, and cover free families
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
On composability of reliable unicast and broadcast
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Revisiting colored networks and privacy preserving censorship
CRITIS'06 Proceedings of the First international conference on Critical Information Infrastructures Security
Constant phase bit optimal protocols for perfectly reliable and secure message transmission
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Radio networks with reliable communication
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A practical clumped-tree multicast encryption scheme
ISPEC'06 Proceedings of the Second international conference on Information Security Practice and Experience
On private computation in incomplete networks
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Asymptotically optimal two-round perfectly secure message transmission
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Secure communication in multicast graphs
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Optimal one round almost perfectly secure message transmission (short paper)
FC'11 Proceedings of the 15th international conference on Financial Cryptography and Data Security
Secure message transmission in asynchronous directed graphs
INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
Human perfectly secure message transmission protocols and their applications
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Theoretical Computer Science
| Hi-index | 0.00 |
Achieving secure communications in networks has been one of the most important problems in information technology. Dolev, Dwork, Waarts, and Yung have studied secure message transmission in one-way or two-way channels. They only consider the case when all channels are two-way or all channels are one-way. Goldreich, Goldwasser, and Linial, Franklin and Yung, Franklin and Wright, and Wang and Desmedt have studied secure communication and secure computation in multirecipient (multicast) models. In a "multicast channel" (such as Ethernet), one processor can send the same message - simultaneously and privately - to a fixed subset of processors. In this paper, we shall study necessary and sufficient conditions for achieving secure communications against active adversaries in mixed one-way and two-way channels. We also discuss multicast channels and neighbor network channels.