首页> 外文会议>International Conference on Information and Communications Security >Type Inferability and Decidability of the Security Problem Against Inference Attacks on Object-Oriented Databases
【24h】

Type Inferability and Decidability of the Security Problem Against Inference Attacks on Object-Oriented Databases

机译:对面向对象数据库的推论攻击的安全问题的型式推动性和可解密性

获取原文

摘要

Inference attacks mean that a user infers (or tries to infer) the result of an unauthorized query execution using only authorized queries to the user. We say that a query q is secure against inference attacks by a user u if there exists no database instance for which u can infer the result of q. The security problem against inference attacks has been formalized under a model of object-oriented databases called method schemas. It is known that the technique of type inference is useful for deciding the security. However, the relationship of type inferability and decidability of the security has not been examined. This paper introduces a subclass of method schemas, called linear schemas, and presents the following results. First, type inference of linear queries is possible under linear schemas. Next, the security of type-inferable queries is undecidable under linear schemas. Moreover, type inference is impossible for queries whose security is decidable under linear schemas. These results imply that type inferability and decidability of the security problem are incomparable.
机译:推断攻击意味着用户infers(或尝试推断)未授权查询执行的结果仅使用授权查询给用户。我们说,如果不存在US可以推断Q的结果,则用户u对用户u的推理攻击是安全的。对推理攻击的安全问题在称为方法模式的面向对象数据库的模型下正式化。众所周知,类型推断技术可用于决定安全性。但是,尚未检查安全性推动率和可辨赖性的关系。本文介绍了一种称为线性模式的方法模式的子类,呈现以下结果。首先,在线性模式下可以进行线性查询的类型推断。接下来,在线性模式下,类型可推断的查询的安全性是不可行的。此外,型推断不可能在线性模式下解密其安全性的查询是不可能的。这些结果意味着安全问题的型式推动性和可解除性是无与伦比的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号