IDEAS home Printed from https://ideas.repec.org/a/inm/orisre/v31y2020i2p473-490.html
   My bibliography  Save this article

Hiding Sensitive Information when Sharing Distributed Transactional Data

Author

Listed:
  • Abhijeet Ghoshal

    (University of Illinois at Urbana–Champaign, Champaign, Illinois 61820;)

  • Jing Hao

    (JCPenney, Plano, Texas 75024;)

  • Syam Menon

    (The University of Texas at Dallas, Richardson, Texas 75083)

  • Sumit Sarkar

    (The University of Texas at Dallas, Richardson, Texas 75083)

Abstract

Retailers have been sharing transactional data with supply chain partners for a long time to the benefit of all involved. However, many are still reluctant to share, and there is evidence that the extent of sharing would be greater if information sensitive to retailers is concealed before data are shared. Although there has been considerable research into methods to hide sensitive information from transactional data, extant research has focused only on sensitive information at the organizational level. This is rarely the case in reality; the retail industry has recognized and adapted their offerings to region-wide differences in customer tastes for decades, and when stores offer a mix of standardized and customized products, the differences in customer characteristics across regions lead to sensitive information that is region-specific in addition to sensitive information at the organizational level. To date, this version of the problem has been overlooked, and no effective methods exist to solve it; this paper fills that gap. Although some existing approaches can be adapted to this more realistic context, the existence of region-level requirements substantially increases the size of an already difficult (NP-hard) problem to be solved, making such adaptations impractical. Traditional decomposition-based approaches, such as Lagrangian relaxation, are not viable either as they require the repeated solution of NP-hard problems involving millions of variables multiple times. In this paper, we present an ensemble approach that draws intuition from Lagrangian relaxation to maximize the accuracy of a shared transactional dataset. Extensive computational experiments show that this approach not only identifies near-optimal solutions, it can do so even when other approaches fail. We also show that the precision of recommendations made using datasets that have been modified using the ensemble approach is not statistically different from that of recommendations made using the original datasets; this demonstrates that using the ensemble approach to hide sensitive information before sharing transactional data has negligible negative impact.

Suggested Citation

  • Abhijeet Ghoshal & Jing Hao & Syam Menon & Sumit Sarkar, 2020. "Hiding Sensitive Information when Sharing Distributed Transactional Data," Information Systems Research, INFORMS, vol. 31(2), pages 473-490, June.
  • Handle: RePEc:inm:orisre:v:31:y:2020:i:2:p:473-490
    DOI: 10.1287/isre.2019.0898
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/isre.2019.0898
    Download Restriction: no

    File URL: https://libkey.io/10.1287/isre.2019.0898?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Ying-Ju Chen & Mingcherng Deng, 2015. "Information Sharing in a Manufacturer–Supplier Relationship: Suppliers' Incentive and Production Efficiency," Production and Operations Management, Production and Operations Management Society, vol. 24(4), pages 619-633, April.
    2. Krishnan S. Anand & Haim Mendelson, 1997. "Information and Organization for Horizontal Multimarket Coordination," Management Science, INFORMS, vol. 43(12), pages 1609-1627, December.
    3. Syam Menon & Sumit Sarkar, 2007. "Minimizing Information Loss and Preserving Privacy," Management Science, INFORMS, vol. 53(1), pages 101-116, January.
    4. Syam Menon & Sumit Sarkar & Shibnath Mukherjee, 2005. "Maximizing Accuracy of Shared Databases when Concealing Sensitive Patterns," Information Systems Research, INFORMS, vol. 16(3), pages 256-270, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Fu-Hsiang Chen & Ming-Fu Hsu & Kuang-Hua Hu, 2022. "Enterprise’s internal control for knowledge discovery in a big data environment by an integrated hybrid model," Information Technology and Management, Springer, vol. 23(3), pages 213-231, September.
    2. Arora, Ayesha & Jain, Tarun, 2024. "Data sharing between platform and seller: An analysis of contracts, privacy, and regulation," European Journal of Operational Research, Elsevier, vol. 313(3), pages 1105-1118.
    3. Tiwari, Sunil & Sharma, Pankaj & Choi, Tsan-Ming & Lim, Andrew, 2023. "Blockchain and third-party logistics for global supply chain operations: Stakeholders’ perspectives and decision roadmap," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 170(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Peng Cheng & Chun-Wei Lin & Jeng-Shyang Pan, 2015. "Use HypE to Hide Association Rules by Adding Items," PLOS ONE, Public Library of Science, vol. 10(6), pages 1-19, June.
    2. Syam Menon & Abhijeet Ghoshal & Sumit Sarkar, 2022. "Modifying Transactional Databases to Hide Sensitive Association Rules," Information Systems Research, INFORMS, vol. 33(1), pages 152-178, March.
    3. Maximilian Klöckner & Christoph G. Schmidt & Stephan M. Wagner, 2022. "When Blockchain Creates Shareholder Value: Empirical Evidence from International Firm Announcements," Production and Operations Management, Production and Operations Management Society, vol. 31(1), pages 46-64, January.
    4. Yi Tao & Loo Hay Lee & Ek Peng Chew, 2016. "Quantifying the Effect of Sharing Information in a Supply Chain Facing Supply Disruptions," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(04), pages 1-28, August.
    5. Krishnan S. Anand & Manu Goyal, 2019. "Ethics, Bounded Rationality, and IP Sharing in IT Outsourcing," Management Science, INFORMS, vol. 65(11), pages 5252-5267, November.
    6. Ling Xue & Gautam Ray & Bin Gu, 2011. "Environmental Uncertainty and IT Infrastructure Governance: A Curvilinear Relationship," Information Systems Research, INFORMS, vol. 22(2), pages 389-399, June.
    7. Sebastian Saniuk & Sandra Grabowska & Bożena Gajdzik, 2020. "Social Expectations and Market Changes in the Context of Developing the Industry 4.0 Concept," Sustainability, MDPI, vol. 12(4), pages 1-21, February.
    8. Kostas Bimpikis & Ozan Candogan & Shayan Ehsani, 2019. "Supply Disruptions and Optimal Network Structures," Management Science, INFORMS, vol. 65(12), pages 5504-5517, December.
    9. Haim Mendelson, 2000. "Organizational Architecture and Success in the Information Technology Industry," Management Science, INFORMS, vol. 46(4), pages 513-529, April.
    10. Chunping Deng & Fanchen Kong & Rong Zhu & Chun Sun, 2024. "Balance or not: configuring absorbed and unabsorbed slack resources to achieve supply chain resilience," Operations Management Research, Springer, vol. 17(4), pages 1509-1530, December.
    11. Connelly, Brian L. & Shi, Wei & Cheng, Xin & Yin, Cheng, 2021. "Short Sellers: A screening theory perspective on B2B relationships," Journal of Business Research, Elsevier, vol. 134(C), pages 393-404.
    12. Myong-Hun Chang & Joseph E. Harrington, 2000. "Centralization vs. Decentralization in a Multi-Unit Organization: A Computational Model of a Retail Chain as a Multi-Agent Adaptive System," Management Science, INFORMS, vol. 46(11), pages 1427-1440, November.
    13. Singham, Dashi I. & Cai, Wenbo & Fügenschuh, Armin, 2021. "Flexible contracting with heterogeneous agents and stochastic demand," International Journal of Production Economics, Elsevier, vol. 231(C).
    14. Weixin Shang & Albert Y. Ha & Shilu Tong, 2016. "Information Sharing in a Supply Chain with a Common Retailer," Management Science, INFORMS, vol. 62(1), pages 245-263, January.
    15. Xuchuan Yuan & Tinglong Dai & Lucy Gongtao Chen & Srinagesh Gavirneni, 2021. "Co-Opetition in Service Clusters with Waiting-Area Entertainment," Manufacturing & Service Operations Management, INFORMS, vol. 23(1), pages 106-122, 1-2.
    16. Yi Qian & Hui Xie, 2013. "Drive More Effective Data-Based Innovations: Enhancing the Utility of Secure Databases," NBER Working Papers 19586, National Bureau of Economic Research, Inc.
    17. Yang, Jinyu & Zhang, Wenqing & Zhao, Xiande, 2024. "How can suppliers strategically involve downstream manufacturers in research and development collaboration? A knowledge spillover perspective," European Journal of Operational Research, Elsevier, vol. 314(1), pages 122-135.
    18. Samaddar, Subhashish & Nargundkar, Satish & Daley, Marcia, 2006. "Inter-organizational information sharing: The role of supply network configuration and partner goal congruence," European Journal of Operational Research, Elsevier, vol. 174(2), pages 744-765, October.
    19. Lode Li, 2002. "Information Sharing in a Supply Chain with Horizontal Competition," Management Science, INFORMS, vol. 48(9), pages 1196-1212, September.
    20. Sulin Ba & Barrie R. Nault, 2017. "Emergent Themes in the Interface Between Economics of Information Systems and Management of Technology," Production and Operations Management, Production and Operations Management Society, vol. 26(4), pages 652-666, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orisre:v:31:y:2020:i:2:p:473-490. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.