检索结果-内蒙古大学图书馆

An efficient flexible hierarchical access control scheme enabling real-life exceptions

SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES 2022年第1期47卷 1-13页

作者： Lal, Sumit Kumar, Naveen Indian Inst Informat Technol Vadodara India

Most organizations today inherently followed hierarchical access control implemented using a hierarchical key assignment scheme (HKAS). An HKAS enforce reflexive, anti-symmetric, and transitive relations among the nodes (or access classes) in the hierarchy. In real life, the organizations come across rare but practical situations such as anti-symmetric exception, the temporary delegation of access to a user, etc. The traditional HKASs are costly and are not readily implement these exceptions. It motivates to relook at redesigning existing HKASs that efficiently incorporate and revokes the exceptions into the existing hierarchy as and when needed. The current similar work uses asymmetric key cryptosystem to implement the flexible HKAS with exceptions. This work proposes a novel and efficient symmetric key-based flexible HKAS that efficiently addresses the flexible hierarchy requirements. To the best of our knowledge, this is the first symmetric key-based flexible HKAS enabling exceptions. The dynamics of the scheme are addressed and compared with the other similar existing schemes. The security of the new HKAS is analyzed formally against a stronger and modern security notion known as key-indistinguishability.

关键词： Flexible hierarchical access control key assignment scheme key-indistinguishability

来源：评论

学校读者我要写书评

暂无评论

A Framework for the Cryptographic Enforcement of Information Flow Policies 22

A Framework for the Cryptographic Enforcement of Information...

引用

22nd ACM Symposium on Access Control Models and Technologies (SACMAT)

作者： Alderman, James Crampton, Jason Farley, Naomi Royal Holloway Univ London Informat Secur Grp Egham TW20 0EX Surrey England

ISBN: (纸本)9781450347020

It is increasingly common to outsource data storage to untrusted, third party (e.g. cloud) servers. However, in such settings, low-level online reference monitors may not be appropriate for enforcing read access, and thus cryptographic enforcement schemes (CESs) may be required. Much of the research on cryptographic access control has focused on the use of specific primitives and, primarily, on how to generate appropriate keys and fails to model the access control system as a whole. Recent work in the context of role-based access control has shown a gap between theoretical policy specification and computationally secure implementations of access control policies, potentially leading to insecure implementations. Without a formal model, it is hard to (i) reason about the correctness and security of a CES, and (ii) show that the security properties of a particular cryptographic primitive are sufficient to guarantee security of the CES as a whole. In this paper, we provide a rigorous definitional framework for a CES that enforces read-only information flow policies (which encompass many practical forms of access control, including role-based policies). This framework (i) provides a tool by which instantiations of CESs can be proven correct and secure, (ii) is independent of any particular cryptographic primitives used to instantiate a CES, and (iii) helps to identify the limitations of current primitives (e.g. key assignment schemes) as components of a CES.

关键词： Cryptographic Enforcement scheme Information Flow Policy Access Control Cryptography key assignment scheme Attribute-based Encryption

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Scrambling scheme for Palette-Based Images

Hierarchical Scrambling Scheme for Palette-Based Images

引用

International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)

作者： Aryal, Anu Imaizumi, Shoko Aoki, Naokazu Chiba Univ Dept Image & Mat Sci Div Informat Sci Grad Sch Adv Integrat SciInage Ku 1-33 Yayoi Cho Chiba 2638522 Japan

ISBN: (纸本)9781479961207

We present an efficient hierarchical scrambling scheme for palette-based images. The goal of hierarchical scrambling of a bit stream is to make the entire stream somehow difficult to decrypt. We decompose the original palette-based image into its corresponding binary bits then introduce cyclic shifts to scramble the selected entries and change their colors. The significant parameters (i.e. target pixels and target color components) play an important role in evaluating performance analysis. The scrambling scheme for the target pixels and the target color components were measured through a series of tests to measure the effectiveness of the proposed scheme. We also introduce an efficient key assignment scheme in which a recursive hash chain (RHC) is used to make our scheme secure.

关键词： cryptography image coding image colour analysis telecommunication security RHC bit streaming cyclic shifts hierarchical scrambling scheme key assignment scheme palette-based image recursive hash chain target color components target pixel Encryption Image color analysis Image quality Indexes Internet image colour analysis cryptography HCL2 gene telecommunication security scrambling image coding cyclic shift Image quality Internets bit stream

来源：评论

学校读者我要写书评

暂无评论

Provably Secure key assignment schemes from Factoring

Provably Secure Key Assignment Schemes from Factoring

引用

16th Australasian Conference on Information Security and Privacy (ACISP)

作者： Freire, Eduarda S. V. Paterson, Kenneth G. Univ London Informat Secur Grp London WC1E 7HU England

ISBN: (纸本)9783642224966

We provide constructions for key assignment schemes that are provably secure under the factoring assumption in the standard model. Our first construction is for simple "chain" hierarchies, and achieves security against key recovery attacks with a tight reduction from the problem of factoring integers of a special form. Our second construction applies for general hierarchies, achieves the stronger notion of key indistinguishability, and has security based on the hardness of factoring Blum integers. We compare our constructions to previous schemes, in terms of security and efficiency.

关键词： key assignment scheme general poset provably secure factoring access control

来源：评论

学校读者我要写书评

暂无评论

Cryptographically-enforced hierarchical access control with multiple keys

引用

JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING 2009年第8期78卷 690-700页

作者： Crampton, Jason Univ London Informat Secur Grp London WC1E 7HU England

Hierarchical access control policies, in which users and objects are associated with nodes in a hierarchy, can be enforced using cryptographic mechanisms. Protected data is encrypted and authorized users are given the appropriate keys. Lazy re-encryption techniques and temporal hierarchical access control policies require that multiple keys may be associated with a node in the hierarchy. In this paper, we introduce the notion of a multi-key assignment scheme to address this requirement. We define bounded, unbounded, synchronous, and asynchronous schemes. We demonstrate that bounded, synchronous schemes provide an alternative to temporal key assignment schemes in the literature, and that unbounded asynchronous schemes provide the desired support for lazy re-encryption. (C) 2009 Elsevier Inc. All rights reserved.

关键词： Information flow policy Cryptographic access control key assignment scheme Multi-key assignment scheme

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：