Access the full text.
Sign up today, get DeepDyve free for 14 days.
R. Ostrovsky, M. Yung (1991)
How to withstand mobile virus attacks (extended abstract)
Matthias Fitzi, M. Franklin, J. Garay, H. Simhadri (2007)
Towards Optimal and Efficient Perfectly Secure Message Transmission
A. Patra, Ashish Choudhury, C. Rangan (2009)
Brief announcement: perfectly secure message transmission in directed networks re-visited
K. Srinathan, C. Rangan (2006)
Possibility and complexity of probabilistic reliable communication in directed networks
(2007)
Notes 1 Few results of this paper appeared in
J. Garay, K. Perry (1992)
A Continuum of Failure Models for Distributed Computing
Y. Desmedt, Qiushi Yang (2011)
Perfectly Secure Message Transmission
Paul Feldman, S. Micali (1988)
Optimal algorithms for Byzantine agreement
V. Hadzilacos (1985)
Issues of fault tolerance in concurrent computations (databases, reliability, transactions, agreement protocols, distributed computing)
K. Srinathan, A. Patra, Ashish Choudhury, C. Rangan (2008)
Unconditionally Reliable Message Transmission in Directed Hypergraphs
A. Patra, Ashish Choudhury, C. Rangan (2008)
Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited
Kannan Srinathan, A. Patra, Ashish Choudhary, C. Rangan (2007)
Probabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality
T. Rabin, M. Ben-Or (1989)
Verifiable secret sharing and multiparty protocols with honest majority
M. Hirt, U. Maurer, Vassilis Zikas (2008)
MPC vs. SFE : Unconditional and Computational Security
Ashwin Machanavajjhala, P. Goundan, K. Srinathan, C. Rangan (2002)
On perfectly secure communication over arbitrary networks
Yongge Wang, Y. Desmedt (1999)
Secure Communication in Broadcast Channels: The Answer to Franklin and Wright's Question
Yongge Wang, Y. Desmedt (2002)
Perfectly Secure Message Transmission RevisitedIEEE Transactions on Information Theory, 54
D. Dolev, C. Dwork, Orli Waarts, M. Yung (1990)
Perfectly secure message transmissionProceedings [1990] 31st Annual Symposium on Foundations of Computer Science
M. Hirt, U. Maurer (2000)
Player Simulation and General Adversary Structures in Perfect Multiparty ComputationJournal of Cryptology, 13
K. Srinathan, Ashish Choudhury, A. Patra, C. Rangan (2008)
Efficient single phase unconditionally secure message transmission with optimum communication complexity
Arvind Narayanan, K. Srinathan, C. Rangan (2006)
Perfectly Reliable Message TransmissionInf. Process. Lett., 100
I. Damgård, J. Nielsen (2007)
Scalable and Unconditionally Secure Multiparty Computation
M. Franklin, M. Yung (1995)
Secure hypergraphs: privacy from partial broadcastSIAM J. Discret. Math., 18
Saurabh Agarwal, R. Cramer, Robbert Haan (2006)
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
R. Cramer, I. Damgård, Stefan Dziembowski (2000)
On the complexity of verifiable secret sharing and multiparty computationIACR Cryptol. ePrint Arch., 2000
(2006)
Secure Distributed Communication
M. Franklin, R. Wright (2000)
Secure Communication in Minimal Connectivity ModelsJournal of Cryptology, 13
Kannan Srinathan, Arvind Narayanan, C. Rangan (2004)
Optimal Perfectly Secure Message Transmission
Zuzana Beerliová-Trubíniová, M. Hirt (2008)
Perfectly-Secure MPC with Linear Communication Complexity
K. Menger
Zur allgemeinen KurventheorieFundamenta Mathematicae, 10
Toshinori Araki (2008)
Almost Secure 1-Round Message Transmission Scheme with Polynomial-Time Message Decryption
R. Cramer, I. Damgård, Stefan Dziembowski, M. Hirt, T. Rabin (1999)
Efficient Multiparty Computations Secure Against an Adaptive Adversary
D. Chaum, C. Crépeau, I. Damgård (1988)
Multiparty unconditionally secure protocols
A. Patra, Ashish Choudhary, Kannan Srinathan, C. Rangan (2006)
Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission
L. Lamport (1983)
The Weak Byzantine Generals ProblemJ. ACM, 30
Jérôme Renault, Tristan Tomala (2008)
Probabilistic Reliability and Privacy of Communication Using Multicast in General Neighbor NetworksJournal of Cryptology, 21
D. Chaum, C. Crépeau, I. Damgård (1988)
Multiparty Unconditionally Secure Protocols (Extended Abstract)
A. Yao (1982)
Protocols for secure computations23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
R. Gennaro (1996)
Theory and practice of verifiable secret sharing
K. Kurosawa, Kazuhiro Suzuki (2008)
Truly Efficient $2$-Round Perfectly Secure Message Transmission SchemeIEEE Transactions on Information Theory, 55
Matthias Fitzi, U. Maurer (1998)
Efficient Byzantine Agreement Secure Against General Adversaries
R. Cramer, I. Damgård, U. Maurer (2000)
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
Kannan Srinathan, N. Prasad, C. Rangan (2007)
On the Optimal Communication Complexity of Multiphase Protocols for Perfect Communication2007 IEEE Symposium on Security and Privacy (SP '07)
F. MacWilliams, N. Sloane (1977)
The Theory of Error-Correcting Codes
T. Cover, Joy Thomas (2005)
Elements of Information Theory
Oded Goldreich, S. Micali, A. Wigderson (1987)
How to play ANY mental gameProceedings of the nineteenth annual ACM symposium on Theory of computing
L. Lamport, R. Shostak, M. Pease (1982)
The Byzantine Generals ProblemACM Trans. Program. Lang. Syst., 4
Paul Feldman, S. Micali (1989)
An Optimal Probabilistic Algorithm For Synchronous Byzantine Agreement
(2005)
Cisco security hole a whopper', available at http://www.wired.com/politics/security/news
Ashish Choudhury, A. Patra, Ashwinkumar Badanidiyuru, K. Srinathan, C. Rangan (2008)
Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
R. Ostrovsky, M. Yung (1991)
How To Withstand Mobile Virus Attacks
Hasan Sayeed, H. Abu-Amara (1996)
Efficient Perfectly Secure Message Transmission in Synchronous NetworksInf. Comput., 126
B. Altmann, Matthias Fitzi, U. Maurer (1999)
Byzantine Agreement Secure against General Adversaries in the Dual Failure Model
Zuzana Beerliová-Trubíniová, M. Hirt (2006)
Efficient Multi-party Computation with Dispute Control
A. Patra, B. Shankar, Ashish Choudhury, K. Srinathan, C. Rangan (2007)
Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary
M. Ben-Or, S. Goldwasser, A. Wigderson (1988)
Completeness theorems for non-cryptographic fault-tolerant distributed computation
K. Srinathan, A. Patra, Ashish Choudhury, C. Rangan (2009)
Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary
Wanqing Li, W. Susilo, U. Tupakula, R. Safavi-Naini, V. Varadharajan (2009)
Proceedings of the 2009 ACM Symposium on Information, Computer and Communications Security, ASIACCS 2009, Sydney, Australia, March 10-12, 2009
Hasan Sayeed, H. Abu-Amara (1995)
Perfectly secure message transmission in asynchronous networksProceedings.Seventh IEEE Symposium on Parallel and Distributed Processing
Ashwinkumar B.V, A. Patra, Ashish Choudhary, Kannan Srinathan, Chandrasekharan Rangan (2008)
On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary
M. Ben-Or, S. Goldwasser, A. Wigderson (1988)
Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract)
K. Kurosawa, Kazuhiro Suzuki (2009)
Almost Secure (1-Round, n-Channel) Message Transmission Scheme
B. Shankar, P. Gopal, K. Srinathan, C. Rangan (2008)
Unconditionally reliable message transmission in directed networks
Zuzana Beerliová-Trubíniová, Matthias Fitzi, M. Hirt, U. Maurer, Vassilis Zikas (2008)
MPC vs. SFE: Perfect Security in a Unified Corruption Model
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.
International Journal of Applied Cryptography – Inderscience Publishers
Published: Jan 1, 2010
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.