An Authorization Logic with Explicit Time

DeYoung, Henry; Garg, Deepak; Pfenning, Frank

doi:10.21236/ada476803

Cited by 11 publications

(22 citation statements)

References 37 publications

(57 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such approaches typically provide the programmer with additional flexibility but complicate the programming model. [5,6,14,11,21,2,20] have tracked authorization using says. We follow the approach of DCC [2], a logic in which says is defined as an indexed monad.…”

Section: Related Workmentioning

confidence: 99%

“…DeYoung, Garg, and Pfenning [20] describe a constructive authorization logic that is parameterized by a notation of time. Propositions and proofs are annotated with time intervals during which they may be judged valid.…”

Section: Authorization Logics Many Logics and Languagesmentioning

confidence: 99%

“…It would, of course, be possible to define the operational semantics of AURA such that every operation has a chance to fail at runtime due to digital signature expiration, but this could easily make programming quite cumbersome. Instead, we hope to find a solution that allows time and revocation to be referenced by AURA in an intuitive way; one possibility, explored by Garg and Pfenning [20], is the use of linear logic, which is naturally suited to describing resources that can, in some sense, be used up.…”

Section: Future Work: Practicementioning

confidence: 99%

“…To help mitigate this complexity, researchers have proposed authorization logics that facilitate reasoning about principals, requests, and policy assertions [5,14,20,1,2]. Several of these logics have been concerned with specifying access control policies in distributed settings [45,6,11,21,20].…”

Section: Introductionmentioning

confidence: 99%

“…Several of these logics have been concerned with specifying access control policies in distributed settings [45,6,11,21,20]. Part of the appeal of authorization logics is that proofs of propositions in the logic can act as capabilities that provide the reference monitor with evidence that a given request should be granted.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Aura

et al. 2008

View full text Add to dashboard Cite

This paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic constructs (e.g., principals and access control policies) in a uniform way. AURA is based on polymorphic DCC and uses dependent types to permit assertions that refer directly to AURA values while keeping computation out of the assertion level to ensure tractability. The main technical results of this paper include fully mechanically verified proofs of the decidability and soundness for AURA's type system, and a prototype typechecker and interpreter.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Authorization Logics Many Logics and Languagesmentioning

confidence: 99%

Section: Future Work: Practicementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Aura

et al. 2008

View full text Add to dashboard Cite

show abstract

Proof Search and Certificates for Evidential Transactions

Nigam

Reis

Rahmouni

et al. 2021

Automated Deduction – CADE 28

View full text Add to dashboard Cite

Attestation logics have been used for specifying systems with policies involving different principals. Cyberlogic is an attestation logic used for the specification of Evidential Transactions (ETs). In such transactions, evidence has to be provided supporting its validity with respect to given policies. For example, visa applicants may be required to demonstrate that they have sufficient funds to visit a foreign country. Such evidence can be expressed as a Cyberlogic proof, possibly combined with non-logical data (e.g., a digitally signed document). A key issue is how to construct and communicate such evidence/proofs. It turns out that attestation modalities are challenging to use established proof-theoretic methods such as focusing. Our first contribution is the refinement of Cyberlogic proof theory with knowledge operators which can be used to represent knowledge bases local to one or more principals. Our second contribution is the identification of an executable fragment of Cyberlogic, called Cyberlogic programs, enabling the specification of ETs. Our third contribution is a sound and complete proof system for Cyberlogic programs enabling proof search similar to search in logic programming. Our final contribution is a proof certificate format for Cyberlogic programs inspired by Foundational Proof Certificates as a means to communicate evidence and check its validity.

show abstract

A rewriting framework and logic for activities subject to regulations

Kanovich

Kirigin²,

Nigam³

et al. 2015

Math. Struct. Comp. Sci.

View full text Add to dashboard Cite

Activities such as clinical investigations (CIs) or financial processes are subject to regulations to ensure quality of results and avoid negative consequences. Regulations may be imposed by multiple governmental agencies as well as by institutional policies and protocols. Due to the complexity of both regulations and activities, there is great potential for violation due to human error, misunderstanding, or even intent. Executable formal models of regulations, protocols and activities can form the foundation for automated assistants to aid planning, monitoring and compliance checking. We propose a model based on multiset rewriting where time is discrete and is specified by timestamps attached to facts. Actions, as well as initial, goal and critical states may be constrained by means of relative time constraints. Moreover, actions may have non-deterministic effects, i.e. they may have different outcomes whenever applied. We present a formal semantics of our model based on focused proofs of linear logic with definitions. We also determine the computational complexity of various planning problems. Plan compliance problem, for example, is the problem of finding a plan that leads from an initial state to a desired goal state without reaching any undesired critical state. We consider all actions to be balanced, i.e. their pre- and post-conditions have the same number of facts. Under this assumption on actions, we show that the plan compliance problem is PSPACE-complete when all actions have only deterministic effects and is EXPTIME-complete when actions may have non-deterministic effects. Finally, we show that the restrictions on the form of actions and time constraints taken in the specification of our model are necessary for decidability of the planning problems.

show abstract

An Authorization Logic with Explicit Time

Cited by 11 publications

References 37 publications

Aura

Aura

Proof Search and Certificates for Evidential Transactions

A rewriting framework and logic for activities subject to regulations

Contact Info

Product

Resources

About