@conference {17826,
	title = {Provisional authorizations},
	booktitle = {E-commerce Security and Privacy},
	volume = {2},
	year = {2001},
	month = {2001///},
	pages = {133 - 159},
	abstract = {Past generations of access control systems, when faced with an access request, have issued a {\textquotedblleft}yes{\textquotedblright} (resp. {\textquotedblleft}no{\textquotedblright}) answer to the access request resulting in access being granted (resp. denied). In this chapter, we ar-gue that for the world{\textquoteright}s rapidly proliferating business to business (B2B) applications and auctions, {\textquotedblleft}yes/no{\textquotedblright} responses are just not enough. We propose the notion of a {\textquotedblleft}provisional authorization{\textquotedblright} which intuitively says {\textquotedblleft}You may perform the desired access provided you cause condition C to be satisfied.{\textquotedblright} For instance, a user accessing an online brokerage may receive some information if he fills out his name/address, but not otherwise. While a variety of such provisional authorization mecha-nisms exist on the web, they are all hardcoded on an application by application basis. We show that given (almost) any logic L, we may define a provisional authorization specification language pASLL. pASLL is based on the declarative, polynomially evaluable authorization spec-ification language ASL proposed by Jajodia et al [JSS97]. We define programs in pASLL, and specify how given any access request, we must find a {\textquotedblleft}weakest{\textquotedblright} precondition under which the access can be granted (in the worst case, if this weakest precondition is {\textquotedblleft}false{\textquotedblright} this amounts to a denial). We develop a model theoretic semantics for pASLL and show how it can be applied to online sealed-bid auction servers and online contracting.},
	doi = {10.1007/978-1-4615-1467-1_8},
	author = {Jajodia,S. and Kudo,M. and V.S. Subrahmanian}
}
