Open Access. Powered by Scholars. Published by Universities.®

Social and Behavioral Sciences Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 21 of 21

Full-Text Articles in Social and Behavioral Sciences

Device-To-Device Communication In 5g: Towards Efficient Scheduling, Jana Fayek, Mohamad Aoude, Mohamad Raad, Raad Raad Jan 2018

Device-To-Device Communication In 5g: Towards Efficient Scheduling, Jana Fayek, Mohamad Aoude, Mohamad Raad, Raad Raad

Faculty of Engineering and Information Sciences - Papers: Part B

5G wireless networks are expected to carry large traffic volumes due to the growth of mobile devices and the increasing demand for high data rates from applications. Device to device communication is one of the suggested technologies to support this increasing load and enhance the capacity of networks. However, the implementation of D2D communication reveals many barriers that include communication scheduling, for which the architecture remains complex and obscure. In this paper, an overview of the available literature on the implementation of networks supporting D2D communication is presented, emphasizing the complexity of the offered solutions. This paper also offers a …


An Efficient And Provably Secure Rfid Grouping Proof Protocol, Shu Cheng, Vijay Varadharajan, Yi Mu, Willy Susilo Jan 2017

An Efficient And Provably Secure Rfid Grouping Proof Protocol, Shu Cheng, Vijay Varadharajan, Yi Mu, Willy Susilo

Faculty of Engineering and Information Sciences - Papers: Part A

RFID Grouping proof convinces an offline verifier that multiple tags are simultaneously scanned. Various solutions have been proposed but most of them have security and privacy vulnerabilities. In this paper, we propose an elliptic-curve-based RFID grouping proof protocol. Our protocol is proven secure and narrow-strong private. We also demonstrate that our grouping proof can be batch verified to improve the efficiency for large-scale RFID systems and it is suitable for low-cost RFID tags.


Efficient Subversion Of Symmetric Encryption With Random Initialization Vector, Joon Sang Baek, Ilsun You Jan 2016

Efficient Subversion Of Symmetric Encryption With Random Initialization Vector, Joon Sang Baek, Ilsun You

Faculty of Engineering and Information Sciences - Papers: Part B

This paper presents an efficient subverted symmetric encryption scheme, which outputs a random initialization vector (IV). Compared with the available scheme of the same kind in the literature, our attack provides a saboteur (big brother) with much faster recovery of a key used in a victim's symmetric encryption scheme. Our result implies that care must be taken when a symmetric encryption scheme with a random IV such as randomized CBC is deployed.


Towards Efficient Fully Randomized Message-Locked Encryption, Tao Jiang, Xiaofeng Chen, Qianhong Wu, Jianfeng Ma, Willy Susilo, Wenjing Lou Jan 2016

Towards Efficient Fully Randomized Message-Locked Encryption, Tao Jiang, Xiaofeng Chen, Qianhong Wu, Jianfeng Ma, Willy Susilo, Wenjing Lou

Faculty of Engineering and Information Sciences - Papers: Part A

Cross-user data deduplication will greatly reduce the storage cost of storage service provider. Motivated by secure data deduplication, Abadi et al. extended the work Message-Locked Encryption (MLE) and introduced the primitive of MLE2 with nice security properties. However, their fully randomized scheme (R-MLE2) requires the inefficient equality-testing algorithm to identify all duplicate ciphertexts. Thus, an interesting open problem is how to reduce the overhead of R-MLE2 and propose an efficient construction for R-MLE2. In this paper, we introduce a new primitive called μR-MLE2, which gives a partial positive answer to this open problem. Our main trick is to use the …


Efficient File Sharing In Electronic Health Records, Clementine Gritti, Willy Susilo, Thomas Plantard Jan 2015

Efficient File Sharing In Electronic Health Records, Clementine Gritti, Willy Susilo, Thomas Plantard

Faculty of Engineering and Information Sciences - Papers: Part A

No abstract provided.


An Efficient Variant Of Boneh-Gentry-Hamburg's Identity-Based Encryption Without Pairing, Ibrahim Elashry, Yi Mu, Willy Susilo Jan 2015

An Efficient Variant Of Boneh-Gentry-Hamburg's Identity-Based Encryption Without Pairing, Ibrahim Elashry, Yi Mu, Willy Susilo

Faculty of Engineering and Information Sciences - Papers: Part A

No abstract provided.


Optimal Design For Energy-Efficient Per-Subcarrier Antenna Selection Mimo–Ofdm Wireless Systems, Ngoc Phuc Le, Le Chung Tran, Farzad Safaei Jan 2015

Optimal Design For Energy-Efficient Per-Subcarrier Antenna Selection Mimo–Ofdm Wireless Systems, Ngoc Phuc Le, Le Chung Tran, Farzad Safaei

Faculty of Engineering and Information Sciences - Papers: Part A

In this paper, we consider a novel optimal design for per-subcarrier antenna selection multi-input multi-output orthogonal frequency division multiplexing systems from an energy-efficiency perspective. The optimal number of antennas, i.e., the number of radio frequency chains, that needs to be built-in on a transmitter to achieve the maximum energy-efficiency is determined. Specifically, an optimization problem for maximizing the average energy-efficiency with respect to the number of antennas is formulated. To solve this optimization problem, we first derive a closed-form formula expressing the cost function (i.e., the average energy-efficiency) as a function of the number of antennas. Search algorithms are then …


An Efficient Approach To Dynamically Weighted Multizone Wideband Reproduction Of Speech Soundfields, Jacob Donley, Christian H. Ritz Jan 2015

An Efficient Approach To Dynamically Weighted Multizone Wideband Reproduction Of Speech Soundfields, Jacob Donley, Christian H. Ritz

Faculty of Engineering and Information Sciences - Papers: Part A

This paper proposes and evaluates an efficient approach for practical reproduction of multizone soundfields for speech sources. The reproduction method, based on a previously proposed approach, utilises weighting parameters to control the soundfield reproduced in each zone whilst minimising the number of loudspeakers required. Proposed here is an interpolation scheme for predicting the weighting parameter values of the multizone soundfield model that otherwise requires significant computational effort. It is shown that initial computation time can be reduced by a factor of 1024 with only 85dB of error in the reproduced soundfield relative to reproduction without interpolated weighting parameters. The perceptual …


An Efficient Background Modeling Approach Based On Vehicle Detection, Jia-Yan Wang, Limei Song, Jiangtao Xi, Qinghua Guo Jan 2015

An Efficient Background Modeling Approach Based On Vehicle Detection, Jia-Yan Wang, Limei Song, Jiangtao Xi, Qinghua Guo

Faculty of Engineering and Information Sciences - Papers: Part A

The existing Gaussian Mixture Model(GMM) which is widely used in vehicle detection suffers inefficiency in detecting foreground image during the model phase, because it needs quite a long time to blend the shadows in the background. In order to overcome this problem, an improved method is proposed in this paper. First of all, each frame is divided into several areas(A, B, C and D), Where area A, B, C and D are decided by the frequency and the scale of the vehicle access. For each area, different new learning rate including weight, mean and variance is applied to accelerate the …


Managing Maintenance Resources For Efficient Asset Utilization, Winda Nur Cahyo, Khaled O. El-Akruti, Richard Dwight, Tieling Zhang Jan 2014

Managing Maintenance Resources For Efficient Asset Utilization, Winda Nur Cahyo, Khaled O. El-Akruti, Richard Dwight, Tieling Zhang

Faculty of Engineering and Information Sciences - Papers: Part A

Asset productivity is concerned with how an asset is efficiently and effectively deployed and utilized. It is related to maintenance resource management. The purpose of this paper is to discuss development of policies for managing integrated maintenance resources. These resources include human resource and supporting material required to perform maintenance activities for a complex maintenance system. Here, human resource management encompasses policy for recruitment, training, and outsourcing. Meanwhile, supporting material management includes policy for parts purchasing and inventory. Good asset productivity can be achieved by attaining a better performance of the asset using the same amount of maintenance resources or …


Adaptive Antenna Selection For Energy-Efficient Mimo-Ofdm Wireless Systems, Ngoc Phuc Le, Le Chung Tran, Farzad Safaei Jan 2014

Adaptive Antenna Selection For Energy-Efficient Mimo-Ofdm Wireless Systems, Ngoc Phuc Le, Le Chung Tran, Farzad Safaei

Faculty of Engineering and Information Sciences - Papers: Part A

In this paper, we investigate energy-efficiency in antenna selection OFDM-based systems. We show that an OFDM system with conventional antenna selection approaches, including per-subcarrier selection (i.e., selecting antennas independently for each subcarrier) and bulk-selection (i.e., choosing the same antennas for all subcarriers), suffers from a significant loss in energy-efficiency. To achieve a better energy-efficiency performance, we propose an adaptive antenna selection scheme where both the number of active RF (radio frequency) chains and the antenna indices are selected depending on the channel condition. This selection scheme could be implemented by exhaustive search. Moreover, we develop an algorithm that achieves a …


Security Pitfalls Of An Efficient Threshold Proxy Signature Scheme For Mobile Agents, Yong Yu, Yi Mu, Willy Susilo, Man Ho Au Jan 2014

Security Pitfalls Of An Efficient Threshold Proxy Signature Scheme For Mobile Agents, Yong Yu, Yi Mu, Willy Susilo, Man Ho Au

Faculty of Engineering and Information Sciences - Papers: Part A

A (t,n) threashold proxy signature scheme enables an original signer to delegate his/her signing power to n proxy signers such that any t or more proxy signers can sign messages on behalf of the original signer, but t-1 or less of them cannot produce a valid proxy signature. Based on the RSA cryptosystem, Hong proposed an efficient (t,n) threshold proxy signature for mobile agents. Cai et al. found that the scheme due to Hong is proxy-unprotected , meaning that the original signer can generate a valid proxy signature by himself. However, it is unclear whether the scheme can be used …


Efficient Semi-Static Secure Broadcast Encryption Scheme, Jongkil Kim, Willy Susilo, Man Ho Allen Au, Jennifer Seberry Jan 2014

Efficient Semi-Static Secure Broadcast Encryption Scheme, Jongkil Kim, Willy Susilo, Man Ho Allen Au, Jennifer Seberry

Faculty of Engineering and Information Sciences - Papers: Part A

In this paper, we propose a semi-static secure broadcast encryption scheme with constant-sized private keys and ciphertexts. Our result improves the semi-static secure broadcast encryption scheme introduced by Gentry and Waters. Specifically, we reduce the private key and ciphertext size by half. By applying the generic transformation proposed by Gentry and Waters, our scheme also achieves adaptive security. Finally, we present an improved implementation idea which can reduce the ciphertext size in the aforementioned generic transformation.


A Scalable Unsupervised Feature Merging Approach To Efficient Dimensionality Reduction Of High-Dimensional Visual Data, Lingqiao Liu, Lei Wang Jan 2013

A Scalable Unsupervised Feature Merging Approach To Efficient Dimensionality Reduction Of High-Dimensional Visual Data, Lingqiao Liu, Lei Wang

Faculty of Engineering and Information Sciences - Papers: Part A

To achieve a good trade-off between recognition accuracy and computational efficiency, it is often needed to reduce high-dimensional visual data to medium-dimensional ones. For this task, even applying a simple full-matrix-based linear projection causes significant computation and memory use. When the number of visual data is large, how to efficiently learn such a projection could even become a problem. The recent feature merging approach offers an efficient way to reduce the dimensionality, which only requires a single scan of features to perform reduction. However, existing merging algorithms do not scale well with high-dimensional data, especially in the unsupervised case. To …


Efficient And Dynamic Key Management For Multiple Identities In Identity-Based Systems, Hua Guo, Chang Xu, Zhoujun Li, Yanqing Yao, Yi Mu Jan 2013

Efficient And Dynamic Key Management For Multiple Identities In Identity-Based Systems, Hua Guo, Chang Xu, Zhoujun Li, Yanqing Yao, Yi Mu

Faculty of Engineering and Information Sciences - Papers: Part A

The traditional identity-based cryptography requires a user, who holds multiple identities, to hold multiple private keys, where each private key is associated with an identity. Managing multiple private/public keys is a heavy burden to a user due to key management and storage. The recent advancement of identity-based cryptography allow a single private key to map multiple public keys (identities); therefore the private key management is simplified. Unfortunately, the existing schemes capturing this feature do not allow dynamic changes of identities and have a large data size proportional to the number of the associated identities. To overcome these problems, in this …


Efficient Structured Support Vector Regression, Ke Jia, Lei Wang, Nianjun Liu Jan 2010

Efficient Structured Support Vector Regression, Ke Jia, Lei Wang, Nianjun Liu

Faculty of Engineering and Information Sciences - Papers: Part A

Support Vector Regression (SVR) has been a long standing problem in machine learning, and gains its popularity on various computer vision tasks. In this paper, we propose a structured support vector regression framework by extending the max-margin principle to incorporate spatial correlations among neighboring pixels. The objective function in our framework considers both label information and pairwise features, helping to achieve better cross-smoothing over neighboring nodes. With the bundle method, we effectively reduce the number of constraints and alleviate the adverse effect of outliers, leading to an efficient and robust learning algorithm. Moreover, we conduct a thorough analysis for the …


Efficient Spectral Feature Selection With Minimum Redundancy, Zheng Zhao, Lei Wang, Huan Liu Jan 2010

Efficient Spectral Feature Selection With Minimum Redundancy, Zheng Zhao, Lei Wang, Huan Liu

Faculty of Engineering and Information Sciences - Papers: Part A

Spectral feature selection identifies relevant features by measuring their capability of preserving sample similarity. It provides a powerful framework for both supervised and unsupervised feature selection, and has been proven to be effective in many real-world applications. One common drawback associated with most existing spectral feature selection algorithms is that they evaluate features individually and cannot identify redundant features. Since redundant features can have significant adverse effect on learning performance, it is necessary to address this limitation for spectral feature selection. To this end, we propose a novel spectral feature selection algorithm to handle feature redundancy, adopting an embedded model. …


Formal Security Definition And Efficient Construction For Roaming With A Privacy-Preserving Extension, Guomin Yang, Duncan S. Wong, Xiaotie Deng Jan 2008

Formal Security Definition And Efficient Construction For Roaming With A Privacy-Preserving Extension, Guomin Yang, Duncan S. Wong, Xiaotie Deng

Faculty of Engineering and Information Sciences - Papers: Part A

In a secure roaming scenario, a user U travels to a foreign network and communicates with a foreign server V securely so that no one other than U and V can obtain the messages exchanged between them. U may also want to travel anonymously so that no one including V can find out its identity or trace its whereabouts except its home server H. There have been many key establishment protocols proposed for secure roaming. A typical application of these protocols is the mobile roaming service which may be deployed to interconnected WLAN and 3G networks. Despite the importance of …


A Study Of Hippocampal Shape Difference Between Genders By Efficient Hypothesis Test And Discriminative Deformation, Luping Zhou, Richard Hartley, Paulette Lieby, Nick Barnes, Kaarin Anstey, Nicolas Cherbuin, Perminder Sachdev Jan 2007

A Study Of Hippocampal Shape Difference Between Genders By Efficient Hypothesis Test And Discriminative Deformation, Luping Zhou, Richard Hartley, Paulette Lieby, Nick Barnes, Kaarin Anstey, Nicolas Cherbuin, Perminder Sachdev

Faculty of Engineering and Information Sciences - Papers: Part A

Hypothesis testing is an important way to detect the statistical difference between two populations. In this paper, we use the Fisher permutation and bootstrap tests to differentiate hippocampal shape between genders. These methods are preferred to traditional hypothesis tests which impose assumptions on the distribution of the samples. An efficient algorithm is adopted to rapidly perform the exact tests. We extend this algorithm to multivariate data by projecting the original data onto an "informative direction" to generate a scalar test statistic. This "informative direction" is found to preserve the original discriminative information. This direction is further used in this paper …


An Efficient Single-Key Pirates Tracing Scheme Using Cover-Free Families, Joseph Tonien, Rei Safavi-Naini Jan 2006

An Efficient Single-Key Pirates Tracing Scheme Using Cover-Free Families, Joseph Tonien, Rei Safavi-Naini

Faculty of Engineering and Information Sciences - Papers: Part A

A cover-free family is a well-studied combinatorial structure that has many applications in computer science and cryptography. In this paper, we propose a new public key traitor tracing scheme based on cover-free families. The new traitor tracing scheme is similar to the Boneh-Franklin scheme except that in the Boneh-Franklin scheme, decryption keys are derived from Reed-Solomon codes while in our case they are derived from a cover-free family. This results in much simpler and faster tracing algorithms for single-key pirate decoders, compared to the tracing algorithms of Boneh-Franklin scheme that use Berlekamp- Welch algorithm. Our tracing algorithms never accuse innocent …


A 2-Secure Code With Efficient Tracing Algorithm, Joseph Tonien, Rei Safavi-Naini, Yejing Wang Jan 2002

A 2-Secure Code With Efficient Tracing Algorithm, Joseph Tonien, Rei Safavi-Naini, Yejing Wang

Faculty of Engineering and Information Sciences - Papers: Part A

No abstract provided.