New application of reliable agreement: underlying an unsecured business environment
Pages 42 - 57
Abstract
Due to the enterprise internationalization nowadays, each sub-company of the enterprise is located in different place. Under such circumstances, each sub-company must better itself with greater power and ability through coordination. Unfortunately, malicious hacker possibly fakes the communications between the sub-companies. The messages from sub-company might be changed in an unsecured environment. Thus, this paper proposes the Two-Phase Agreement (TPA) protocol to make easy the sub-companies' communication with the main-company or decision-making in company conference.
References
[1]
P. Dasgupta, "Agreement under faulty interfaces," Information Processing Letters, vol. 65, pp. 125--129, 1998.
[2]
W. Diffie and M. Hellman, "New Directions in Cryptography," IEEE Transactions on Information Theory, pp. 644--654, November 1976.
[3]
D. Dolev, and R. Reischuk, "Bounds on Information Exchange for Byzantine Agreement,"Journal of ACM, vol. 32, no. 1, pp. 191--204, 1985.
[4]
L. Gong, P. Lincoln, and J. Rushby, "Byzantine Agreement with Authentication: Observations and Applications in Tolerating Hybrid and Link Faults," IEEE Computer Society press on Dependable Computing and Fault Systems, vol. 10, pp. 139--157, 1995.
[5]
R. Hyeun-Suk, H. Pirkul, V. Jacob, and R. Barhki, "Effects of computer-mediated communication on group negotiation: an empirical study," System Sciences, Vol.4, Proceedings of the Twenty-Eighth Hawaii International Conference on, pp. 270--279, 1995.
[6]
I. Keidar, and R. Khazan, "A client-server approach to virtually synchronous group multicast: specifications and algorithms," in Proc. 20th International Conference on Distributed Computing Systems, pp. 344--355, 2000.
[7]
L. Lamport, R. Shostak, and M. Pease, "The Byzantine Generals Problem," ACM Transactions on Programming Languages and System, vol. 4, no. 3, pp. 384--401, 1982.
[8]
C. Ma, Hongan Wang, and Guozhong Dai "Research on network based conceptual design," The Sixth International Conference on Computer Supported Cooperative Work in Design, pp. 232--235, 2001.
[9]
A. Postma, T. Krol, and E. Molenkamp. "Optimized Authenticated Self-synchronizing Byzantine Agreement Protocols," in the Proceedings of Pacific Rim International Symposium, pp. 122--129, 1997.
[10]
T. Rabin and M. Ben-Or, "Verifiable Secret Sharing and Multiparty Protocols with Honest Majority," ACM, pp. 73--85, 1989.
[11]
K. Shima, H. Higaki, and M. Takizawa, "Fault-Tolerant Causal Delivery In Group Communication," in the Proceedings of International Conference of Parallel and Distributed Systems, pp. 302--309, 1996.
[12]
M. Steiner, G. Tsudik, and M. Waidner, "CLIQUES: a new approach to group key agreement," Distributed Computing Systems, 1998. Proceedings. 18th International Conference on, pp. 380--387, 1998.
[13]
M. Steiner, G. Tsudik, and M. Waidner, "Key agreement in dynamic peer groups," in IEEE Transactions on Parallel and Distributed Systems, Volume: 11, Issue: 8, pp. 769--780, Aug. 2000.
[14]
S. C. Wang, Y. H. Chin, and K. Q. Yan, "Byzantine Agreement in a Generalized Connected Network Model," in IEEE Transactions on Parallel and Distributed System, 6(4), pp. 420--427, 1995.
[15]
K. Q. Yan, S. C. Wang and Y. H. Chin, "Consensus Under Unreliable Transmission," Information Processing Letters, vol. 69, no. 5, pp. 243--248, March 12 1999.
[16]
T, Yamaoka, K. Tsujino, T. Yoshida, and S. Nishida, "Supporting mutual understanding in collaborative design project," Computer Human Interaction, 1998. Proceedings. Third Asia Pacific, pp. 132--137, 1998.
Recommendations
Reach Reliable Decision by Using Secret Agreement Method
ICPADS '02: Proceedings of the 9th International Conference on Parallel and Distributed SystemsTraditionally, it is very important in delivering thedata with secretly and low cost in a distributedenvironment. Use the reliable method to assist theorganization in communicating with each other needs tobe discussed. Thus, we propose the Two-Phase ...
How Byzantine is a Send Corruption?
Applied Cryptography and Network SecurityAbstractConsensus protocols enable n parties, each holding some input string, to agree on a common output even in the presence of corrupted parties. Recent work has pushed to understand the problem when a majority of parties may be corrupted thus ...
Efficient Byzantine agreement with faulty minority
ASIACRYPT'07: Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information securityByzantine Agreement (BA) among n players allows the players to agree on a value, even when up to t of the players are faulty.
In the broadcast variant of BA, one dedicated player holds a message, and all players shall learn this message. In the ...
Comments
Information & Contributors
Information
Published In
Copyright © 2004 Authors.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 July 2004
Published in SIGOPS Volume 38, Issue 3
Check for updates
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 139Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 15 Oct 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in