Symposium on Identity and Trust on the Internet最新文献

Practical and secure trust anchor management and usage 实用安全的信任锚的管理和使用

Symposium on Identity and Trust on the Internet Pub Date : 2010-04-13 DOI: 10.1145/1750389.1750403

C. Wallace, G. Beier

引用次数: 5

A proposal for collaborative internet-scale trust infrastructures deployment: the public key system (PKS) 协同互联网规模信任基础设施部署方案:公钥系统(public key system, PKS)

Symposium on Identity and Trust on the Internet Pub Date : 2010-04-13 DOI: 10.1145/1750389.1750404

Massimiliano Pala

引用次数: 7

Privacy-preserving DRM DRM保护隐私

Symposium on Identity and Trust on the Internet Pub Date : 2010-04-13 DOI: 10.1145/1750389.1750399

R. Perlman, C. Kaufman, Ray A. Perlner

引用次数: 25

CardSpace-liberty integration for CardSpace users 为CardSpace用户集成CardSpace-liberty

Symposium on Identity and Trust on the Internet Pub Date : 2010-04-13 DOI: 10.1145/1750389.1750392

H. Al-Sinani, Waleed A. Alrodhan, C. Mitchell

引用次数: 18

Computational techniques for increasing PKI policy comprehension by human analysts 提高人类分析人员对PKI策略理解的计算技术

Symposium on Identity and Trust on the Internet Pub Date : 2010-04-13 DOI: 10.1145/1750389.1750396

G. Weaver, S. A. Rea, Sean W. Smith

引用次数: 3

An attribute-based authorization policy framework with dynamic conflict resolution 具有动态冲突解决功能的基于属性的授权策略框架

Symposium on Identity and Trust on the Internet Pub Date : 2010-04-13 DOI: 10.1145/1750389.1750395

A. Mohan, D. Blough

{"title":"An attribute-based authorization policy framework with dynamic conflict resolution","authors":"A. Mohan, D. Blough","doi":"10.1145/1750389.1750395","DOIUrl":"https://doi.org/10.1145/1750389.1750395","url":null,"abstract":"Policy-based authorization systems are becoming more common as information systems become larger and more complex. In these systems, to authorize a requester to access a particular resource, the authorization system must verify that the policy authorizes the access. The overall authorization policy may consist of a number of policy groups, where each group consists of policies defined by different entities. Each policy contains a number of authorization rules. The access request is evaluated against these policies, which may produce conflicting authorization decisions. To resolve these conflicts and to reach a unique decision for the access request at the rule and policy level, rule and policy combination algorithms are used. In the current systems, these rule and policy combination algorithms are defined on a static basis during policy composition, which is not desirable in dynamic systems with fast changing environments.\u0000 In this paper, we motivate the need for changing the rule and policy combination algorithms dynamically based on contextual information. We propose a framework that supports this functionality and also eliminates the need to recompose policies if the owner decides to change the combination algorithm. It provides a novel method to dynamically add and remove specialized policies, while retaining the clarity and modularity in the policies. The proposed framework also provides a mechanism to reduce the set of potential target matches, thereby increasing the efficiency of the evaluation mechanism. We developed a prototype system to demonstrate the usefulness of this framework by extending some basic capabilities of the XACML policy language. We implemented these enhancements by adding two specialized modules and several new combination algorithms to the Sun XACML engine.","PeriodicalId":269454,"journal":{"name":"Symposium on Identity and Trust on the Internet","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127094988","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 50

Efficient and privacy-preserving enforcement of attribute-based access control 高效且保护隐私的基于属性的访问控制

Symposium on Identity and Trust on the Internet Pub Date : 2010-04-13 DOI: 10.1145/1750389.1750398

Ning Shang, F. Paci, E. Bertino

{"title":"Efficient and privacy-preserving enforcement of attribute-based access control","authors":"Ning Shang, F. Paci, E. Bertino","doi":"10.1145/1750389.1750398","DOIUrl":"https://doi.org/10.1145/1750389.1750398","url":null,"abstract":"Modern access control models, developed for protecting data from accesses across the Internet, require to verify the identity of users in order to make sure that users have the required permissions for accessing the data. User's identity consists of data, referred to as identity attributes, that encode relevant-security properties of the users. Because identity attributes often convey sensitive information about users, they have to be protected. The Oblivious Commitment-Based Envelope (OCBE) protocols address the protection requirements of both users and service providers. The OCBE protocols makes it possible for a party, referred as sender, to send an encrypted message to a receiver such that the receiver can open the message if and only if its committed value satisfies a predicate and that the sender does not learn anything about the receiver's committed value. The possible predicates are comparison predicates =, ≠, >, <, ≤, ≥. In this paper, we present an extension that improves the efficiency of EQ-OCBE protocol, that is, the OCBE protocol for equality predicates. Our extension allows a party to decrypt data sent by a service provider if and only if the party satisfies all the equality conditions in the access control policy.","PeriodicalId":269454,"journal":{"name":"Symposium on Identity and Trust on the Internet","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128137584","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Biometrics-based identifiers for digital identity management 用于数字身份管理的基于生物特征的标识符

Symposium on Identity and Trust on the Internet Pub Date : 2010-04-13 DOI: 10.1145/1750389.1750401

Abhilasha Bhargav-Spantzel, A. Squicciarini, E. Bertino, Xiangwei Kong, Weike Zhang

{"title":"Biometrics-based identifiers for digital identity management","authors":"Abhilasha Bhargav-Spantzel, A. Squicciarini, E. Bertino, Xiangwei Kong, Weike Zhang","doi":"10.1145/1750389.1750401","DOIUrl":"https://doi.org/10.1145/1750389.1750401","url":null,"abstract":"We present algorithms to reliably generate biometric identifiers from a user's biometric image which in turn is used for identity verification possibly in conjunction with cryptographic keys. The biometric identifier generation algorithms employ image hashing functions using singular value decomposition and support vector classification techniques. Our algorithms capture generic biometric features that ensure unique and repeatable biometric identifiers. We provide an empirical evaluation of our techniques using 2569 images of 488 different individuals for three types of biometric images; namely fingerprint, iris and face. Based on the biometric type and the classification models, as a result of the empirical evaluation we can generate biometric identifiers ranging from 64 bits up to 214 bits. We provide an example use of the biometric identifiers in privacy preserving multi-factor identity verification based on zero knowledge proofs. Therefore several identity verification factors, including various traditional identity attributes, can be used in conjunction with one or more biometrics of the individual to provide strong identity verification. We also ensure security and privacy of the biometric data. More specifically, we analyze several attack scenarios. We assure privacy of the biometric using the one-way hashing property, in that no information about the original biometric image is revealed from the biometric identifier.","PeriodicalId":269454,"journal":{"name":"Symposium on Identity and Trust on the Internet","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127636009","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 14

Federated login to TeraGrid 联合登录到TeraGrid

Symposium on Identity and Trust on the Internet Pub Date : 2010-04-13 DOI: 10.1145/1750389.1750391

J. Basney, Terry Fleury, Von Welch

引用次数: 17

Quantum resistant public key cryptography: a survey 抗量子公钥密码学:综述

Symposium on Identity and Trust on the Internet Pub Date : 2009-04-14 DOI: 10.1145/1527017.1527028

Ray A. Perlner, D. Cooper

引用次数: 108