STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
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
Optimal algorithms for Byzantine agreement
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
How to withstand mobile virus attacks (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Perfectly secure message transmission
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
Efficient perfectly secure message transmission in synchronous networks
Information and Computation
The Weak Byzantine Generals Problem
Journal of the ACM (JACM)
On the complexity of verifiable secret sharing and multiparty computation
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
On perfectly secure communication over arbitrary networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
A Continuum of Failure Models for Distributed Computing
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Efficient Byzantine Agreement Secure Against General Adversaries
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Byzantine Agreement Secure against General Adversaries in the Dual Failure Model
Proceedings of the 13th International Symposium on Distributed Computing
An Optimal Probabilistic Algorithm For Synchronous Byzantine Agreement
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Perfectly Secure Message Transmission Revisited
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Perfectly secure message transmission in asynchronous networks
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Issues of fault tolerance in concurrent computations (databases, reliability, transactions, agreement protocols, distributed computing)
Theory and practice of verifiable secret sharing
Theory and practice of verifiable secret sharing
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
On the Optimal Communication Complexity of Multiphase Protocols for Perfect Communication
SP '07 Proceedings of the 2007 IEEE Symposium on Security and Privacy
Unconditionally reliable message transmission in directed networks
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Almost Secure 1-Round Message Transmission Scheme with Polynomial-Time Message Decryption
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
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
MPC vs. SFE: Unconditional and Computational Security
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
Brief announcement: perfectly secure message transmission in directed networks re-visited
Proceedings of the 28th ACM symposium on Principles of distributed computing
Efficient multiparty computations secure against an adaptive adversary
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
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
Towards optimal and efficient perfectly secure message transmission
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Scalable and unconditionally secure multiparty computation
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
Truly efficient 2-round perfectly secure message transmission scheme
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Perfectly-secure MPC with linear communication complexity
TCC'08 Proceedings of the 5th conference on Theory of cryptography
MPC vs. SFE: perfect security in a unified corruption model
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Constant phase bit optimal protocols for perfectly reliable and secure message transmission
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Asymptotically optimal two-round perfectly secure message transmission
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Efficient multi-party computation with dispute control
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Secure message transmission in asynchronous networks
Journal of Parallel and Distributed Computing
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network 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
A general construction for 1-round δ-RMT and (0, δ)-SMT
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
On the communication complexity of reliable and secure message transmission in asynchronous networks
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
| Hi-index | 0.00 |
We study the interplay of network connectivity and the issues related to the 'possibility', 'feasibility' and 'optimality' for unconditionally reliable message transmission (URMT) and unconditionally secure message transmission (USMT) in an undirected synchronous network, under the influence of an adaptive mixed adversary having unbounded computing power, who can corrupt some of the nodes in the network in Byzantine, omission, fail-stop and passive fashion respectively. We consider two types of adversary, namely threshold and non-threshold. One of the important conclusions we arrive at from our study is that allowing a negligible error probability significantly helps in the 'possibility', 'feasibility' and 'optimality' of both reliable and secure message transmission protocols. To design our protocols, we propose several new techniques which are of independent interest.