Sapana Rani
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Sapana Rani has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Raju Halder
Department of Computer Science and Engineering, Indian Institute of Technology Patna, Bihta, India
5 shared publications Dileep Kumar Koshley
Indian Institute of Technology Patna
3 shared publicationsRaju Halder
Indian Institute of Technology Patna
2 shared publications- Dileep Kumar Koshley
Indian Institute of Technology Patna
1 shared publication - Preeti Kachhap
Indian Institute of Technology
1 shared publication
Latest Publications
- 8 July 2022
- Published by Elsevier in Expert Systems with Applications
- Vol. 208
An efficient format-independent watermarking framework for large-scale data sets
- 8 July 2022
- Published by Elsevier in Expert Systems with Applications
- Vol. 208
An efficient format-independent watermarking framework for large-scale data sets
- Open Access
- 8 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 27970-27989
Comparative Analysis of Relational Database Watermarking Techniques: An Empirical Study
Digital watermarking is considered one of the most promising techniques to verify the authenticity and integrity of digital data. It is used for a wide range of applications, e.g., copyright protection, tamper detection, traitor tracing, maintaining the integrity of data, etc. In the past two decades, a wide range of algorithms for relational database watermarking has been proposed. Even though a number of surveys exist in the literature, they are unable to provide insightful guidance to choose the right watermarking technique for a given application. In this paper, we provide an exhaustive empirical study and thorough comparative analysis of various relational database watermarking techniques in the literature. Our work is different from the existing survey papers as we consider both distortion-based and distortion-free techniques along with a rigorous experimental analysis demonstrating a detailed comparison on robustness, data usability, and computational cost with considerable empirical evidence.
- 8 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 27970-27989
Open AccessComparative Analysis of Relational Database Watermarking Techniques: An Empirical Study
Digital watermarking is considered one of the most promising techniques to verify the authenticity and integrity of digital data. It is used for a wide range of applications, e.g., copyright protection, tamper detection, traitor tracing, maintaining the integrity of data, etc. In the past two decades, a wide range of algorithms for relational database watermarking has been proposed. Even though a number of surveys exist in the literature, they are unable to provide insightful guidance to choose the right watermarking technique for a given application. In this paper, we provide an exhaustive empirical study and thorough comparative analysis of various relational database watermarking techniques in the literature. Our work is different from the existing survey papers as we consider both distortion-based and distortion-free techniques along with a rigorous experimental analysis demonstrating a detailed comparison on robustness, data usability, and computational cost with considerable empirical evidence.
- 2 December 2017
- Published by Springer Nature
- p. 68-87
Towards Generalization of Privacy Policy Specification and Property-Based Information Leakage
- 2 December 2017
- Published by Springer Nature
- p. 68-87
Towards Generalization of Privacy Policy Specification and Property-Based Information Leakage
- 28 November 2017
- Published by Springer Nature
- p. 172-192
Partitioning-Insensitive Watermarking Approach for Distributed Relational Databases
- 28 November 2017
- Published by Springer Nature
- p. 172-192
Partitioning-Insensitive Watermarking Approach for Distributed Relational Databases
- 1 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5, 729-736
Adapting MapReduce for Efficient Watermarking of Large Relational Dataset
In the era of big-data when volume is increasing at an unprecedented rate, structured data is not an exception from this. A survey in 2013 by TDWI says that, for a quarter of organizations, big-data mostly takes the form of the relational and structured data that comes from traditional applications. In this reality, watermarking of large volume of structured relational dataset using existing watermarking techniques are highly inefficient, and even impractical in the situations when periodic rewatermarking after a certain time frame is necessary. As a remedy of this, in this paper, we adapt MapReduce as an effective distributive way of watermarking of large relational dataset. We show how existing algorithms can easily be converted into an equivalent form in MapReduce paradigm. We present experimental evaluation results on a benchmark dataset to establish the effectiveness of our approach. The results demonstrate significant improvements in watermark generation and detection times w.r.t. existing works in the literature.
- 1 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5, 729-736
Adapting MapReduce for Efficient Watermarking of Large Relational Dataset
In the era of big-data when volume is increasing at an unprecedented rate, structured data is not an exception from this. A survey in 2013 by TDWI says that, for a quarter of organizations, big-data mostly takes the form of the relational and structured data that comes from traditional applications. In this reality, watermarking of large volume of structured relational dataset using existing watermarking techniques are highly inefficient, and even impractical in the situations when periodic rewatermarking after a certain time frame is necessary. As a remedy of this, in this paper, we adapt MapReduce as an effective distributive way of watermarking of large relational dataset. We show how existing algorithms can easily be converted into an equivalent form in MapReduce paradigm. We present experimental evaluation results on a benchmark dataset to establish the effectiveness of our approach. The results demonstrate significant improvements in watermark generation and detection times w.r.t. existing works in the literature.
- 23 October 2016
- Published by Springer Nature
- p. 175-188
A Watermarking Framework for Outsourced and Distributed Relational Databases
- 23 October 2016
- Published by Springer Nature
- p. 175-188
A Watermarking Framework for Outsourced and Distributed Relational Databases
- 19 November 2015
- Published by Springer Nature
- p. 153-171
Data-Flow Analysis-Based Approach of Database Watermarking
- 19 November 2015
- Published by Springer Nature
- p. 153-171
Data-Flow Analysis-Based Approach of Database Watermarking