Article ID: | iaor19961520 |
Country: | United States |
Volume: | 41 |
Issue: | 9 |
Start Page Number: | 1549 |
End Page Number: | 1564 |
Publication Date: | Sep 1995 |
Journal: | Management Science |
Authors: | Muralidhar Krishnamurty, Batra Dinesh, Kirs Peeter J. |
Keywords: | computers: information |
Organizations store data regarding their operations, employees, consumers, and suppliers in their databases. Some of the data are considered confidential, and by law, the organization is required to provide appropriate security measures in order to perserve privacy. Yet a number of companies have little or no security measures. The reason for this lack of security may, at least in part, be attributed to a lack of awareness and empirical evidence about the relative effectiveness of secruity mechanisms. This study investigates the effectiveness of different security mechanisms for protecting numerical database attributes. The trade-off between security, accessibility, and accuracy are examined. A comparison of different secrutiy mechanisms reveals that fixed data perturbation is preferred because it maximizes both security and accessibility. An investigation of the different approaches to fixed data perturbation indicates that multiplicative method best meets these criteria.