249,091 research outputs found
Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
By extending the notion of minimum rank distance, this paper introduces two
new relative code parameters of a linear code C_1 of length n over a field
extension and its subcode C_2. One is called the relative
dimension/intersection profile (RDIP), and the other is called the relative
generalized rank weight (RGRW). We clarify their basic properties and the
relation between the RGRW and the minimum rank distance. As applications of the
RDIP and the RGRW, the security performance and the error correction capability
of secure network coding, guaranteed independently of the underlying network
code, are analyzed and clarified. We propose a construction of secure network
coding scheme, and analyze its security performance and error correction
capability as an example of applications of the RDIP and the RGRW. Silva and
Kschischang showed the existence of a secure network coding in which no part of
the secret message is revealed to the adversary even if any dim C_1-1 links are
wiretapped, which is guaranteed over any underlying network code. However, the
explicit construction of such a scheme remained an open problem. Our new
construction is just one instance of secure network coding that solves this
open problem.Comment: IEEEtran.cls, 25 pages, no figure, accepted for publication in IEEE
Transactions on Information Theor
Suppressing the Oblivious RAM timing channel while making information leakage and program efficiency trade-offs
Oblivious RAM (ORAM) is an established cryptographic technique to hide a program's address pattern to an untrusted storage system. More recently, ORAM schemes have been proposed to replace conventional memory controllers in secure processor settings to protect against information leakage in external memory and the processor I/O bus. A serious problem in current secure processor ORAM proposals is that they don't obfuscate when ORAM accesses are made, or do so in a very conservative manner. Since secure processors make ORAM accesses on last-level cache misses, ORAM access timing strongly correlates to program access pattern (e.g., locality). This brings ORAM's purpose in secure processors into question. This paper makes two contributions. First, we show how a secure processor can bound ORAM timing channel leakage to a user-controllable leakage limit. The secure processor is allowed to dynamically optimize ORAM access rate for power/performance, subject to the constraint that the leakage limit is not violated. Second, we show how changing the leakage limit impacts program efficiency. We present a dynamic scheme that leaks at most 32 bits through the ORAM timing channel and introduces only 20% performance overhead and 12% power overhead relative to a baseline ORAM that has no timing channel protection. By reducing leakage to 16 bits, our scheme degrades in performance by 5% but gains in power efficiency by 3%. We show that a static (zero leakage) scheme imposes a 34% power overhead for equivalent performance (or a 30% performance overhead for equivalent power) relative to our dynamic scheme.United States. Dept. of Defense (National Defense Science and Engineering Graduate (NDSEG) Fellowship)United States. Defense Advanced Research Projects Agency. Clean-slate Design of Resilient, Adaptive, Secure Hosts (CRASH) Program (Contract N66001-10-2-4089
Assessment of encryption and decryption schemes for secure data transmission in healthcare systems
Abstract: In the biomedical research community, transmitting a patient medical record via wireless means to an administrative centre or other medical centres is increasingly common. However, due to the open nature of wireless media, the security of such a system is a major concern, so, it is desirable to have a reliable security scheme. Amidst the numerous methods used to secure medical data, encryption schemes are becoming more popular due to their performance and relative simplicity. In this study, the performance of some data encryption and decryption schemes used to secure medical data is evaluated. These schemes are Blowfish, DES, AES, RC4, RSA, ECC, CBE, MTLM and CEC. The performance of these schemes was assessed through their execution time, throughput, average data rate and information entropy. For this performance assessment, some medical data were used for this task. The results showed that the performance of CBE, MTLM and CEC was better. CBE and MTLM offer a secure way to encrypt data with a significant reduction in the execution time. Moreover, if some of these schemes were combined to form a hybrid system, an enhancement in the security of medical data over wireless communication networks is guaranteed
Exclusion in the all-pay auction: An experimental investigation
Contest designers or managers who want to maximize the overall revenue of a contest (relative performance scheme) are frequently concerned with a trade-off between contest homogeneity and inclusion of contestants with high valuations. In our experimental study, we find that it is not profitable to exclude the most able bidder in favor of greater homogeneity among the remaining bidders, even if the theoretical exclusion principle predicts otherwise. This is because the strongest bidders are willing to give up a substantial part of their expected rent and prefer a strategy that ensures a lower but secure pay-off
Perfectly Secure Oblivious Parallel RAM
We show that PRAMs can be obliviously simulated with perfect security, incurring only blowup in parallel runtime, blowup in total work, and blowup in space relative to the original PRAM. Our results advance the theoretical understanding of Oblivious (Parallel) RAM in several respects. First, prior to our work, no perfectly secure Oblivious Parallel RAM (OPRAM) construction was known; and we are the first in this respect. Second, even for the sequential special case of our algorithm (i.e., perfectly secure ORAM), we not only achieve logarithmic improvement in terms of space consumption relative to the state-of-the-art but also significantly simplify perfectly secure ORAM constructions. Third, our perfectly secure OPRAM scheme matches the parallel runtime of earlier statistically secure schemes with negligible failure probability. Since we remove the dependence (in performance) on the security parameter, our perfectly secure OPRAM scheme in fact asymptotically outperforms known statistically secure ones if (sub-)exponentially small failure probability is desired. Our techniques for achieving small parallel runtime are novel and we employ expander graphs to de-randomize earlier statistically secure schemes --- this is the first time such techniques are used in the constructions of ORAMs/OPRAMs
A New Vehicle Localization Scheme Based on Combined Optical Camera Communication and Photogrammetry
The demand for autonomous vehicles is increasing gradually owing to their
enormous potential benefits. However, several challenges, such as vehicle
localization, are involved in the development of autonomous vehicles. A simple
and secure algorithm for vehicle positioning is proposed herein without
massively modifying the existing transportation infrastructure. For vehicle
localization, vehicles on the road are classified into two categories: host
vehicles (HVs) are the ones used to estimate other vehicles' positions and
forwarding vehicles (FVs) are the ones that move in front of the HVs. The FV
transmits modulated data from the tail (or back) light, and the camera of the
HV receives that signal using optical camera communication (OCC). In addition,
the streetlight (SL) data are considered to ensure the position accuracy of the
HV. Determining the HV position minimizes the relative position variation
between the HV and FV. Using photogrammetry, the distance between FV or SL and
the camera of the HV is calculated by measuring the occupied image area on the
image sensor. Comparing the change in distance between HV and SLs with the
change in distance between HV and FV, the positions of FVs are determined. The
performance of the proposed technique is analyzed, and the results indicate a
significant improvement in performance. The experimental distance measurement
validated the feasibility of the proposed scheme
New Parameters of Linear Codes Expressing Security Performance of Universal Secure Network Coding
The universal secure network coding presented by Silva et al. realizes secure
and reliable transmission of a secret message over any underlying network code,
by using maximum rank distance codes. Inspired by their result, this paper
considers the secure network coding based on arbitrary linear codes, and
investigates its security performance and error correction capability that are
guaranteed independently of the underlying network code. The security
performance and error correction capability are said to be universal when they
are independent of underlying network codes. This paper introduces new code
parameters, the relative dimension/intersection profile (RDIP) and the relative
generalized rank weight (RGRW) of linear codes. We reveal that the universal
security performance and universal error correction capability of secure
network coding are expressed in terms of the RDIP and RGRW of linear codes. The
security and error correction of existing schemes are also analyzed as
applications of the RDIP and RGRW.Comment: IEEEtran.cls, 8 pages, no figure. To appear in Proc. 50th Annual
Allerton Conference on Communication, Control, and Computing (Allerton 2012).
Version 2 added an exact expression of the universal error correction
capability in terms of the relative generalized rank weigh
- …