Proper data items distribution may seriously improve the performance of processing in distributed environment. However, typical datastorage systems as well computational frameworks do not pay special attention to that aspect. In this paper author introduces two custom addressing methods for on example Scalable Distributed Two-Layer Datastore. The basic idea those is preserve stored same cluster...

In this paper, we introduce a new class of bivariate distributions by compounding the bivariate generalized exponential and power-series distributions. This new class contains some new sub-models such as the bivariate generalized exponential distribution, the bivariate generalized exponential-poisson, -logarithmic, -binomial and -negative binomial distributions. We derive different properties o...

Security proofs of quantum key distribution (QKD) often require post-processing schemes to simplify the data structure, and hence the security proof. We show a generic method to improve resulting secure key rates by partially reversing the simplifying post-processing for error correction purposes. We apply our method to the security analysis of device-independent QKD schemes and of detection-de...

Turbo coding is a powerful class of forward error correcting codes, which can achieve performances close to the Shannon limit. The turbo principle can be applied to the problem of side-information source coding, and we investigate here its application to the reconciliation problem occuring in a continuous-variable quantum key distribution protocol.

In 1992, Blundo et al. have proposed a non-interactive k-secure m-conference protocol based on an m-variate polynomial over a finite field Fp. The key distribution center (KDC) is responsible to pick a symmetric m-variate polynomial of degree k and generate shares for users. Each share is a symmetric polynomial involving m− 1 variables of degree k, and needs to store the coefficients of such a ...

Information theoretically secure distributed storage system with quantum key distribution network and password authenticated secret sharing scheme M. Fujiwara1*, A. Waseda1, R. Nojima1, S. Moriai1, W. Ogata2 and M. Sasaki1 1National Institute of Information and Communications Technology (NICT), 4-2-1 Nukui-kita, Koganei, Tokyo 184-8795, Japan 2Tokyo Institute of Technology, 2-12-1 Ookayama, Meg...

We discuss the difficulties of photon-counting at extremely high rates and introduce a scheme for a photon-counting detection system that addresses these difficulties. The method uses an array of N detectors and a 1-by-N optical switch with a control circuit to direct input light to live detectors. We compare performance of our system to other, passive detection systems and show that our detect...

Time-energy high-dimensional quantum key distribution (HD-QKD) leverages the high-dimensional nature of time-energy entangled biphotons and the loss tolerance from the discrete nature of single-photon detection thus enabling long-distance key distribution with high photon information efficiency (PIE). However, the security of HD-QKD has only been proven in the asymptotic regime, or in the finit...

In comparing the mean count of two independent samples, some practitioners would use the t-test or the Wilcoxon rank sum test while others may use methods based on a Poisson model. It is not uncommon to encounter count data that exhibit overdispersion where the Poisson model is no longer appropriate. This paper deals with methods for overdispersed data using the negative binomial distribution r...

Bi-directional Transmission (or Reflection) Distribution Functions, commonly named BTDFs (and BRDFs), are essential quantities to describe any complex fenestration system in details. They are defined as the ratio of the luminance diffused from a surface element in a given direction (after transmission or reflection), and the illuminance incident on the sample. However, these functions are capab...