Entity

Time filter

Source Type

Frederick, MD, United States

Naskar P.K.,MCKV Institute of Engineering Liluah | Khan H.N.,Regent Education | Chaudhuri A.,Jadavpur University
International Journal of Network Security | Year: 2016

This paper presents a key based secured (k; n) threshold cryptography where key is used to encrypt the secret and then the secret as well as key is shared among set of n participants. In sharing phase, each secret byte is selected randomly from secret fields depending upon the key. That provides additional protection of the secret data. Also, each share has some bytes missing and these missing bytes can be recovered from a set of exactly k shares. Thus a given byte position can be confirmed for any k shares, but not less than k. Hence k shares are required to give back the secret. As a result, the generated shares are compressed and if k is closer to n then the compression ratio is increased. That provides strong protection of secret data. At the reconstruction phase only when a qualified set of legitimate shares comes together then reconstruction is possible. The proposed scheme is described in detail along with its security analysis, such as key sensitivity analysis and statistical analysis. This scheme has been tested using different images to prove that the scheme has great potential and has a good ability to achieve the confidential security. Source


Sen A.,Bengal Engineering and Science University | Chatterjee T.,Regent Education | DasBit S.,Bengal Engineering and Science University
Wireless Networks | Year: 2016

Nodes in a wireless sensor network (WSN) are generally deployed in unattended environments making them susceptible to attacks. Therefore, the need of defending such attacks is of utmost importance. The challenge in providing security in this network is that the securing mechanism must be lightweight to make it implementable for such resource-constrained nodes. A robust security solution for such networks must facilitate authentication of sensor nodes. So far, only data authentication has drawn much attention from the research community. In this paper, a digital watermark based low-overhead solution (LoWaNA) is proposed for node authentication. The proposed watermarking technique consists of three modules viz. watermark generation, embedding and detection. The robustness of the algorithm is measured in terms of cracking probability and cracking time. This robustness analysis helps us to set the design guideline regarding size of watermark. Performance of the scheme is analyzed in terms of storage, computation and communication overhead. The analytical results are compared with two of the existing schemes and that show significant reduction of all such overheads. Thus it proves the suitability of the proposed scheme for resource-constrained networks like WSN. Finally the entire scheme is simulated in Cooja, the Contiki network simulator to make it readily implementable in real life mote e.g. MICAz. © 2016 Springer Science+Business Media New York Source


Banerjee P.,Indian Institute of Science | Chatterjee T.,Regent Education | Dasbit S.,Indian Institute of Science
2015 International Conference on Advances in Computing, Communications and Informatics, ICACCI 2015 | Year: 2015

Nodes in a wireless sensor network (WSN) are susceptible to various attacks primarily due to their nature of deployment and unguarded communication. Therefore, providing security in such networks is of utmost importance. The main challenge to achieve this is to make the security solution light weight so that it is feasible to implement in such resource constrained nodes in WSN. So far, data authentication has drawn more attention than the node authentication in WSN. A robust security solution for such networks must also facilitate node authentication. In this paper, a low overhead encryption based security solution is proposed for node authentication. The proposed node authentication scheme at the sender side consists of three modules viz. dynamic key generation, encryption and embedding of key hint. Performance of the scheme is primarily analyzed by using two suitably chosen parameters such as cracking probability and cracking time. This evaluation guides us in fixing the size of the unique id of a node so that the scheme incurs low-overhead as well as achieves acceptable robustness. The performance is also compared with a couple of recent works in terms of computation and communication overheads and that confirms our scheme's supremacy over competing schemes in terms of both the metrics. © 2015 IEEE. Source


Chowdhury A.R.,Bengal Engineering and Science University | Chatterjee T.,Regent Education | Dasbit S.,Bengal Engineering and Science University
Procedia Computer Science | Year: 2014

Cryptographic hash functions are used to protect the authenticity of information. Some of the most popular and commonly used cryptographic hash algorithms are MD5, SHA1, RIPEMD. These hash algorithms are used in a wide variety of security applications e.g. securing node/message in traditional networks. However, the commonly used hash algorithms require huge computational overhead which is not affordable by applications in energy-starved network e.g. wireless sensor network (WSN). In these applications the major constraints are communication, computation and storage overheads; out of which communication and computation overheads consume high energy. Keeping this fact in mind, in this paper, a light-weight, one-way, cryptographic hash algorithm is developed with a target to produce a hash-digest with fixed and relatively small length for such an energy-starved wireless network. The primary focus is making the algorithm light-weight so that upon using it in application of network like WSN, the nodes can successfully run the algorithm with low energy. We claim the algorithm fulfils all the basic properties such as preimage resistance, collision resistance of a one-way unkeyed hash function. Finally the comparative usability of the hash algorithm in the said application domain is worked out and that shows the dominance of our scheme over two of the state-of-the-art hashing schemes. © 2014 Published by Elsevier B.V. Source


News Article | July 7, 2014
Site: venturebeat.com

College enrollment and financial aid management tool Regent Education has raised $9 million in its latest round of funding to help colleges handle student enrollment and process the many ways they pay for school. “Increasingly, all types of institutions are turning to non-traditional enrollment models such as non-term, self-paced, and competency-based education to meet students’ changing needs,” Robb Doub, General Partner at New Markets Venture Partners, which has invested in the company, said in a press release. “Regent’s financial aid management system, Regent 8, is the only solution on the market today that can fully support these models.” The funding includes a $4 million raise in equity financing, with New Markets Venture Partners leading the round. New Markets has invested in a number of education tech startups, like Calvert Education Systems, which provides digital lessons for homeschooled kids, and news service Mashable. Ares Capital provided $5 million of debt financing. The company will use the funds to further develop its array of products for administrative tasks.

Discover hidden collaborations