Time-Storage Trade-Offs for Cryptographically-Enforced Access Control

Author(s):  
Jason Crampton
Keyword(s):  
2022 ◽  
Vol 25 (1) ◽  
pp. 1-37
Author(s):  
Stefano Berlato ◽  
Roberto Carbone ◽  
Adam J. Lee ◽  
Silvio Ranise

To facilitate the adoption of cloud by organizations, Cryptographic Access Control (CAC) is the obvious solution to control data sharing among users while preventing partially trusted Cloud Service Providers (CSP) from accessing sensitive data. Indeed, several CAC schemes have been proposed in the literature. Despite their differences, available solutions are based on a common set of entities—e.g., a data storage service or a proxy mediating the access of users to encrypted data—that operate in different (security) domains—e.g., on-premise or the CSP. However, the majority of these CAC schemes assumes a fixed assignment of entities to domains; this has security and usability implications that are not made explicit and can make inappropriate the use of a CAC scheme in certain scenarios with specific trust assumptions and requirements. For instance, assuming that the proxy runs at the premises of the organization avoids the vendor lock-in effect but may give rise to other security concerns (e.g., malicious insiders attackers). To the best of our knowledge, no previous work considers how to select the best possible architecture (i.e., the assignment of entities to domains) to deploy a CAC scheme for the trust assumptions and requirements of a given scenario. In this article, we propose a methodology to assist administrators in exploring different architectures for the enforcement of CAC schemes in a given scenario. We do this by identifying the possible architectures underlying the CAC schemes available in the literature and formalizing them in simple set theory. This allows us to reduce the problem of selecting the most suitable architectures satisfying a heterogeneous set of trust assumptions and requirements arising from the considered scenario to a decidable Multi-objective Combinatorial Optimization Problem (MOCOP) for which state-of-the-art solvers can be invoked. Finally, we show how we use the capability of solving the MOCOP to build a prototype tool assisting administrators to preliminarily perform a “What-if” analysis to explore the trade-offs among the various architectures and then use available standards and tools (such as TOSCA and Cloudify) for automated deployment in multiple CSPs.


2015 ◽  
Vol 58 ◽  
pp. 83-100 ◽  
Author(s):  
Selena Gimenez-Ibanez ◽  
Marta Boter ◽  
Roberto Solano

Jasmonates (JAs) are essential signalling molecules that co-ordinate the plant response to biotic and abiotic challenges, as well as co-ordinating several developmental processes. Huge progress has been made over the last decade in understanding the components and mechanisms that govern JA perception and signalling. The bioactive form of the hormone, (+)-7-iso-jasmonyl-l-isoleucine (JA-Ile), is perceived by the COI1–JAZ co-receptor complex. JASMONATE ZIM DOMAIN (JAZ) proteins also act as direct repressors of transcriptional activators such as MYC2. In the emerging picture of JA-Ile perception and signalling, COI1 operates as an E3 ubiquitin ligase that upon binding of JA-Ile targets JAZ repressors for degradation by the 26S proteasome, thereby derepressing transcription factors such as MYC2, which in turn activate JA-Ile-dependent transcriptional reprogramming. It is noteworthy that MYCs and different spliced variants of the JAZ proteins are involved in a negative regulatory feedback loop, which suggests a model that rapidly turns the transcriptional JA-Ile responses on and off and thereby avoids a detrimental overactivation of the pathway. This chapter highlights the most recent advances in our understanding of JA-Ile signalling, focusing on the latest repertoire of new targets of JAZ proteins to control different sets of JA-Ile-mediated responses, novel mechanisms of negative regulation of JA-Ile signalling, and hormonal cross-talk at the molecular level that ultimately determines plant adaptability and survival.


2001 ◽  
Vol 84 (9) ◽  
pp. 16-26
Author(s):  
Tadao Saito ◽  
Hitoshi Aida ◽  
Terumasa Aoki ◽  
Soichiro Hidaka ◽  
Tredej Toranawigtrai ◽  
...  

2012 ◽  
Vol 11 (3) ◽  
pp. 118-126 ◽  
Author(s):  
Olive Emil Wetter ◽  
Jürgen Wegge ◽  
Klaus Jonas ◽  
Klaus-Helmut Schmidt

In most work contexts, several performance goals coexist, and conflicts between them and trade-offs can occur. Our paper is the first to contrast a dual goal for speed and accuracy with a single goal for speed on the same task. The Sternberg paradigm (Experiment 1, n = 57) and the d2 test (Experiment 2, n = 19) were used as performance tasks. Speed measures and errors revealed in both experiments that dual as well as single goals increase performance by enhancing memory scanning. However, the single speed goal triggered a speed-accuracy trade-off, favoring speed over accuracy, whereas this was not the case with the dual goal. In difficult trials, dual goals slowed down scanning processes again so that errors could be prevented. This new finding is particularly relevant for security domains, where both aspects have to be managed simultaneously.


2007 ◽  
Vol 62 (9) ◽  
pp. 1073-1074 ◽  
Author(s):  
Kennon M. Sheldon ◽  
Melanie S. Sheldon ◽  
Charles P. Nichols

2007 ◽  
Author(s):  
Poonam Arora ◽  
David H. Krantz ◽  
David Hardisty ◽  
Nicole Peterson ◽  
Kavita Reddy
Keyword(s):  

Nature ◽  
2020 ◽  
Vol 588 (7837) ◽  
pp. 225-226
Author(s):  
Wei Peng
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document