Logic and Information Flow in Classical and Quantum Systems

经典和量子系统中的逻辑和信息流

• 批准号: EP/I001301/1
• 负责人: Samson Abramsky
• 金额: $ 8.6万
• 依托单位: University of Oxford
• 依托单位国家: 英国
• 项目类别: Research Grant
• 财政年份: 2010
• 资助国家: 英国
• 起止时间: 2010 至 无数据
• 项目状态: 已结题
• 来源: https://gtr.ukri.org/projects?ref=EP%2FI001301%2F1
• 关键词: Logic; Information; Flow; Classical; Quantum

In security applications an agent wants to conceal information while proceeding with its normal functioning. This ability to conceal sensitive information must hold even in the presence of malicious agents that are actively trying to find out secret information. It is important to understand first of all what it means for an adversary to know something. Secondly it is important to quantify how much an adversary knows and even more importantly how much information an adversary can find out during its attempts to attack a security system. The importance of reasoning quantitatively is particularly important when the adversary can collect large quantities of data and perform statistical analysis of the data to try and penetrate security barriers. The ability of cryptographers to break cyphers largely rests on statistical analysis. The earliest cyphers are easily broken today by simple analysis of which letters are most common in the language being encoded. Now days, there are sophisticated cyphers that cannot be broken easily and even more exciting prospects of secrets being protected by the fundamental laws of quantum mechanics. Of course, even with good cyphers there may be breaches in secure systems when there are logical flaws in the protocols that are used for performing security tasks. The proposed research has three main thrusts. First of all we would like to understand what knowledge even means in a quantum setting. Here one has to tackle fundamental questions that lie at the boundary of logic and physics. Second, we would like to quantify knowledge in quantum systems and reason about how knowledge flows as agents follow some fixed protocols to ensure security. Finally, we would like to develop a clean logical framework that can be ultimately used as the basis for automatically checking the correctness of protocols. The applications that we have in mind relate to protocols currently in use for example in electronic commerce and also other protocols for communication based on quantum mechanics. The latter are in the experimental stage but the time is coming close where such systems could be deployed in practice.

在安全应用中，代理希望在继续其正常功能的同时隐藏信息。这种隐藏敏感信息的能力必须保持，即使在存在恶意代理的情况下，这些代理正在积极地试图找出秘密信息。重要的是首先要理解对手知道某事意味着什么。其次，重要的是要量化对手知道多少，更重要的是，对手在试图攻击安全系统的过程中可以发现多少信息。当对手可以收集大量数据并对数据进行统计分析以试图穿透安全屏障时，定量推理的重要性尤为重要。密码破译者破译密码的能力很大程度上依赖于统计分析。最早的密码在今天很容易被破解，只要简单地分析一下哪种字母在被编码的语言中最常见。现在，有复杂的密码，不能轻易打破，甚至更令人兴奋的前景的秘密被保护的基本法律的量子力学。当然，即使有好的密码，当用于执行安全任务的协议中存在逻辑缺陷时，安全系统也可能存在漏洞。拟议的研究有三个主要目标。首先，我们想知道知识在量子环境中意味着什么。在这里，人们必须解决逻辑和物理边界上的基本问题。其次，我们想量化量子系统中的知识，并推理知识如何流动，因为代理遵循一些固定的协议以确保安全。最后，我们希望开发一个干净的逻辑框架，最终可以用作自动检查协议正确性的基础。我们所考虑的应用涉及目前使用的协议，例如电子商务和其他基于量子力学的通信协议。后者正处于试验阶段，但实际部署这种系统的时间即将到来。

项目成果

BISIMULATION METRICS FOR CONTINUOUS MARKOV DECISION PROCESSES

• DOI: 10.1137/10080484x
• 发表时间: 2011-01-01
• 期刊: SIAM JOURNAL ON COMPUTING
• 影响因子: 1.6
• 作者: Ferns, Norm;Panangaden, Prakash;Precup, Doina
• 通讯作者: Precup, Doina

Epistemic Strategies and Games on Concurrent Processes

并发过程的认知策略和博弈

• DOI: 10.1145/2362355.2362356
• 发表时间: 2012
• 期刊: ACM Transactions on Computational Logic
• 影响因子: 0.5
• 作者: Chatzikokolakis K

Quantum Communication in Rindler Spacetime

• DOI: 10.1007/s00220-012-1476-1
• 发表时间: 2010-07
• 期刊: Communications in Mathematical Physics
• 影响因子: 2.4
• 作者: K. Brádler;P. Hayden;P. Panangaden