{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:53:28Z","timestamp":1760144008155,"version":"build-2065373602"},"reference-count":24,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2024,3,10]],"date-time":"2024-03-10T00:00:00Z","timestamp":1710028800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>We introduce the problem of deceptive information retrieval (DIR), in which a user wishes to download a required file out of multiple independent files stored in a system of databases while deceiving the databases by making the databases\u2019 predictions on the user-required file index incorrect with high probability. Conceptually, DIR is an extension of private information retrieval (PIR). In PIR, a user downloads a required file without revealing its index to any of the databases. The metric of deception is defined as the probability of error of databases\u2019 prediction on the user-required file, minus the corresponding probability of error in PIR. The problem is defined on time-sensitive data that keep updating from time to time. In the proposed scheme, the user deceives the databases by sending real queries to download the required file at the time of the requirement and dummy queries at multiple distinct future time instances to manipulate the probabilities of sending each query for each file requirement, using which the databases\u2019 make the predictions on the user-required file index. The proposed DIR scheme is based on a capacity achieving probabilistic PIR scheme, and achieves rates lower than the PIR capacity due to the additional downloads made to deceive the databases. When the required level of deception is zero, the proposed scheme achieves the PIR capacity.<\/jats:p>","DOI":"10.3390\/e26030244","type":"journal-article","created":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T06:05:30Z","timestamp":1710137130000},"page":"244","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Deceptive Information Retrieval"],"prefix":"10.3390","volume":"26","author":[{"given":"Sajani","family":"Vithana","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Maryland, College Park, MD 20742, USA"}]},{"given":"Sennur","family":"Ulukus","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Maryland, College Park, MD 20742, USA"}]}],"member":"1968","published-online":{"date-parts":[[2024,3,10]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/293347.293350","article-title":"Private Information Retrieval","volume":"45","author":"Chor","year":"1998","journal-title":"J. ACM"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"4075","DOI":"10.1109\/TIT.2017.2689028","article-title":"The Capacity of Private Information Retrieval","volume":"63","author":"Sun","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"7613","DOI":"10.1109\/TIT.2019.2918207","article-title":"Capacity-Achieving Private Information Retrieval Codes with Optimal Message Size and Upload Cost","volume":"65","author":"Tian","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1945","DOI":"10.1109\/TIT.2018.2791994","article-title":"The Capacity of Private Information Retrieval from Coded Databases","volume":"64","author":"Banawan","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"2361","DOI":"10.1109\/TIT.2017.2777490","article-title":"The Capacity of Robust Private Information Retrieval with Colluding Databases","volume":"64","author":"Sun","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"2032","DOI":"10.1109\/TIT.2019.2948845","article-title":"Private Information Retrieval With Side Information","volume":"66","author":"Kadhe","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Li, S., and Gastpar, M. (2020, January 21\u201326). Single-server Multi-message Private Information Retrieval with Side Information: The General Cases. Proceedings of the IEEE ISIT, Los Angeles, CA, USA.","DOI":"10.1109\/ISIT44484.2020.9174126"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2953","DOI":"10.1109\/TIFS.2018.2833050","article-title":"Private information retrieval for secure distributed storage systems","volume":"13","author":"Yang","year":"2018","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"7427","DOI":"10.1109\/TIT.2020.3013152","article-title":"X-Secure T-Private Information Retrieval from MDS Coded Storage with Byzantine and Unresponsive Servers","volume":"66","author":"Jia","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"6842","DOI":"10.1109\/TIT.2018.2828310","article-title":"Multi-Message Private Information Retrieval: Capacity Results and Near-Optimal Schemes","volume":"64","author":"Banawan","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"3198","DOI":"10.1109\/TIT.2018.2884891","article-title":"The Capacity of Private Information Retrieval with Eavesdroppers","volume":"65","author":"Wang","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"4243","DOI":"10.1109\/TIT.2019.2900313","article-title":"Achieving Maximum Distance Separable Private Information Retrieval Capacity with Linear Codes","volume":"65","author":"Kumar","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1109\/TIT.2018.2848977","article-title":"The Capacity of Symmetric Private Information Retrieval","volume":"65","author":"Sun","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"6039","DOI":"10.1109\/TCOMM.2020.3010988","article-title":"Uncoded Placement with Linear Sub-Messages for Private Information Retrieval from Storage Constrained Databases","volume":"68","author":"Woolsey","year":"2020","journal-title":"IEEE Trans. Commun."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1109\/JSTSP.2015.2432740","article-title":"Efficient Private Information Retrieval over Unsynchronized Databases","volume":"9","author":"Fanti","year":"2015","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"5352","DOI":"10.1109\/TIT.2021.3085363","article-title":"Asymmetric Leaky Private Information Retrieval","volume":"67","author":"Samy","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"2999","DOI":"10.1109\/TIFS.2020.2981282","article-title":"On the Information Leakage in Private Information Retrieval Systems","volume":"15","author":"Guo","year":"2020","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Liebowitz, D., Nepal, S., Moore, K., Christopher, C., Kanhere, S., Nguyen, D., Timmer, R., Longland, M., and Rathakumar, K. (2021, January 13\u201315). Deception for Cyber Defence: Challenges and Opportunities. Proceedings of the TPS-ISA, Atlanta, GA, USA.","DOI":"10.1109\/TPSISA52974.2021.00020"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Yarali, A., and Sahawneh, F. (2019, January 10\u201312). Deception: Technologies and Strategy for Cybersecurity. Proceedings of the SmartCloud, Tokyo, Japan.","DOI":"10.1109\/SmartCloud.2019.00029"},{"key":"ref_20","unstructured":"Faveri, C., and Moreira, A. (2016, January 1\u20133). Designing Adaptive Deception Strategies. Proceedings of the QRS-C, Vienna, Austria."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Tounsi, W. (2022, January 24\u201326). Cyber Deception, the Ultimate Piece of a Defensive Strategy\u2014Proof of Concept. Proceedings of the CSNet, Rio de Janeiro, Brazil.","DOI":"10.1109\/CSNet56116.2022.9955605"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Sarr, A., Anwar, A., Kamhoua, C., Leslie, N., and Acosta, J. (2020, January 7\u201311). Software Diversity for Cyber Deception. Proceedings of the IEEE Globecom, Taipei, Taiwan.","DOI":"10.1109\/GLOBECOM42002.2020.9348122"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Samy, I., Tandon, R., and Lazos, L. (2019, January 7\u201312). On the Capacity of Leaky Private Information Retrieval. Proceedings of the IEEE ISIT, Paris, France.","DOI":"10.1109\/ISIT.2019.8849676"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"2635","DOI":"10.1109\/TIT.2021.3136583","article-title":"Semantic Private Information Retrieval","volume":"68","author":"Vithana","year":"2022","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/3\/244\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:11:34Z","timestamp":1760105494000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/3\/244"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,10]]},"references-count":24,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2024,3]]}},"alternative-id":["e26030244"],"URL":"https:\/\/doi.org\/10.3390\/e26030244","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2024,3,10]]}}}