Abstract
In this work, two participants fairly send or receive things through the aid of intermediate who is only engaged if required. An up-to-date accepted necessity is with the aim of involving third party in the trade should be transparent, to save from privacy and evade terrible publicity. Together, a dishonest intermediate will negotiate the fairness of the trade and so the intermediate should be liable in case of any behavioural changes. Optimistic fair exchange (OFE) is one of the classical protocols to assure fairness of indulgence for a party. This exchange can be done by means of an arbitrator. The most important aspect of OFE is to describe security models so as to capture real-time attacks and design schemes secure in practical models. Signaller is confirmed with the data to send the correct person to address that to make sure it is. Since then the SMS has gone through to achieve that can hold the path to the right to see which if any is the fact that to ensure there is. After the signature is created by creating it to be able to well take care of it and then to the right of the person to pay off that is sure to make it. In this project, to avoid the third party attack (hacking) and unauthorized person access the particular important data. The data should be transmitted in sender to receiver that receiver only have a correct data without any data losses, protect a data security in cyber-attacks. A signature may be digitally and OFE design for the exchanged item have trade-off between transparency and accountability.
References
- N. Asokan, M. Schunter, and M. Waidner, “Optimistic protocols for fair exchange,” in Proc. CCS’97, 1997, pp. 7–17, ACM.
- Y. Dodis, P. J. Lee, and D. H. Yum, “Optimistic fair exchange in amulti-usersetting,”inProc. KC’07, 2007, vol.4450, pp.118–133, LNCS, Springer.
- Y. Dodis and L. Reyzin, “Breaking andrepairingoptimisticfair exchange from PODC 2003,” in Proc. 2003 ACM Workshop on Digital Rights Management, 2003, pp. 47–54, ACM.
- Q. Huang, G. Yang, D. S. Wong, and W. Susilo, “Efficient optimistic fair exchange secure in the multi-user setting and chosen - keymodel ith outrandomoracles,” in Proc. CT-RSA’08, 2008, vol. 4964, pp. 106–120, LNCS, Springer.
- O. Markowitch and S. Kremer, “An optimistic non-repudiation protocol ith transparent trusted third party,” in Proc. ISC’01, 2001, vol. 2200, pp.363–378, LNCS, Springer.
- H. Zhu,W. Susilo, and Y.Mu, “Multi-party stand-alone and setup-free verifiably committed signatures,” in Proc. PKC’07, 2007, vol. 4450, pp.134–149, LNCS, Springer.
- N. Asokan, V. Shoup, and M. Waidner, “Optimistic fair exchange of digital signatures (extended abstract),” in Proc. Eurocrypt’98, 1998, vol. 1403, pp.591–606, LNCS, Springer.
- Waidner, “Optimistic fair exchange of digital signatures,” IEEE J. Sel. Areas Commun., vol. 18, no. 4, pp. 593–610, Apr. 2000.
- J. Camenisch and I. Damgård, “Verifiable encryption, group encryption, and their applications to separable group signatures and signature sharing schemes,” in Proc. Asiacrypt’00, 2000, vol. 1976, pp. 331–345, LNCS, Springer.
- J. M. Park, E. K. P. Chong, and H. J. Siegel, “Constructing fair-exchange protocols for e-commerce via distributed computation of RSA signatures,” in Proc. PODC’03, 2003, pp. 172–181, ACM.
- YangWang, Man Ho Au, WillySusilo “Optimistic fair exchange in the enhanced chosen-key model” Volume 562, 11 January 2015, Pages 57-74, Elsevier.
- E.Baraneetharan, G. Selvakumar, “Smart Internet of Things (IOT) System for Performance Improvement of Dual Bridge LLC Resonant Converter by Using Sophisticated Distribution Control Method (SDC)” in proc IoT close loop, 2018, springer.
- Bai, H., Ma, Z., & Zhu, Y. (2012). The application of cloud computing in smart grid status monitoring. In Y. Wang & X. Zhang (Eds.), Internet of things. Communications in computer and information science, Vol. 312.
- Ye J., Sun H., Li S., & Hou, X. (2017). Simulation study low voltage power line carrier communication in noisy environments. In 2017 International Conference on Computer Network, Electronic and Automation (ICCNEA) (pp. 392–395).
- Arpit Agrawal, Gunjan Patankar,” Design of Hybrid Cryptography Algorithm for Secure Communication” published by “International Research Journal of Engineering and Technology”, Volume 3 Issue 1, Jan 2016.
- Neha Tyagi, Ashish Agarwal, Anurag Katiyar, Shubham Garg, Shudhanshu Yadav, “Protection of Key in Private Key Cryptography” published by “International Journal of Advanced Research”, Volume 5, Issue 2, Feb 2017.
- Meenakshi Shankar, Akshay.P, “Hybrid Cryptographic Techniques Using RSA Algorithm and Scheduling Concepts” published by ”International Journal of Network Security & Its Application”, Volume 6, Issue 6, Nov 2014.
- S. Luo, J. Hu and Z. Chen, “Ciphertext policy attribute-based proxy re-encryption,” in Information and Communications Security, pp. 401–415, Springer Berlin Heidelberg, 2010.
- C. E. Gates, "Access control requirements for Web 2.0 security and privacy", IEEE Web 2.0 privacy and security workshop (W2SP'07) Oakland California USA, May 2007.
- Margolin, N. Boris Levine and, Brian Neil, "Informant Detecting Sybils using incentives", Proceedings of Financial Cryptography (FC), pp. 192-207, February 2007.
- J. R. Douceur, “The Sybil attack”, in proceedings for the First International Workshop on Peer-to-Peer Systems (IPTPS'02)", vol. 2429, pp. 251-260, Mar. 2002.
- Diksha Gupta, Jared Saia, Maxwell Young, "Peace through Superior Puzzling: An Asymmetric Sybil Defense", Parallel and Distributed Processing Symposium (IPDPS) 2019 IEEE International, pp. 1083-1094, 2019.
- Bergadano Francesco, D. Gunetti, C. Picardi, "User authentication through keystroke dynamics", Acm Transactions on Information & System Security 5, vol. 4, pp. 367-397, 2002.
- M.Nandhini, B. Praveenkumar, “Secure Smart Grid for Public Key Infrastructure using Wireless Communication System”, International Journal for Scientific Research & Development-IJSRD, Vol. 3(3), pp. 1247-1250, 2015.