Rituparna Chaki

Bio: Rituparna Chaki is an academic researcher from University of Calcutta. The author has contributed to research in topics: Routing protocol & Wireless sensor network. The author has an hindex of 16, co-authored 131 publications receiving 1514 citations. Previous affiliations of Rituparna Chaki include Calcutta Institute of Engineering and Management & Information Technology University.

Applied Computation and Security Systems - Volume Two

Abstract: This book contains the extended version of the works that have been presented and discussed in the First International Doctoral Symposium on Applied Computation and Security Systems (ACSS 2014) held during April 18-20, 2014 in Kolkata, India. The symposium has been jointly organized by the AGH University of Science & Technology, Cracow, Poland and University of Calcutta, India. The Volume I of this double-volume book contains fourteen high quality book chapters in three different Parts.Part 1is on Pattern Recognition and it presents four chapters.Part 2is on Imaging and Healthcare Applications contains four more book chapters. ThePart 3of this volume is on Wireless Sensor Networking and it includes as many as six chapters. Volume II of the book has threeParts presenting a total of eleven chapters in it.Part 4consists of five excellent chapters on Software Engineering ranging from cloud service design to transactional memory.Part 5in Volume II is on Cryptography with two book chapters in it.Part6of this volume is on Computer Aided Design with four chapters in it. We strongly believe that the twenty five chapters in these two volumes of Applied Computation and Security Systems will be appreciated by all its readers.

Comparative Performance Analysis of AESCRT Using NS2

Abstract: MANETs are normally used in applications which are highly confidential in nature, such as defense, disaster management, etc Secure data transmission is one of the challenging issues in MANET Secret sharing has been one of the popular techniques for implementing security in MANETs The existing logics for securing the packet delivery seem to involve too many control signal interchanges This paper discusses the performance of a multiple agent based secured routing scheme to detect secure routes with minimum load on the network The Chinese remainder theorem is used in generating the secure key by the source node Source node shares the secure key among all probable routes using multiple agents The three phased approach is aimed to increase the overall performance in the network Performance metrics which are used to evaluate the performance of AESCRT are delivery rate, load, malicious nodes and packet dropped Simulation analysis shows that performance of AESCRT give better result compared to other existing routing protocols

Design of a scalable logical topology for reliable optical communication

Abstract: This paper presents a new logical topology Excube-net, based on the properties of hypercube network for enhancing the reliability of optical networks using wavelength division multiplexing. The presence of multiple number of paths between any two nodes in exchange of reasonable number of hops in the network, ensures a higher degree of reliability compared to other existing topologies in case of link failure, as well as in balancing link loading in the network so as to maximise the network throughput.

Dynamic Prioritization of Software Requirements for Incremental Software Development

Abstract: Requirements keep changing within an evolving business environment. In incremental software development, where functionalities are identified and delivered incrementally, a need is felt toward capturing and analyzing the impact of the changes in the system development process. This may require refactoring the order of the development of the system components based on newly added dependencies and conflicts among functional and non-functional requirements. In this paper, we propose a dynamic framework that re-prioritizes the requirements based on newly added (and updated) requirement dependencies and conflicts. We also provide an effective tool for our framework that supports software developers during incremental delivery within a changing business environment.

Implementing Software Transactional Memory Using STM Haskell

Abstract: Software transaction memory (STM) is a promising programming abstract for shared variable concurrency. This paper presents a brief description of one of the recently proposed STM and addresses the need of STM implementation. The paper also describes the implementation technique of STM in STM Haskell. In the STM implementation process, three different approaches have been presented which employ different execution policies. In the evaluation process, transactions with varying execution length are being considered which are executed in multi-threaded environment. The experimental results show an interesting outcome which focuses on the future direction of research for STM implementation.

PORs: Proofs of Retrievability for Large Files

Abstract: In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier) can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient for the user to recover F in its entirety.A POR may be viewed as a kind of cryptographic proof of knowledge (POK), but one specially designed to handle a large file (or bitstring) F. We explore POR protocols here in which the communication costs, number of memory accesses for the prover, and storage requirements of the user (verifier) are small parameters essentially independent of the length of F. In addition to proposing new, practical POR constructions, we explore implementation considerations and optimizations that bear on previously explored, related schemes.In a POR, unlike a POK, neither the prover nor the verifier need actually have knowledge of F. PORs give rise to a new and unusual security definition whose formulation is another contribution of our work.We view PORs as an important tool for semi-trusted online archives. Existing cryptographic techniques help users ensure the privacy and integrity of files they retrieve. It is also natural, however, for users to want to verify that archives do not delete or modify files prior to retrieval. The goal of a POR is to accomplish these checks without users having to download the files themselves. A POR can also provide quality-of-service guarantees, i.e., show that a file is retrievable within a certain time bound.