Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...
The frequent items problem is to process a stream of items and find all items occurring more than a given fraction of the time. It is one of the most heavily studied problems in d...
This paper presents an improved adaptive algorithm for enhanced data hiding under HH-subband Haar Wavelet coefficients of a gray scale host image. The algorithm uses an optimal se...
Stuti Bazaj, Sachin Modi, Anand Mohan, S. P. Singh
Online social networks (OSNs) have experienced tremendous growth in recent years and become a de facto portal for hundreds of millions of Internet users. These OSNs offer attractiv...
The trend of data intensive grid applications has brought grid storage protocols and servers into focus. The objective of this study is to gain an understanding of how time is spen...