On Improving the Performance of RoleBased Cascaded Delegation关于提高基于角色的级联授权的性能研究.pptVIP

Point-Based Trust: Define How Much Privacy is Worth Danfeng Yao Keith B. Frikken Brown University Miami University Mikhail J. Atallah Roberto Tamassia Purdue University Brown University Outline of the talk Protecting private information Trust negotiation protocols [Winsborough Seamons Jones 00, Yu Ma Winslett 00, Winsborough Li 02, Li Du Boneh 03] Our goals Prevent pre-mature information leaking by both parties Credentials should be exchanged only if services can be established Support some kind of cumulative privacy quantitatively Disclosing more credentials should incur higher privacy loss Support flexible service model Allow customized (or personalized) access policies Adjustable services based on qualifications What can we learn from New York State DMV? Another motivation – adjustable services Point-based authorization model Credential type C1, C2, …, Cn The service provider defines Point values p1, p2, …, pn of credentials ----- private Threshold T for accessing a resource ----- private The user defines sensitivity scores a1, a2, …, an of credentials ----- private Credential selection problem The user (or client) wants to satisfy threshold T with the minimum disclosure of privacy Example Where do points come from? Reputation systems [Beth Borcherding Klein 94, Tran Hitchens Varadharajan Watters 05, Zouridaki Mark Hejmo Thomas 2005] This is future work, but here is an idea Converting CSP into a knapsack problem Defines binary vector y1, y2, …, yn, where yi = 1 – xi {ai}: Private to user {pi }: Private to provider Dynamic programming of knapsack problem Overview of privacy-preserving knapsack computation Uses 2-party maximization protocol [Frikken Atallah 04] Uses homomorphic encryption scheme E(x)E(y) = E(x + y) E(x)c = E(xc) Preserves privacy for both Two phases: table-filling and traceback Preliminary: 2-party maximization protocol in a split format Our protocol for dynamic programming of 0/1 knapsack problem Computed entries are encry