{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:34:30Z","timestamp":1750307670167,"version":"3.41.0"},"reference-count":51,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2008,10,1]],"date-time":"2008-10-01T00:00:00Z","timestamp":1222819200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Rutgers University Computing Coordination Council Pervasive Computing Initiative","award":["IIS-0219560IIS-0242421IIS-0312357IIS-0325345IIS-0713403"],"award-info":[{"award-number":["IIS-0219560IIS-0242421IIS-0312357IIS-0325345IIS-0713403"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst. Secur."],"published-print":{"date-parts":[[2008,10]]},"abstract":"<jats:p>This article studies the notion of quantitative policies for trust management and gives protocols for realizing them in a disclosure-minimizing fashion. Specifically, Bob values each credential with a certain number of points, and requires a minimum total threshold of points before granting Alice access to a resource. In turn, Alice values each of her credentials with a privacy score that indicates her degree of reluctance to reveal that credential. Bob's valuation of credentials and his threshold are private. Alice's privacy-valuation of her credentials is also private. Alice wants to find a subset of her credentials that achieves Bob's required threshold for access, yet is of as small a value to her as possible. We give protocols for computing such a subset of Alice's credentials without revealing any of the two parties' above-mentioned private information. Furthermore, we develop a fingerprint method that allows Alice to independently and easily recover the optimal knapsack solution, once the computed optimal value is given, but also enables verification of the integrity of the optimal value. The fingerprint method is useful beyond the specific authorization problem studied, and can be applied to any integer knapsack dynamic programming in a private setting.<\/jats:p>","DOI":"10.1145\/1410234.1410240","type":"journal-article","created":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T13:49:43Z","timestamp":1225979383000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":49,"title":["Private Information"],"prefix":"10.1145","volume":"12","author":[{"given":"Danfeng","family":"Yao","sequence":"first","affiliation":[{"name":"Rutgers University"}]},{"given":"Keith B.","family":"Frikken","sequence":"additional","affiliation":[{"name":"Miami University"}]},{"given":"Mikhail J.","family":"Atallah","sequence":"additional","affiliation":[{"name":"Purdue University"}]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[{"name":"Brown University"}]}],"member":"320","published-online":{"date-parts":[[2008,10]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of 7th International Workshop on Algorithms and Data Structures (WADS'01)","volume":"2125","author":"Atallah M. J.","unstructured":"Atallah , M. J. and Du , W . 2001. Secure multi-party computational geometry . In Proceedings of 7th International Workshop on Algorithms and Data Structures (WADS'01) . Lecture Notes in Computer Science , vol. 2125 . Springer Verlag, 165--179. Atallah, M. J. and Du, W. 2001. Secure multi-party computational geometry. In Proceedings of 7th International Workshop on Algorithms and Data Structures (WADS'01). Lecture Notes in Computer Science, vol. 2125. Springer Verlag, 165--179."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11423409_5"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/794198.795088"},{"key":"e_1_2_1_4_1","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the Secure Internet Programming -- Security Issues for Distributed and Mobile Objects","author":"Aura T.","unstructured":"Aura , T. 1999. Distributed access-rights management with delegation certificates . In Proceedings of the Secure Internet Programming -- Security Issues for Distributed and Mobile Objects . Lecture Notes in Computer Science , vol. 1603 . Springer , 211--235. Aura, T. 1999. Distributed access-rights management with delegation certificates. In Proceedings of the Secure Internet Programming -- Security Issues for Distributed and Mobile Objects. Lecture Notes in Computer Science, vol. 1603. Springer, 211--235."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-006-9200-8"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"volume-title":"Proceedings of the 3rd European Symposium on Research in Computer Security (ESORICS'94)","author":"Beth T.","key":"e_1_2_1_7_1","unstructured":"Beth , T. , Borcherding , M. , and Klein , B . 1994. Valuation of trust in open networks . In Proceedings of the 3rd European Symposium on Research in Computer Security (ESORICS'94) . 3--18. Beth, T., Borcherding, M., and Klein, B. 1994. Valuation of trust in open networks. In Proceedings of the 3rd European Symposium on Research in Computer Security (ESORICS'94). 3--18."},{"key":"e_1_2_1_8_1","first-page":"241","article-title":"A uniform framework for regulating service access and information release on the web","volume":"10","author":"Bonatti P. A.","year":"2002","unstructured":"Bonatti , P. A. and Samarati , P. 2002 . A uniform framework for regulating service access and information release on the web . J. Comp. Sci. , 10 , 3, 241 -- 272 . Bonatti, P. A. and Samarati, P. 2002. A uniform framework for regulating service access and information release on the web. J. Comp. Sci., 10, 3, 241--272.","journal-title":"J. Comp. Sci."},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 21st Annual International Cryptology Conference (CRYPTO'01)","volume":"2139","author":"Boneh D.","unstructured":"Boneh , D. and Franklin , M . 2001. Identity-Based Encryption from the Weil Pairing . In Proceedings of the 21st Annual International Cryptology Conference (CRYPTO'01) . Lecture Notes in Computer Science , vol. 2139 . Springer, 213--229. Boneh, D. and Franklin, M. 2001. Identity-Based Encryption from the Weil Pairing. In Proceedings of the 21st Annual International Cryptology Conference (CRYPTO'01). Lecture Notes in Computer Science, vol. 2139. Springer, 213--229."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1030083.1030104"},{"key":"e_1_2_1_11_1","volume-title":"Ed. Lecture Notes in Computer Science","volume":"2045","author":"Camenisch J.","unstructured":"Camenisch , J. and Lysyanskaya , A . 2001. Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation. In Advances in Cryptology (EUROCRYPT'01), B. Pfitzmann , Ed. Lecture Notes in Computer Science , vol. 2045 . Springer Verlag, 93--118. Camenisch, J. and Lysyanskaya, A. 2001. Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation. In Advances in Cryptology (EUROCRYPT'01), B. Pfitzmann, Ed. Lecture Notes in Computer Science, vol. 2045. Springer Verlag, 93--118."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586114"},{"key":"e_1_2_1_13_1","unstructured":"Camp L. J. and Wolfram C. 2004. Pricing security. In Advances in Information Security -- Economics of Information Security. Vol. 12. Kluwer Academic Publishers 17--34.  Camp L. J. and Wolfram C. 2004. Pricing security. In Advances in Information Security -- Economics of Information Security . Vol. 12. Kluwer Academic Publishers 17--34."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62214"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'05)","volume":"2","author":"Chen W.","unstructured":"Chen , W. , Clarke , L. , Kurose , J. , and Towsley , D . 2005. Optimizing cost-sensitive trust-negotiation protocols . In Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'05) . Vol. 2 . 1431--1442. Chen, W., Clarke, L., Kurose, J., and Towsley, D. 2005. Optimizing cost-sensitive trust-negotiation protocols. In Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'05). Vol. 2. 1431--1442."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/647995.742435"},{"key":"e_1_2_1_18_1","unstructured":"Cormen T. H. Leiserson C. E. L.Rivest R. and Stein C. 2001. Introduction to algorithms. MIT Press.   Cormen T. H. Leiserson C. E. L.Rivest R. and Stein C. 2001. Introduction to algorithms . MIT Press."},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptosystems (PKC'01)","author":"Damg\u00e5rd I.","year":"1992","unstructured":"Damg\u00e5rd , I. and Jurik , M . 2001. A generalisation, a simplification and some applications of Paillier's probabilistic public-key system . In Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptosystems (PKC'01) . Lecture Notes in Computer Science 1992 . 119--136. Damg\u00e5rd, I. and Jurik, M. 2001. A generalisation, a simplification and some applications of Paillier's probabilistic public-key system. In Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptosystems (PKC'01). Lecture Notes in Computer Science 1992. 119--136."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586138"},{"volume-title":"Fourth Workshop on the Economics of Information Security (WEIS'05)","author":"Danezis G.","key":"e_1_2_1_21_1","unstructured":"Danezis , G. , Lewis , S. , and Anderson , R . 2005. How much is location privacy worth? In Fourth Workshop on the Economics of Information Security (WEIS'05) . Danezis, G., Lewis, S., and Anderson, R. 2005. How much is location privacy worth? In Fourth Workshop on the Economics of Information Security (WEIS'05)."},{"key":"e_1_2_1_23_1","volume-title":"LNCS","volume":"3027","author":"Freedman M.","unstructured":"Freedman , M. , Nissim , K. , and Pinkas , B . 2004. Efficient private matching and set intersection. In Advances in Cryptology (Eurocrypt'04) . LNCS , vol. 3027 . Springer-Verlag, 1--19. Freedman, M., Nissim, K., and Pinkas, B. 2004. Efficient private matching and set intersection. In Advances in Cryptology (Eurocrypt'04). LNCS, vol. 3027. Springer-Verlag, 1--19."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1029179.1029182"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1029179.1029186"},{"volume-title":"Proceedings of the 13th Annual Network and Distributed System Security Symposium (NDSS'06)","author":"Frikken K. B.","key":"e_1_2_1_26_1","unstructured":"Frikken , K. B. , Li , J. , and Atallah , M. J . 2006. Trust negotiation with hidden credentials, hidden policies, and policy cycles . In Proceedings of the 13th Annual Network and Distributed System Security Symposium (NDSS'06) . Frikken, K. B., Li, J., and Atallah, M. J. 2006. Trust negotiation with hidden credentials, hidden policies, and policy cycles. In Proceedings of the 13th Annual Network and Distributed System Security Symposium (NDSS'06)."},{"key":"e_1_2_1_27_1","unstructured":"Goldreich O. 2002. Secure multi-party computation. Unpublished manuscript.  Goldreich O. 2002. Secure multi-party computation. Unpublished manuscript."},{"volume-title":"The Foundations of Cryptography","author":"Goldreich O.","key":"e_1_2_1_28_1","unstructured":"Goldreich , O. 2004. The Foundations of Cryptography . Vol. 2 . Cambridge University Press . Goldreich, O. 2004. The Foundations of Cryptography. Vol. 2. Cambridge University Press."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/259380.259405"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22178"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005140.1005142"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102120.1102132"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081942"},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Kissner L. and Song D. 2005. Private and threshold set-intersection. In Advances in Cryptology (CRYPTO'05).  Kissner L. and Song D. 2005. Private and threshold set-intersection. In Advances in Cryptology (CRYPTO'05) .","DOI":"10.21236\/ADA461119"},{"volume-title":"Advances in Information Security -- Economics of Information Security.","author":"Landwehr C. E.","key":"e_1_2_1_36_1","unstructured":"Landwehr , C. E. 2004. Improving information flow in the information security market . In Advances in Information Security -- Economics of Information Security. Vol. 12 . Kluwer Academic Publishers , 155--163. Landwehr, C. E. 2004. Improving information flow in the information security market. In Advances in Information Security -- Economics of Information Security. Vol. 12. Kluwer Academic Publishers, 155--163."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102120.1102129"},{"key":"e_1_2_1_38_1","series-title":"Lecture Notes in Computer Science. 416--433.","volume-title":"Advances in Cryptology (Asiacrypt'03)","author":"Lipmaa H.","unstructured":"Lipmaa , H. 2003. Verifiable homomorphic oblivious transfer and private equality test . In Advances in Cryptology (Asiacrypt'03) . Lecture Notes in Computer Science. 416--433. Lipmaa, H. 2003. Verifiable homomorphic oblivious transfer and private equality test. In Advances in Cryptology (Asiacrypt'03). Lecture Notes in Computer Science. 416--433."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756123.1756146"},{"key":"e_1_2_1_40_1","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology (CRYPTO'84)","author":"Shamir A.","unstructured":"Shamir , A. 1984. Identity-based cryptosystems and signature schemes . In Advances in Cryptology (CRYPTO'84) . Lecture Notes in Computer Science , vol. 196 . Springer , 47--53. Shamir, A. 1984. Identity-based cryptosystems and signature schemes. In Advances in Cryptology (CRYPTO'84). Lecture Notes in Computer Science, vol. 196. Springer, 47--53."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/990036.990061"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.2005.58"},{"volume-title":"Proceedings of IEEE Symposium on Security and Privacy (SP'04)","author":"Winsborough W. H.","key":"e_1_2_1_43_1","unstructured":"Winsborough , W. H. and Li , N . 2004. Safety in automated trust negotiation . In Proceedings of IEEE Symposium on Security and Privacy (SP'04) . IEEE Computer Society Press. Winsborough, W. H. and Li, N. 2004. Safety in automated trust negotiation. In Proceedings of IEEE Symposium on Security and Privacy (SP'04). IEEE Computer Society Press."},{"volume-title":"DARPA Information Survivability Conference and Exposition (DARPA'00)","author":"Winsborough W. H.","key":"e_1_2_1_44_1","unstructured":"Winsborough , W. H. , Seamons , K. E. , and Jones , V. E . 2000. Automated trust negotiation . In DARPA Information Survivability Conference and Exposition (DARPA'00) . Vol. I . IEEE Press, 88--102. Winsborough, W. H., Seamons, K. E., and Jones, V. E. 2000. Automated trust negotiation. In DARPA Information Survivability Conference and Exposition (DARPA'00). Vol. I. IEEE Press, 88--102."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/11935308_14"},{"volume-title":"Proceedings of the IFIPTM Joint iTrust and PST Conferences on Privacy, Trust Management and Security (iTRUST'07)","author":"Yao D.","key":"e_1_2_1_47_1","unstructured":"Yao , D. , Tamassia , R. , and Proctor , S . 2007. Private distributed scalar product protocol with application to privacy-preserving computation of trust . In Proceedings of the IFIPTM Joint iTrust and PST Conferences on Privacy, Trust Management and Security (iTRUST'07) . Yao, D., Tamassia, R., and Proctor, S. 2007. Private distributed scalar product protocol with application to privacy-preserving computation of trust. In Proceedings of the IFIPTM Joint iTrust and PST Conferences on Privacy, Trust Management and Security (iTRUST'07)."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/544741.544770"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/352600.352633"},{"volume-title":"Proceedings of IEEE Symposium on Security and Privacy (SP'03)","author":"Yu T.","key":"e_1_2_1_50_1","unstructured":"Yu , T. and Winslett , M . 2003. A unified scheme for resource protection in automated trust negotiation . In Proceedings of IEEE Symposium on Security and Privacy (SP'03) . IEEE Computer Society Press, 110--122. Yu, T. and Winslett, M. 2003. A unified scheme for resource protection in automated trust negotiation. In Proceedings of IEEE Symposium on Security and Privacy (SP'03). IEEE Computer Society Press, 110--122."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/501983.502004"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102219.1102222"}],"container-title":["ACM Transactions on Information and System Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1410234.1410240","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1410234.1410240","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:36Z","timestamp":1750253376000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1410234.1410240"}},"subtitle":["To Reveal or not to Reveal"],"short-title":[],"issued":{"date-parts":[[2008,10]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["10.1145\/1410234.1410240"],"URL":"https:\/\/doi.org\/10.1145\/1410234.1410240","relation":{},"ISSN":["1094-9224","1557-7406"],"issn-type":[{"type":"print","value":"1094-9224"},{"type":"electronic","value":"1557-7406"}],"subject":[],"published":{"date-parts":[[2008,10]]},"assertion":[{"value":"2007-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}