Abstract
AbstractIn this paper, our focus is on the investigation for further improvement (with its variants already existing) upon the Elliptic Curve Digital Signature Algorithm (ECDSA). The security of ECDSA is based on the Elliptic Curve Discrete Logarithm Problem. Though, ECDSA uses the same number to generate two separate signatures as per the original protocol, it is possible for an adversary to forge the signature. There have been number of improvements proposed to circumvent the issue. However, we propose here a probabilistic and improved bloom filter based variant of ECDSA that while being optimal enhances the security strength of ECDSA. With the theoretical analysis supplemented with our experimentation on the TinyOS platform, we show that it is appropriate to employ in the resource-constrained environment of Wireless Senor Networks (WSNs).KeywordsSensor NodeWireless Sensor NetworkHash FunctionDomain ParameterBloom FilterThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
