19th IEEE Computer Security Foundations Workshop (CSFW'06)最新文献_第3页

Managing policy updates in security-typed languages 用安全类型语言管理策略更新

19th IEEE Computer Security Foundations Workshop (CSFW'06) Pub Date : 2006-07-05 DOI: 10.1109/CSFW.2006.17

N. Swamy, M. Hicks, Stephen Tse, S. Zdancewic

引用次数: 60

Simulation-based security with inexhaustible interactive Turing machines 基于仿真的安全与无穷无尽的交互图灵机

19th IEEE Computer Security Foundations Workshop (CSFW'06) Pub Date : 2006-07-05 DOI: 10.1109/CSFW.2006.30

Ralf Küsters

{"title":"Simulation-based security with inexhaustible interactive Turing machines","authors":"Ralf Küsters","doi":"10.1109/CSFW.2006.30","DOIUrl":"https://doi.org/10.1109/CSFW.2006.30","url":null,"abstract":"Recently, there has been much interest in extending models for simulation-based security in such a way that the runtime of protocols may depend on the length of their input. Finding such extensions has turned out to be a non-trivial task. In this work, we propose a simple, yet expressive general computational model for systems of interactive Turing machines (ITMs) where the runtime of the ITMs may be polynomial per activation and may depend on the length of the input received. One distinguishing feature of our model is that the systems of ITMs that we consider involve a generic mechanism for addressing dynamically generated copies of ITMs. We study properties of such systems and, in particular, show that systems satisfying a certain acyclicity condition run in polynomial time. Based on our general computational model, we state different notions of simulation-based security in a uniform and concise way, study their relationships, and prove a general composition theorem for composing a polynomial number of copies of protocols, where the polynomial is determined by the environment. The simplicity of our model is demonstrated by the fact that many of our results can be proved by mere equational reasoning based on a few equational principles on systems","PeriodicalId":131951,"journal":{"name":"19th IEEE Computer Security Foundations Workshop (CSFW'06)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125022265","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}

引用次数: 98

Distributed authorization using delegation with acyclic paths 使用带有非循环路径的委托进行分布式授权

19th IEEE Computer Security Foundations Workshop (CSFW'06) Pub Date : 2006-07-05 DOI: 10.1109/CSFW.2006.12

A. Lain, M. Mowbray

引用次数: 2

Games for controls 控制游戏

19th IEEE Computer Security Foundations Workshop (CSFW'06) Pub Date : 2006-07-05 DOI: 10.1109/CSFW.2006.14

K. Chatterjee, R. Jagadeesan, Corin Pitcher

引用次数: 1