arXiv subjects

Ye Wang

Publications and source records attributed to Ye Wang.

355 records · Page 20Linked to original sources

arXiv2013

Enhanced Hot-Carrier Luminescence in Multilayer Reduced Graphene Oxide Nanospheres

We report a method to promote photoluminescence emission in graphene materials by enhancing carrier scattering instead of directly modifying band structure in multilayer reduced graphene oxide (rGO) nanospheres. We intentionally curl graphene layers to form nanospheres by reducing graphene oxide with spherical polymer templates to manipulate the carrier scattering. These nanospheres produce hot-carrier luminescence with more than ten-fold improvement of emission efficiency as compared to planar nanosheets. With increasing excitation power, hot-carrier luminescence from nanospheres exhibits abnormal spectral redshift with dynamic feature associated to the strengthened electron-phonon coupling. These experimental results can be well understood by considering the screened Coulomb interactions. With increasing carrier density, the reduced screening effect promotes carrier scattering which enhances hot-carrier emission from such multilayer rGO nanospheres. This carrier-scattering scenario is further confirmed by pump-probe measurements.

cond-mat.mes-hall↗

arXiv2013

Secure Biometrics: Concepts, Authentication Architectures and Challenges

BIOMETRICS are an important and widely used class of methods for identity verification and access control. Biometrics are attractive because they are inherent properties of an individual. They need not be remembered like passwords, and are not easily lost or forged like identifying documents. At the same time, bio- metrics are fundamentally noisy and irreplaceable. There are always slight variations among the measurements of a given biometric, and, unlike passwords or identification numbers, biometrics are derived from physical characteristics that cannot easily be changed. The proliferation of biometric usage raises critical privacy and security concerns that, due to the noisy nature of biometrics, cannot be addressed using standard cryptographic methods. In this article we present an overview of "secure biometrics", also referred to as "biometric template protection", an emerging class of methods that address these concerns.

cs.CR↗

arXiv2013

On the Benefits of Sampling in Privacy Preserving Statistical Analysis on Distributed Databases

We consider a problem where mutually untrusting curators possess portions of a vertically partitioned database containing information about a set of individuals. The goal is to enable an authorized party to obtain aggregate (statistical) information from the database while protecting the privacy of the individuals, which we formalize using Differential Privacy. This process can be facilitated by an untrusted server that provides storage and processing services but should not learn anything about the database. This work describes a data release mechanism that employs Post Randomization (PRAM), encryption and random sampling to maintain privacy, while allowing the authorized party to conduct an accurate statistical analysis of the data. Encryption ensures that the storage server obtains no information about the database, while PRAM and sampling ensures individual privacy is maintained against the authorized party. We characterize how much the composition of random sampling with PRAM increases the differential privacy of system compared to using PRAM alone. We also analyze the statistical utility of our system, by bounding the estimation error - the expected l2-norm error between the true empirical distribution and the estimated distribution - as a function of the number of samples, PRAM noise, and other system parameters. Our analysis shows a tradeoff between increasing PRAM noise versus decreasing the number of samples to maintain a desired level of privacy, and we determine the optimal number of samples that balances this tradeoff and maximizes the utility. In experimental simulations with the UCI "Adult Data Set" and with synthetically generated data, we confirm that the theoretically predicted optimal number of samples indeed achieves close to the minimal empirical error, and that our analytical error bounds match well with the empirical results.

cs.CR↗

arXiv2013

Information-Theoretically Secure Three-Party Computation with One Corrupted Party

The problem in which one of three pairwise interacting parties is required to securely compute a function of the inputs held by the other two, when one party may arbitrarily deviate from the computation protocol (active behavioral model), is studied. An information-theoretic characterization of unconditionally secure computation protocols under the active behavioral model is provided. A protocol for Hamming distance computation is provided and shown to be unconditionally secure under both active and passive behavioral models using the information-theoretic characterization. The difference between the notions of security under the active and passive behavioral models is illustrated through the BGW protocol for computing quadratic and Hamming distances; this protocol is secure under the passive model, but is shown to be not secure under the active model.

cs.CR↗

arXiv2012

Ultrafast pump-probe spectroscopic signatures of superconducting and pseudogap phases in YBa2Cu3O7-δ films

Femtosecond pump-probe spectroscopy is applied to identify transient optical signatures of phase transitions in optimally doped YBa2Cu3O7-δ films. To elucidate the dynamics of superconducting and pseudogap phases, the slow thermal component is removed from the time-domain traces of photo-induced reflectivity in a high-flux regime with low frequency pulse rate. The rescaled data exhibit distinct signatures of the phase separation with abrupt changes at the onsets of TSC and TPG in excellent agreement with transport data. Compared to the superconducting phase, the response of the pseudogap phase is characterized by the strongly reduced reflectivity change accompanied by a faster recovery time.

cond-mat.supr-con↗

arXiv2012

Two-Component Structure of the Hbeta Broad-Line Region in Quasars. I. Evidence from Spectral Principal Component Analysis

We report on a spectral principal component analysis (SPCA) of a sample of 816 quasars, selected to have small Fe II velocity shifts with spectral coverage in the rest wavelength range 3500--5500 Å. The sample is explicitly designed to mitigate spurious effects on SPCA induced by Fe II velocity shifts. We improve the algorithm of SPCA in the literature and introduce a new quantity, \emph{the fractional-contribution spectrum}, that effectively identifies the emission features encoded in each eigenspectrum. The first eigenspectrum clearly records the power-law continuum and very broad Balmer emission lines. Narrow emission lines dominate the second eigenspectrum. The third eigenspectrum represents the Fe II emission and a component of the Balmer lines with kinematically similar intermediate velocity widths. Correlations between the weights of the eigenspectra and parametric measurements of line strength and continuum slope confirm the above interpretation for the eigenspectra. Monte Carlo simulations demonstrate the validity of our method to recognize cross talk in SPCA and firmly rule out a single-component model for broad Hbeta. We also present the results of SPCA for four other samples that contain quasars in bins of larger Fe II velocity shift; similar eigenspectra are obtained. We propose that the Hbeta-emitting region has two kinematically distinct components: one with very large velocities whose strength correlates with the continuum shape, and another with more modest, intermediate velocities that is closely coupled to the gas that gives rise to Fe II emission.

astro-ph.CO↗

arXiv2012

State-independent experimental tests of quantum contextuality in a three dimensional system

We experimentally observed state-independent violations of Kochen-Specker inequalities for the simplest indivisible quantum system manifesting quantum contextuality, a three-level (qutrit) system. We performed the experiment with a single trapped ^{171}Yb^{+} ion, by mapping three ground states of the ^{171}Yb^{+} ion to a qutrit system and carrying out quantum operatations by applying microwaves resonant to the qutrit transition frequencies. Our results are free from the detection loophole and cannot be explained by the non-contextual hidden variable models.

quant-ph↗

arXiv2012

Intervening BLR Clouds' Effects on Optical/UV Spectrum

Recent x-ray observations of Mrk 766 suggest that broad emission line region clouds cross our line of sight and produce variable x-ray absorption. Here we investigate what optical/ultraviolet spectroscopic features would be produced by such "Intervening BLR Clouds" (IBC) crossing our line of sight to the accretion disk, the source of the optical/UV continuum. Although the emission spectrum produced by intervening clouds is identical to the standard BLR model, they may produce absorption features on the optical or UV continuum. Single clouds will have little effect on the optical/UV spectrum because BLR clouds are likely to be much smaller than the accretion disk. This is unlike the X-ray case, where the radiation source is considerably smaller. However, an ensemble of intervening clouds will produce spectroscopic features in the FUV including a strong depression between the Lyman limit and Lyα. The amount of the depression will indicate the line-of-sight covering factor of clouds, an unknown quantity that is important for the ionization of the intergalactic medium and the energy budget of AGN. Comparison with observations suggests that the SED of Mrk 766 may be affected by intervening BLR clouds and IBC may exist in most of AGNs.

astro-ph.CO↗

arXiv2011

A Theoretical Analysis of Authentication, Privacy and Reusability Across Secure Biometric Systems

We present a theoretical framework for the analysis of privacy and security tradeoffs in secure biometric authentication systems. We use this framework to conduct a comparative information-theoretic analysis of two biometric systems that are based on linear error correction codes, namely fuzzy commitment and secure sketches. We derive upper bounds for the probability of false rejection ($P_{FR}$) and false acceptance ($P_{FA}$) for these systems. We use mutual information to quantify the information leaked about a user's biometric identity, in the scenario where one or multiple biometric enrollments of the user are fully or partially compromised. We also quantify the probability of successful attack ($P_{SA}$) based on the compromised information. Our analysis reveals that fuzzy commitment and secure sketch systems have identical $P_{FR}, P_{FA}, P_{SA}$ and information leakage, but secure sketch systems have lower storage requirements. We analyze both single-factor (keyless) and two-factor (key-based) variants of secure biometrics, and consider the most general scenarios in which a single user may provide noisy biometric enrollments at several access control devices, some of which may be subsequently compromised by an attacker. Our analysis highlights the revocability and reusability properties of key-based systems and exposes a subtle design tradeoff between reducing information leakage from compromised systems and preventing successful attacks on systems whose data have not been compromised.

cs.IT↗

arXiv2009

Bootstrapped Oblivious Transfer and Secure Two-Party Function Computation

We propose an information theoretic framework for the secure two-party function computation (SFC) problem and introduce the notion of SFC capacity. We study and extend string oblivious transfer (OT) to sample-wise OT. We propose an efficient, perfectly private OT protocol utilizing the binary erasure channel or source. We also propose the bootstrap string OT protocol which provides disjoint (weakened) privacy while achieving a multiplicative increase in rate, thus trading off security for rate. Finally, leveraging our OT protocol, we construct a protocol for SFC and establish a general lower bound on SFC capacity of the binary erasure channel and source.

cs.CR↗

arXiv2008

On Delayed Sequential Coding of Correlated Sources

Motivated by video coding applications, the problem of sequential coding of correlated sources with encoding and/or decoding frame-delays is studied. The fundamental tradeoffs between individual frame rates, individual frame distortions, and encoding/decoding frame-delays are derived in terms of a single-letter information-theoretic characterization of the rate-distortion region for general inter-frame source correlations and certain types of potentially frame specific and coupled single-letter fidelity criteria. The sum-rate-distortion region is characterized in terms of generalized directed information measures highlighting their role in delayed sequential source coding problems. For video sources which are spatially stationary memoryless and temporally Gauss-Markov, MSE frame distortions, and a sum-rate constraint, our results expose the optimality of idealized differential predictive coding among all causal sequential coders, when the encoder uses a positive rate to describe each frame. Somewhat surprisingly, causal sequential encoding with one-frame-delayed noncausal sequential decoding can exactly match the sum-rate-MSE performance of joint coding for all nontrivial MSE-tuples satisfying certain positive semi-definiteness conditions. Thus, even a single frame-delay holds potential for yielding significant performance improvements. Generalizations to higher order Markov sources are also presented and discussed. A rate-distortion performance equivalence between, causal sequential encoding with delayed noncausal sequential decoding, and, delayed noncausal sequential encoding with causal sequential decoding, is also established.

cs.IT↗

arXiv2007

Non-Parametric Field Estimation using Randomly Deployed, Noisy, Binary Sensors

The reconstruction of a deterministic data field from binary-quantized noisy observations of sensors which are randomly deployed over the field domain is studied. The study focuses on the extremes of lack of deterministic control in the sensor deployment, lack of knowledge of the noise distribution, and lack of sensing precision and reliability. Such adverse conditions are motivated by possible real-world scenarios where a large collection of low-cost, crudely manufactured sensors are mass-deployed in an environment where little can be assumed about the ambient noise. A simple estimator that reconstructs the entire data field from these unreliable, binary-quantized, noisy observations is proposed. Technical conditions for the almost sure and integrated mean squared error (MSE) convergence of the estimate to the data field, as the number of sensors tends to infinity, are derived and their implications are discussed. For finite-dimensional, bounded-variation, and Sobolev-differentiable function classes, specific integrated MSE decay rates are derived. For the first and third function classes these rates are found to be minimax order optimal with respect to infinite precision sensing and known noise distribution.

cs.IT↗

arXiv2007

One-bit Distributed Sensing and Coding for Field Estimation in Sensor Networks

This paper formulates and studies a general distributed field reconstruction problem using a dense network of noisy one-bit randomized scalar quantizers in the presence of additive observation noise of unknown distribution. A constructive quantization, coding, and field reconstruction scheme is developed and an upper-bound to the associated mean squared error (MSE) at any point and any snapshot is derived in terms of the local spatio-temporal smoothness properties of the underlying field. It is shown that when the noise, sensor placement pattern, and the sensor schedule satisfy certain weak technical requirements, it is possible to drive the MSE to zero with increasing sensor density at points of field continuity while ensuring that the per-sensor bitrate and sensing-related network overhead rate simultaneously go to zero. The proposed scheme achieves the order-optimal MSE versus sensor density scaling behavior for the class of spatially constant spatio-temporal fields.

cs.IT↗