Hiding Symbols and Functions: New Metrics and Constructions for Information-Theoretic Security

We present information-theoretic definitions and results for analyzing symmetric-key encryption schemes beyond the perfect secrecy regime, i.e. when perfect secrecy is not attained. We adopt two lines of analysis, one based on lossless source coding, and another akin to rate-distortion theory. We start by presenting a new information-theoretic metric for security, called symbol secrecy, and derive associated fundamental bounds. We then introduce list-source codes (LSCs), which are a general framework for mapping a key length (entropy) to a list size that an eavesdropper has to resolve in order to recover a secret message. We provide explicit constructions of LSCs, and demonstrate that, when the source is uniformly distributed, the highest level of symbol secrecy for a fixed key length can be achieved through a construction based on minimum-distance separable (MDS) codes. Using an analysis related to rate-distortion theory, we then show how symbol secrecy can be used to determine the probability that an eavesdropper correctly reconstructs functions of the original plaintext. We illustrate how these bounds can be applied to characterize security properties of symmetric-key encryption schemes, and, in particular, extend security claims based on symbol secrecy to a functional setting.Comment: Submitted to IEEE Transactions on Information Theor

Guessing a password over a wireless channel (on the effect of noise non-uniformity)

A string is sent over a noisy channel that erases some of its characters. Knowing the statistical properties of the string's source and which characters were erased, a listener that is equipped with an ability to test the veracity of a string, one string at a time, wishes to fill in the missing pieces. Here we characterize the influence of the stochastic properties of both the string's source and the noise on the channel on the distribution of the number of attempts required to identify the string, its guesswork. In particular, we establish that the average noise on the channel is not a determining factor for the average guesswork and illustrate simple settings where one recipient with, on average, a better channel than another recipient, has higher average guesswork. These results stand in contrast to those for the capacity of wiretap channels and suggest the use of techniques such as friendly jamming with pseudo-random sequences to exploit this guesswork behavior.Comment: Asilomar Conference on Signals, Systems & Computers, 201

Lists that are smaller than their parts: A coding approach to tunable secrecy

We present a new information-theoretic definition and associated results, based on list decoding in a source coding setting. We begin by presenting list-source codes, which naturally map a key length (entropy) to list size. We then show that such codes can be analyzed in the context of a novel information-theoretic metric, \epsilon-symbol secrecy, that encompasses both the one-time pad and traditional rate-based asymptotic metrics, but, like most cryptographic constructs, can be applied in non-asymptotic settings. We derive fundamental bounds for \epsilon-symbol secrecy and demonstrate how these bounds can be achieved with MDS codes when the source is uniformly distributed. We discuss applications and implementation issues of our codes.Comment: Allerton 2012, 8 page

Bounds on inference

Lower bounds for the average probability of error of estimating a hidden variable X given an observation of a correlated random variable Y, and Fano's inequality in particular, play a central role in information theory. In this paper, we present a lower bound for the average estimation error based on the marginal distribution of X and the principal inertias of the joint distribution matrix of X and Y. Furthermore, we discuss an information measure based on the sum of the largest principal inertias, called k-correlation, which generalizes maximal correlation. We show that k-correlation satisfies the Data Processing Inequality and is convex in the conditional distribution of Y given X. Finally, we investigate how to answer a fundamental question in inference and privacy: given an observation Y, can we estimate a function f(X) of the hidden random variable X with an average error below a certain threshold? We provide a general method for answering this question using an approach based on rate-distortion theory.Comment: Allerton 2013 with extended proof, 10 page

On Discrimination Discovery and Removal in Ranked Data using Causal Graph

Predictive models learned from historical data are widely used to help companies and organizations make decisions. However, they may digitally unfairly treat unwanted groups, raising concerns about fairness and discrimination. In this paper, we study the fairness-aware ranking problem which aims to discover discrimination in ranked datasets and reconstruct the fair ranking. Existing methods in fairness-aware ranking are mainly based on statistical parity that cannot measure the true discriminatory effect since discrimination is causal. On the other hand, existing methods in causal-based anti-discrimination learning focus on classification problems and cannot be directly applied to handle the ranked data. To address these limitations, we propose to map the rank position to a continuous score variable that represents the qualification of the candidates. Then, we build a causal graph that consists of both the discrete profile attributes and the continuous score. The path-specific effect technique is extended to the mixed-variable causal graph to identify both direct and indirect discrimination. The relationship between the path-specific effects for the ranked data and those for the binary decision is theoretically analyzed. Finally, algorithms for discovering and removing discrimination from a ranked dataset are developed. Experiments using the real dataset show the effectiveness of our approaches.Comment: 9 page

Fairness-Aware Ranking in Search & Recommendation Systems with Application to LinkedIn Talent Search

We present a framework for quantifying and mitigating algorithmic bias in mechanisms designed for ranking individuals, typically used as part of web-scale search and recommendation systems. We first propose complementary measures to quantify bias with respect to protected attributes such as gender and age. We then present algorithms for computing fairness-aware re-ranking of results. For a given search or recommendation task, our algorithms seek to achieve a desired distribution of top ranked results with respect to one or more protected attributes. We show that such a framework can be tailored to achieve fairness criteria such as equality of opportunity and demographic parity depending on the choice of the desired distribution. We evaluate the proposed algorithms via extensive simulations over different parameter choices, and study the effect of fairness-aware ranking on both bias and utility measures. We finally present the online A/B testing results from applying our framework towards representative ranking in LinkedIn Talent Search, and discuss the lessons learned in practice. Our approach resulted in tremendous improvement in the fairness metrics (nearly three fold increase in the number of search queries with representative results) without affecting the business metrics, which paved the way for deployment to 100% of LinkedIn Recruiter users worldwide. Ours is the first large-scale deployed framework for ensuring fairness in the hiring domain, with the potential positive impact for more than 630M LinkedIn members.Comment: This paper has been accepted for publication at ACM KDD 201

Multi-Path TCP with Network Coding for Mobile Devices in Heterogeneous Networks

Existing mobile devices have the capability to use multiple network technologies simultaneously to help increase performance; but they rarely, if at all, effectively use these technologies in parallel. We first present empirical data to help understand the mobile environment when three heterogeneous networks are available to the mobile device (i.e., a WiFi network, WiMax network, and an Iridium satellite network). We then propose a reliable, multi-path protocol called Multi-Path TCP with Network Coding (MPTCP/NC) that utilizes each of these networks in parallel. An analytical model is developed and a mean-field approximation is derived that gives an estimate of the protocol's achievable throughput. Finally, a comparison between MPTCP and MPTCP/NC is presented using both the empirical data and mean-field approximation. Our results show that network coding can provide users in mobile environments a higher quality of service by enabling the use of multiple network technologies and the capability to overcome packet losses due to lossy, wireless network connections.United States. Dept. of Defense. Assistant Secretary of Defense for Research & Engineering (Air Force Contract FA8721-05-C-0002

Clinical, radiologic, pathologic, and molecular characteristics of long-term survivors of diffuse intrinsic pontine glioma (DIPG): a collaborative report from the International and European Society for Pediatric Oncology DIPG registries

Purpose Diffuse intrinsic pontine glioma (DIPG) is a brainstem malignancy with a median survival of < 1 year. The International and European Society for Pediatric Oncology DIPG Registries collaborated to compare clinical, radiologic, and histomolecular characteristics between short-term survivors (STSs) and long-term survivors (LTSs). Materials and Methods Data abstracted from registry databases included patients from North America, Australia, Germany, Austria, Switzerland, the Netherlands, Italy, France, the United Kingdom, and Croatia. Results Among 1,130 pediatric and young adults with radiographically confirmed DIPG, 122 (11%) were excluded. Of the 1,008 remaining patients, 101 (10%) were LTSs (survival ≥ 2 years). Median survival time was 11 months (interquartile range, 7.5 to 16 months), and 1-, 2-, 3-, 4-, and 5-year survival rates were 42.3% (95% CI, 38.1% to 44.1%), 9.6% (95% CI, 7.8% to 11.3%), 4.3% (95% CI, 3.2% to 5.8%), 3.2% (95% CI, 2.4% to 4.6%), and 2.2% (95% CI, 1.4% to 3.4%), respectively. LTSs, compared with STSs, more commonly presented at age < 3 or > 10 years (11% v 3% and 33% v 23%, respectively; P < .001) and with longer symptom duration ( P < .001). STSs, compared with LTSs, more commonly presented with cranial nerve palsy (83% v 73%, respectively; P = .008), ring enhancement (38% v 23%, respectively; P = .007), necrosis (42% v 26%, respectively; P = .009), and extrapontine extension (92% v 86%, respectively; P = .04). LTSs more commonly received systemic therapy at diagnosis (88% v 75% for STSs; P = .005). Biopsies and autopsies were performed in 299 patients (30%) and 77 patients (10%), respectively; 181 tumors (48%) were molecularly characterized. LTSs were more likely to harbor a HIST1H3B mutation (odds ratio, 1.28; 95% CI, 1.1 to 1.5; P = .002). Conclusion We report clinical, radiologic, and molecular factors that correlate with survival in children and young adults with DIPG, which are important for risk stratification in future clinical trials

Expression of CXCL10 is associated with response to radiotherapy and overall survival in squamous cell carcinoma of the tongue

Five-year survival for patients with oral cancer has been disappointingly stable during the last decades, creating a demand for new biomarkers and treatment targets. Lately, much focus has been set on immunomodulation as a possible treatment or an adjuvant increasing sensitivity to conventional treatments. The objective of this study was to evaluate the prognostic importance of response to radiotherapy in tongue carcinoma patients as well as the expression of the CXC-chemokines in correlation to radiation response in the same group of tumours. Thirty-eight patients with tongue carcinoma that had received radiotherapy followed by surgery were included. The prognostic impact of pathological response to radiotherapy, N-status, T-stage, age and gender was evaluated using Cox's regression models, Kaplan-Meier survival curves and chi-square test. The expression of 23 CXC-chemokine ligands and their receptors were evaluated in all patients using microarray and qPCR and correlated with response to treatment using logistic regression. Pathological response to radiotherapy was independently associated to overall survival with a 2-year survival probability of 81 % for patients showing a complete pathological response, while patients with a non-complete response only had a probability of 42 % to survive for 2 years (p = 0.016). The expression of one CXC-chemokine, CXCL10, was significantly associated with response to radiotherapy and the group of patients with the highest CXCL10 expression responded, especially poorly (p = 0.01). CXCL10 is a potential marker for response to radiotherapy and overall survival in patients with squamous cell carcinoma of the tongue

The Ultrasonic Field of Focused Trandsucers Through a Liquid-Solid Interface

This paper presents theoretical and experimental results on the ultrasonic field of focused immersion transducers. The French Atomic Energy Commission (C.E.A.) has developed a software which calculates the ultrasonic field produced by a focused (or unfocused) transducer through a liquid-solid interface at normal or oblique incidence. The radiation of the transducer is formulated by the method of the Rayleigh integral, extended to take into account the liquid-solid interface. Firstly we describe this model, then we present measurements of the ultrasonic field produced by focused transducers in steel blocks. Experiments have been made using, at low frequencies, an electrodynamic probe, and, at high frequencies, an optical probe