Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Rathindra Sarathy

dblp:21/2840 · DBLP profile ↗
← Back
20ranked-venue papers
2as first author
1since 2021 · last 2025
0000-0001-7352-2676ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 8 · 1 first-author · 1 since 2021Security and privacy · 7 · 1 first-authorDatabases, data management, data science and information retrieval · 4Human-computer interaction and ubiquitous computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Privacy and data protection · 100%
Databases, data mining, and information retrieval
1 paper
Database system architecture and tuning · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Privacy and data protection › privacy protection mechanisms
inference attack defense
0.011999
Security of Random Data Perturbation Methods · ACM Trans. Database Syst. 1999
Privacy and data protection › statistical database privacy
random data perturbation
0.011999
Security of Random Data Perturbation Methods · ACM Trans. Database Syst. 1999
Privacy and data protection
statistical database privacy
0.011999
Security of Random Data Perturbation Methods · ACM Trans. Database Syst. 1999
Database system architecture and tuning › analytical database system
statistical database
0.011999
Security of Random Data Perturbation Methods · ACM Trans. Database Syst. 1999

Methods — techniques the papers use, named apart from their topics

statistical inference analysis · 0.0
YearPublicationVenuePosition
2025 Is seeing the same as doing? An evaluation of vicarious experiences in the metaverse
Caleb Krieger, Andy Luse, Ghazal Abdolhossein Khani, Rathindra Sarathy
Decis. Support Syst.4
2019 The Engagement of Website Initial Aesthetic Impressions: An Experimental Investigation
abstract
This study investigates how website design features, web page order and visual complexity, influence users’ initial website aesthetic impressions and how such impressions subsequently enhance engagement and intention to use the website. A laboratory experiment was conducted to test the hypotheses using different levels of web page order (high vs. low), visual complexity (high vs. low), and exposure time (one-second vs. no-time-constraint). Overall, the results from structural equation modeling (SEM) analysis suggest that web page order significantly influences visual appeal, engagement, and intention. In addition, the results of multigroup SEM analysis reveal that users evaluate website design very quickly (within 1 s), and that these evaluations remain remarkably consistent over time.
Supavich Pengnate, Rathindra Sarathy, JinKyu Lee 0003
Int. J. Hum. Comput. Interact.2
2018 Self-control, organizational context, and rational choice in Internet abuses at work
Han Li 0001, Xin (Robert) Luo, Jie Zhang 0023, Rathindra Sarathy
Inf. Manag.4
2016 Secure attribute sharing of linked microdata
Krishnamurty Muralidhar, Rathindra Sarathy, Han Li 0001
Decis. Support Syst.2
2016 The effect of product review balance and volume on online Shoppers' risk perception and purchase intention
Rathindra Sarathy, JinKyu Lee 0003
Decis. Support Syst.2
2014 Controlled Shuffling, Statistical Confidentiality and Microdata Utility: A Successful Experiment with a 10% Household Sample of the 2011 Population Census of Ireland for the IPUMS-International Database
Robert McCaa, Krishnamurty Muralidhar, Rathindra Sarathy, Michael Comerford, Albert Esteve-Palos
Privacy in Statistical Databases3
2014 Reverse Mapping to Preserve the Marginal Distributions of Attributes in Masked Microdata
Krishnamurty Muralidhar, Rathindra Sarathy, Josep Domingo-Ferrer
Privacy in Statistical Databases2
2014 Examining the decision to use standalone personal health record systems as a trust-enabled fair social contract
Han Li 0001, Ashish Gupta 0004, Jie Zhang 0023, Rathindra Sarathy
Decis. Support Syst.4
2014 Evaluating Re-Identification Risks of Data Protected by Additive Data Perturbation
abstract
Commercial organizations and government agencies that gather, store, share and disseminate data are facing increasing concerns over individual privacy and confidentiality. Confidential data is often masked in the database or prior to release to a third party, through methods such as data perturbation. In this study, re-identification risks of three major additive data perturbation techniques were compared using two different record linkage techniques. The results suggest that re-identification risk of Kim's multivariate noise addition method is similar to that of simple noise addition method. The general additive perturbation method (GADP) has the lowest re-identification risk and therefore provides the highest level of protection. The study also suggests that Fuller's method of assessing re-identification risk may be better suited than the probabilistic record-linkage method of Winkler, for numeric data. The results of this study should be help organizations and government agencies choose an appropriate additive perturbation technique.
Han Li 0001, Krishnamurty Muralidhar, Rathindra Sarathy, Xin (Robert) Luo
J. Database Manag.3
2012 An Investigation of Model-Based Microdata Masking for Magnitude Tabular Data Release
Mario Trottini, Krishnamurty Muralidhar, Rathindra Sarathy
Privacy in Statistical Databases3
2012 Statistical Dependence as the Basis for a Privacy Measure for Microdata Release
abstract
Government agencies and other organizations commonly release or share microdata for purposes of analysis. In many cases, microdata release needs to preserve the privacy of individuals and/or sensitive attributes. Current measures of privacy of released microdata are often based on empirical assessments of identity and value disclosure. The disadvantage of empirical assessments of privacy is that their results cannot be generalized with confidence across datasets or protection methods. While theoretical definitions of privacy are available for other methods of data release such as query-response output perturbation systems, they are unsuitable for the microdata release context. This study proposes a theoretical basis for measuring privacy in the microdata release context based on statistical dependence. Using this theoretical basis, we develop practical privacy measures that possess several desirable properties, including generalizability. We illustrate the conceptual benefits of this approach and also show that a privacy measure based on statistical dependence can be used effectively for assessing privacy in microdata
Krishnamurty Muralidhar, Rathindra Sarathy
Int. J. Uncertain. Fuzziness Knowl. Based Syst.2
2011 The role of affect and cognition on online consumers' decision to disclose personal information to unfamiliar online vendors
Han Li 0001, Rathindra Sarathy
Decis. Support Syst.2
2010 Does Differential Privacy Protect Terry Gross' Privacy?
Krishnamurty Muralidhar, Rathindra Sarathy
Privacy in Statistical Databases2
2010 Some Additional Insights on Applying Differential Privacy for Numeric Data
Rathindra Sarathy, Krishnamurty Muralidhar
Privacy in Statistical Databases1
2010 Understanding compliance with internet use policy from the perspective of rational choice theory
Han Li 0001, Jie Zhang 0023, Rathindra Sarathy
Decis. Support Syst.3
2010 Understanding Situational Online Information Disclosure as a Privacy Calculus
Han Li 0001, Rathindra Sarathy
J. Comput. Inf. Syst.2
2008 A Preliminary Investigation of the Impact of Gaussian Versus t-Copula for Data Perturbation
Mario Trottini, Krishnamurty Muralidhar, Rathindra Sarathy
Privacy in Statistical Databases3
2006 Why Swap When You Can Shuffle? A Comparison of the Proximity Swap and Data Shuffle for Numeric Data
Krishnamurty Muralidhar, Rathindra Sarathy, Ramesh A. Dandekar
Privacy in Statistical Databases2
2006 Secure and useful data sharing
Rathindra Sarathy, Krishnamurty Muralidhar
Decis. Support Syst.1
1999 Security of Random Data Perturbation Methods
abstract
Statistical databases often use random data perturbation (RDP) methods to protect against disclosure of confidential numerical attributes. One of the key requirements of RDP methods is that they provide the appropriate level of security against snoopers who attempt to obtain information on confidential attributes through statistical inference. In this study, we evaluate the security provided by three methods of perturbation. The results of this study allow the database administrator to select the most effective RDP method that assures adequate protection against disclosure of confidential information.
Krishnamurty Muralidhar, Rathindra Sarathy
ACM Trans. Database Syst.2