• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.9
• /
• pp.21-31
• /
• 2013

A ciphertext policy-attribute based encryption(CP-ABE) scheme can be used to realize access control mechanism without a trusted server. We propose an attribute-based access control mechanism by incorporating a CP-ABE scheme to ensure only authorized users can access the sensitive data. The idea of CP-ABE is to include access control policy in the ciphertexts, in which they can only be decrypted if a user possesses attributes that pass through the ciphertext's access structure. In this paper, we prove a secure CP-ABE scheme where the policy can be expressed in non-monotonic access structures. We further compare the performance of our scheme with the existing CP-ABE schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4A
• /
• pp.330-335
• /
• 2007

This paper proposes a multichannel random access channel allocation scheme for multihop cellular networks to guarantee the stable throughput of a random access. The fundamental contribution is a mathematical formula for an optimal partition ratio of shared random access channels between a base station and a relay station. In addition, the proposed scheme controls the retransmission probability of random access packets under heavy load condition. Simulation results show that the proposed scheme can guarantee the required random access channel utilization and packet transmission delay even if the a random access packet arrival rate is higher than 0.1.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3339-3352
• /
• 2016

In ciphertext-policy attribute-based encryption (CP-ABE) scheme, a user's secret key is associated with a set of attributes, and the ciphertext is associated with an access policy. The user can decrypt the ciphertext if and only if the attribute set of his secret key satisfies the access policy specified in the ciphertext. In the present schemes, access policy is sent to the decryptor along with the ciphertext, which means that the privacy of the encryptor is revealed. In order to solve such problem, we propose a CP-ABE scheme with hidden access policy, which is able to preserve the privacy of the encryptor and decryptor. And what's more in the present schemes, the users need to do excessive calculation for decryption to check whether their attributes match the access policy specified in the ciphertext or not, which makes the users do useless computation if the attributes don't match the hidden access policy. In order to solve efficiency issue, our scheme adds a testing phase to avoid the unnecessary operation above before decryption. The computation cost for the testing phase is much less than the decryption computation so that the efficiency in our scheme is improved. Meanwhile, our new scheme is proved to be selectively secure against chosen-plaintext attack under DDH assumption.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.4
• /
• pp.205-211
• /
• 2008

Conventional context-aware service models permit the access of resources only by user authentication, but the ubiquitous environments where the context information around users is changing frequently require the resource access control according to the rapid changes. This paper proposes a scheme to control access permission of resource dynamically as context information of user changes. Our access control model is based on traditional CASA (Context-Aware Security Architecture), but can restrict the access of the user already has been authorized. With the real-time checking of context information, our scheme gives different access controls according to changes in environmental information, and provides more secure services than conventional context-aware models.

• Journal of the Korea Society for Simulation
• /
• v.17 no.4
• /
• pp.11-19
• /
• 2008

To enhance the performance of the IEEE 802.16 broadband wireless access system, it is necessary to improve the efficiency of the radio link. The efficiency of the uplink can be improved by using more efficient random access method. As new random access methods, we propose a RA_NBRM method which is based on the number of bandwidth request messages and a RA_CRA method which is based on the conflict resolution algorithm. The simulation results show that the performance of the new methods is superior to that of the existing binary exponential backoff method.

• The Journal of Asian Finance, Economics and Business
• /
• v.5 no.1
• /
• pp.63-72
• /
• 2018

Social entrepreneurship is increasingly gaining interest in developing countries for the great benefits of society. In Vietnam, the concept of social entrepreneurship is still quite new. Entrepreneurial intention is regarded as a useful and practial approach for understanding actual entrepreneurial behavior. The purpose of this paper is to develop an integrated model based on planned behavior to examine the direct and indirect effect of perceived access to finance on social entrepreneurial intention. The confirm factor analysis to study the latent constructs underlying determinants of planned behavioral theory, perceived access to finance and social entrepreneurial intention. Then, it applies the technique of structural equation modeling to explore relationships among latent constructs. There is no direct relationship between perceived access to finance and social entrepreneurial intention. Perceived access to finance only indirectly increases entrepreneurial intention through attitude towards behavior and perceived behavioral. This study focuses on the perceptual factor of financial access that affects entrepreneurial intentions. The study does not cover other in-depth issues of social entrepreneurship such as decision making, leadership, personality traits, social capital, and human capital. To establish an environment with a strong social entrepreneurial intention, a focus on developing perceived access to finance is an extremely important factor. This study also suggests that attitude towards behavior and perceived behavioral have a strong impact to social entrepreneurship.

• The Journal of Asian Finance, Economics and Business
• /
• v.7 no.11
• /
• pp.205-218
• /
• 2020

This study aims to analyze the influence of financial inclusion on micro-, small-, and medium-sized enterprises' (MSMEs) performance and examine the mediation role of financial intermediation and access to capital. The object of this study is MSMEs in Malang, Indonesia. The sample consists of 100 MSME actors in Malang City, which is determined using Roscoes theory. The data is collected using Simple Random Sampling method, by distributing questionnaire measured with Likert scales. The hypotheses proposed in this study are examined using Partial Least Square (PLS) model. The results of this study show that financial inclusion influences MSMEs' performance both directly and indirectly through mediation from financial intermediation and access to capital. The direct influence means that the efforts to increase access to financial services, especially access to credit financing for MSMEs, will be able to increase market share, number of workers, sales, as well as profit of the MSMEs. Increased financial inclusion has a major impact on improving MSMEs' performance through financial intermediation compared to access to capital. This means that the increase of financial access for MSMEs followed by an increase in financial intermediation in the form of a financial service approach to MSMEs will improve MSMEs' performance.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.14 no.4
• /
• pp.391-406
• /
• 2014

The performance of General-Purpose computation on Graphics Processing Units (GPGPU) is heavily dependent on the memory access behavior. This sensitivity is due to a combination of the underlying Massively Parallel Processing (MPP) execution model present on GPUs and the lack of architectural support to handle irregular memory access patterns. Application performance can be significantly improved by applying memory-access-pattern-aware optimizations that can exploit knowledge of the characteristics of each access pattern. In this paper, we present an algorithmic methodology to semi-automatically find the best mapping of memory accesses present in serial loop nest to underlying data-parallel architectures based on a comprehensive static memory access pattern analysis. To that end we present a simple, yet powerful, mathematical model that captures all memory access pattern information present in serial data-parallel loop nests. We then show how this model is used in practice to select the most appropriate memory space for data and to search for an appropriate thread mapping and work group size from a large design space. To evaluate the effectiveness of our methodology, we report on execution speedup using selected benchmark kernels that cover a wide range of memory access patterns commonly found in GPGPU workloads. Our experimental results are reported using the industry standard heterogeneous programming language, OpenCL, targeting the NVIDIA GT200 architecture.

• Journal of Communications and Networks
• /
• v.13 no.1
• /
• pp.43-49
• /
• 2011

In this paper, a new medium access control (MAC) protocol entitled three-phase multiple access with continual contention resolution (TPMA-CCR) is proposed for wireless multi-hop ad hoc networks. This work is motivated by the previously known three-phase multiple access (TPMA) scheme of Hou and Tsai [2] which is the suitable MAC protocol for clustering multi-hop ad hoc networks owing to its beneficial attributes such as easy collision detectible, anonymous acknowledgment (ACK), and simple signaling format for the broadcast-natured networks. The new TPMA-CCR is designed to let all contending nodes participate in contentions for a medium access more aggressively than the original TPMA and with continual resolving procedures as well. Through the systematical performance analysis of the suggested protocol, it is also shown that the maximum throughput of the new protocol is not only superior to the original TPMA, but also improves on the conventional slotted carrier sense multiple access (CSMA) under certain circumstances. Thus, in terms of performance, TPMA-CCR can provide an attractive alternative to other contention-based MAC protocols for multi-hop ad hoc networks.

• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.3
• /
• pp.148-159
• /
• 2013

An analysis of the throughput and stability region of random access systems is currently of interest in research and industry. This study evaluated the performance of a multiuser random access channel with a retransmission gain. The channel was composed of a media access control (MAC) determined by the transmission probabilities and a multiuser communication channel characterized by the packet reception probabilities as functions of the number of packet transmissions and the collision status. The analysis began with an illustrative two-user channel, and was extended to a general multiuser channel. For the two-user channel, a sufficient condition was derived, under which the maximum throughput was achieved with a control-free MAC. For the channel with retransmission gain, the maximum steady throughput was obtained in a closed form. The condition under which the random access channel can acquire retransmission gain was also obtained. The stability region of the general random access channel was derived. These results include those of the well-known orthogonal channel, collision channel and slotted Aloha channel with packet reception as a special instance. The analytical and numerical results showed that exploiting the retransmission gain can increase the throughput significantly and expand the stability region of the random access channel. The analytical results predicted the performance in the simulations quite well.