Proceedings of the 15th ACM conference on Computer and communications security最新文献_第7页

Cryptographically verified implementations for TLS TLS的加密验证实现

Proceedings of the 15th ACM conference on Computer and communications security Pub Date : 2008-10-27 DOI: 10.1145/1455770.1455828

K. Bhargavan, C. Fournet, R. Corin, E. Zalinescu

引用次数: 117

Session details: Formal methods 2 会话细节:正式方法

Proceedings of the 15th ACM conference on Computer and communications security Pub Date : 2008-10-27 DOI: 10.1145/3260812

A. Fournet

引用次数: 0

Session details: Access control 会话详细信息:访问控制

Proceedings of the 15th ACM conference on Computer and communications security Pub Date : 2008-10-27 DOI: 10.1145/3260810

Ting Yu

引用次数: 0

A class of probabilistic models for role engineering 一类用于角色工程的概率模型

Proceedings of the 15th ACM conference on Computer and communications security Pub Date : 2008-10-27 DOI: 10.1145/1455770.1455809

Mario Frank, D. Basin, J. Buhmann

引用次数: 64

Identity-based encryption with efficient revocation 具有有效撤销的基于身份的加密

Proceedings of the 15th ACM conference on Computer and communications security Pub Date : 2008-10-27 DOI: 10.1145/1455770.1455823

A. Boldyreva, Vipul Goyal, Virendra Kumar

{"title":"Identity-based encryption with efficient revocation","authors":"A. Boldyreva, Vipul Goyal, Virendra Kumar","doi":"10.1145/1455770.1455823","DOIUrl":"https://doi.org/10.1145/1455770.1455823","url":null,"abstract":"Identity-based encryption (IBE) is an exciting alternative to public-key encryption, as IBE eliminates the need for a Public Key Infrastructure (PKI). The senders using an IBE do not need to look up the public keys and the corresponding certificates of the receivers, the identities (e.g. emails or IP addresses) of the latter are sufficient to encrypt. Any setting, PKI- or identity-based, must provide a means to revoke users from the system. Efficient revocation is a well-studied problem in the traditional PKI setting. However in the setting of IBE, there has been little work on studying the revocation mechanisms. The most practical solution requires the senders to also use time periods when encrypting, and all the receivers (regardless of whether their keys have been compromised or not) to update their private keys regularly by contacting the trusted authority. We note that this solution does not scale well -- as the number of users increases, the work on key updates becomes a bottleneck. We propose an IBE scheme that significantly improves key-update efficiency on the side of the trusted party (from linear to logarithmic in the number of users), while staying efficient for the users. Our scheme builds on the ideas of the Fuzzy IBE primitive and binary tree data structure, and is provably secure.","PeriodicalId":440730,"journal":{"name":"Proceedings of the 15th ACM conference on Computer and communications security","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126597020","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}

引用次数: 759

Enforcing authorization policies using transactional memory introspection 使用事务性内存自省强制执行授权策略

Proceedings of the 15th ACM conference on Computer and communications security Pub Date : 2008-10-27 DOI: 10.1145/1455770.1455800

Arnar Birgisson, Mohan Dhawan, Ú. Erlingsson, V. Ganapathy, L. Iftode

引用次数: 39

Session details: Applied cryptography 2 会话详情:应用密码学

Proceedings of the 15th ACM conference on Computer and communications security Pub Date : 2008-10-27 DOI: 10.1145/3260817

P. Golle

引用次数: 0

Computational soundness of observational equivalence 观测等效的计算合理性

Proceedings of the 15th ACM conference on Computer and communications security Pub Date : 2008-06-26 DOI: 10.1145/1455770.1455786

Hubert Comon-Lundh, V. Cortier

引用次数: 96

Multi-use unidirectional proxy re-signatures 多用途单向代理重签名

Proceedings of the 15th ACM conference on Computer and communications security Pub Date : 2008-02-08 DOI: 10.1145/1455770.1455835

Benoît Libert, Damien Vergnaud

{"title":"Multi-use unidirectional proxy re-signatures","authors":"Benoît Libert, Damien Vergnaud","doi":"10.1145/1455770.1455835","DOIUrl":"https://doi.org/10.1145/1455770.1455835","url":null,"abstract":"In 1998, Blaze, Bleumer, and Strauss suggested a cryptographic primitive termed proxy re-signature in which a proxy transforms a signature computed under Alice's secret key into one from Bob on the same message. The proxy is only semi-trusted in that it cannot learn any signing key or sign arbitrary messages on behalf of Alice or Bob. At CCS 2005, Ateniese and Hohenberger revisited this primitive by providing appropriate security definitions and efficient constructions in the random oracle model. Nonetheless, they left open the problem of constructing a multi-use unidirectional scheme where the proxy is only able to translate in one direction and signatures can be re-translated several times. This paper provides the first steps towards efficiently solving this problem, suggested for the first time 10 years ago, and presents the first multi-hop unidirectional proxy re-signature schemes. Although our proposals feature a linear signature size in the number of translations, they are the first multi-use realizations of the primitive that satisfy the requirements of the Ateniese-Hohenberger security model. The first scheme is secure in the random oracle model. Using the same underlying idea, it readily extends into a secure construction in the standard model (i.e. the security proof of which avoids resorting to the random oracle idealization). Both schemes are computationally efficient but require newly defined Diffie-Hellman-like assumptions in bilinear groups.","PeriodicalId":440730,"journal":{"name":"Proceedings of the 15th ACM conference on Computer and communications security","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134099652","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}

引用次数: 102