Abstract
The Internet as a complete does not use safe links, thus data in transit may be vulnerable to interception as well. The significant of reducing a chance of the data being detected during the conduction is being a problem now days. Some way out to be discussed is how to pass data in a manner that the very existence of the message is unknown in order to prevent interest of the possible attacker. This approach of data hiding can be extended to copyright protection for digital media. This paper present a comparative study of majority vote parity check method and tree-based parity check. Result shows that Majority vote strategy results in least distortion for finding a stego object.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
