{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T19:15:54Z","timestamp":1776453354612,"version":"3.51.2"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,10,5]],"date-time":"2012-10-05T00:00:00Z","timestamp":1349395200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s11590-012-0572-7","type":"journal-article","created":{"date-parts":[[2012,10,4]],"date-time":"2012-10-04T08:03:53Z","timestamp":1349337833000},"page":"267-277","source":"Crossref","is-referenced-by-count":10,"title":["An inference\u2013proof approach to privacy-preserving horizontally partitioned linear programs"],"prefix":"10.1007","volume":"8","author":[{"given":"Yuan","family":"Hong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaideep","family":"Vaidya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,5]]},"reference":[{"issue":"3","key":"572_CR1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s11590-010-0268-9","volume":"6","author":"OL Mangasarian","year":"2012","unstructured":"Mangasarian, O.L.: Privacy-preserving horizontally partitioned linear programs. Optim. Lett. 6(3), 431\u2013436 (2012)","journal-title":"Optim. Lett."},{"key":"572_CR2","doi-asserted-by":"crossref","unstructured":"Li, W., Li, H., Deng, C.:. Privacy-preserving horizontally partitioned linear programs with inequality constraints. Optim. Lett. doi: 10.1007\/s11590-011-0403-2","DOI":"10.1007\/s11590-011-0403-2"},{"key":"572_CR3","unstructured":"Mangasarian, O.L.: Privacy-preserving linear programming. Optim. Lett. 5(1), 165\u2013172 (2011)"},{"key":"572_CR4","doi-asserted-by":"crossref","unstructured":"Li, J., Atallah, M.J.: Secure and private collaborative linear programming. In: CollaborateCom, pp. 1\u20138 (2006)","DOI":"10.1109\/COLCOM.2006.361848"},{"key":"572_CR5","doi-asserted-by":"crossref","unstructured":"Vaidya, J.: Privacy-preserving linear programming. In: SAC, pp. 2002\u20132007 (2009)","DOI":"10.1145\/1529282.1529729"},{"key":"572_CR6","doi-asserted-by":"crossref","unstructured":"Bednarz, A., Bean, A.N., Roughan, M.: Hiccups on the road to privacy-preserving linear programming. In: WPES \u201909, pp. 117\u2013120 (2009)","DOI":"10.1145\/1655188.1655207"},{"key":"572_CR7","doi-asserted-by":"crossref","unstructured":"Vaidya, J.: A secure revised simplex algorithm for privacy-preserving linear programming. In: AINA \u201909, pp. 347\u2013354 (2009)","DOI":"10.1145\/1529282.1529729"},{"key":"572_CR8","doi-asserted-by":"crossref","unstructured":"Hong, Y., Vaidya, J., Lu, H.: Efficient distributed linear programming with limited disclosure. In: DBSec, pp. 172\u2013187 (2011)","DOI":"10.1007\/978-3-642-22348-8_14"},{"key":"572_CR9","doi-asserted-by":"crossref","unstructured":"Hong, Y., Vaidya, J., Lu, H.: Secure and efficient distributed linear programming. J. Comput. Secur. (2012, to appear)","DOI":"10.3233\/JCS-2012-0452"},{"key":"572_CR10","doi-asserted-by":"crossref","unstructured":"Dreier, J., Kerschbaum, F.: Practical privacy-preserving multiparty linear programming based on problem transformation. In: PASSAT (2011)","DOI":"10.1109\/PASSAT\/SocialCom.2011.19"},{"key":"572_CR11","unstructured":"Du, W.: A study of several specific secure two-party computation problems. Ph.D. thesis, Purdue University, West Lafayette (2001)"},{"issue":"1","key":"572_CR12","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1016\/j.amc.2006.07.076","volume":"185","author":"X Feng","year":"2007","unstructured":"Feng, X., Zhang, Z.: The rank of a random matrix. Appl. Math. Comput. 185(1), 689\u2013694 (2007)","journal-title":"Appl. Math. Comput."},{"key":"572_CR13","doi-asserted-by":"crossref","unstructured":"Sakuma, J., Kobayashi, S.: A genetic algorithm for privacy preserving combinatorial optimization. In: GECCO, pp. 1372\u20131379 (2007)","DOI":"10.1145\/1276958.1277214"},{"key":"572_CR14","doi-asserted-by":"crossref","unstructured":"Hong, Y., Vaidya, J., Lu, H., Shafiq, B.: Privacy-preserving tabu search for distributed graph coloring. In: PASSAT, pp. 951\u2013958 (2011)","DOI":"10.1109\/PASSAT\/SocialCom.2011.116"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0572-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-012-0572-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0572-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T07:52:55Z","timestamp":1562226775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-012-0572-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,5]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["572"],"URL":"https:\/\/doi.org\/10.1007\/s11590-012-0572-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,5]]}}}