scholarly journals A FLEXIBLE STRATEGY FOR EMBEDDING AND CONFIGURING RUN-TIME CONTRACT CHECKS IN .NET COMPONENTS

2007 ◽  
Vol 17 (03) ◽  
pp. 315-338
Author(s):  
STEPHEN H. EDWARDS ◽  
WESTLEY HAGGARD
Keyword(s):  
Source Code ◽  
User Preferences ◽  
Third Party ◽  
Design By Contract ◽  
Fine Grained ◽  
Significant Challenge ◽  
Run Time ◽  
Time Overhead

In component-based systems, there are several obstacles to using Design by Contract (DbC), particularly with respect to third-party components. Contracts are particularly valuable when debugging or testing composite software structures that include third-party components. However, existing approaches have critical weaknesses. First, existing approaches typically require a component's source code to be available if you wish to strip (or re-insert) checks. Second, documentation of the contract is either distributed separately from the component or embedded in the component's source code. Third, enabling and disabling specific kinds of checks on separate components from independent vendors can be a significant challenge. This paper describes an approach to representing contracts for .NET components using attributes. This contract information can be retrieved from the compiled component's metadata and used for many purposes. The paper also describes nContract, a tool that automatically generates run-time checks from embedded contracts. Such run-time checks can be generated and added to a system without requiring source code access or recompilation. Further, when checks for a given component are excluded, they impose no run-time overhead. Finally, a highly expressive, fine-grained mechanism for controlling user preferences about which specific checks are enabled or disabled is presented.

Augmenting commit classification by using fine-grained source code changes and a pre-trained deep neural language model

2021 ◽  
Vol 135 ◽  
pp. 106566
Author(s):  
Lobna Ghadhab ◽  
Ilyes Jenhani ◽  
Mohamed Wiem Mkaouer ◽  
Montassar Ben Messaoud
Keyword(s):  
Language Model ◽  
Source Code ◽  
Fine Grained ◽  
Code Changes ◽  
Source Code Changes

ILSSPP: Intelligent location sharing system with privacy preserving features for smart cities

2021 ◽  
pp. 1-12
Author(s):  
Gokay Saldamli ◽  
Richard Chow ◽  
Hongxia Jin
Keyword(s):  
Service Providers ◽  
Smart Cities ◽  
User Interaction ◽  
Privacy Preserving ◽  
Location Based Services ◽  
Third Party ◽  
Location Information ◽  
Fine Grained ◽  
Location Sharing ◽  
Social Network Structure

Social networking services are increasingly accessed through mobile devices. This trend has prompted services such as Facebook and Google+to incorporate location as a de facto feature of user interaction. At the same time, services based on location such as Foursquare and Shopkick are also growing as smartphone market penetration increases. In fact, this growth is happening despite concerns (growing at a similar pace) about security and third-party use of private location information (e.g., for advertising). Nevertheless, service providers have been unwilling to build truly private systems in which they do not have access to location information. In this paper, we describe an architecture and a trial implementation of a privacy-preserving location sharing system called ILSSPP. The system protects location information from the service provider and yet enables fine grained location-sharing. One main feature of the system is to protect an individual’s social network structure. The pattern of location sharing preferences towards contacts can reveal this structure without any knowledge of the locations themselves. ILSSPP protects locations sharing preferences through protocol unification and masking. ILSSPP has been implemented as a standalone solution, but the technology can also be integrated into location-based services to enhance privacy.

scholarly journals Server-Aided Revocable Predicate Encryption: Formalization and Lattice-Based Instantiation

2019 ◽  
Vol 62 (12) ◽  
pp. 1849-1862
Author(s):  
San Ling ◽  
Khoa Nguyen ◽  
Huaxiong Wang ◽  
Juanyang Zhang
Keyword(s):  
Third Party ◽  
Fine Grained ◽  
Attribute Based Encryption ◽  
The Standard Model ◽  
User Revocation ◽  
Promising Solution ◽  
Identity Based ◽  
Role Based ◽  
Predicate Encryption ◽  
Learning With Errors Problem

Abstract Efficient user revocation is a necessary but challenging problem in many multi-user cryptosystems. Among known approaches, server-aided revocation yields a promising solution, because it allows to outsource the major workloads of system users to a computationally powerful third party, called the server, whose only requirement is to carry out the computations correctly. Such a revocation mechanism was considered in the settings of identity-based encryption and attribute-based encryption by Qin et al. (2015, ESORICS) and Cui et al. (2016, ESORICS ), respectively. In this work, we consider the server-aided revocation mechanism in the more elaborate setting of predicate encryption (PE). The latter, introduced by Katz et al. (2008, EUROCRYPT), provides fine-grained and role-based access to encrypted data and can be viewed as a generalization of identity-based and attribute-based encryption. Our contribution is 2-fold. First, we formalize the model of server-aided revocable PE (SR-PE), with rigorous definitions and security notions. Our model can be seen as a non-trivial adaptation of Cui et al.’s work into the PE context. Second, we put forward a lattice-based instantiation of SR-PE. The scheme employs the PE scheme of Agrawal et al. (2011, ASIACRYPT) and the complete subtree method of Naor et al. (2001, CRYPTO) as the two main ingredients, which work smoothly together thanks to a few additional techniques. Our scheme is proven secure in the standard model (in a selective manner), based on the hardness of the learning with errors problem.

scholarly journals A complete run-time overhead-aware schedulability analysis for MrsP under nested resources

2020 ◽  
Vol 159 ◽  
pp. 110449 ◽  
Author(s):  
Shuai Zhao ◽  
Jorge Garrido ◽  
Ran Wei ◽  
Alan Burns ◽  
Andy Wellings ◽  
...  
Keyword(s):  
Schedulability Analysis ◽  
Run Time ◽  
Time Overhead
Sign in / Sign up

Export Citation Format

Share Document