We describe an actively secure OT extension protocol in the random oracle model with efficiency very close to the passively secure IKNP protocol of Ishai et al. (Crypto 2003). For computational security parameter κ, our protocol requires κ base OTs, and is the first practical, actively secure protocol to match the cost of the passive IKNP extension in this regard. The added communication cost i...

An anonymous ring network is a ring where all processors (vertices) are totally indistinguishable except for their input value. Initially, to each vertex of the ring is associated a value from a totally ordered set; thus, forming a multiset. In this paper we consider the problem of sorting such a distributed multiset and we investigate its relationship with the election problem. We focus on the...

As an alternative to synthesis-by-rule, the use of neural networks in speech synthesis has been successfully applied to prosody generation, yet it is not known precisely which input parameters are responsible for good results. The approach presented here tries to quantify the contribution of each input parameter. This is done first by comparing the mean errors of networks trained with only one ...

We define an aggregation function to be (at most) k-intolerant if it is bounded from above by its kth lowest input value. Applying this definition to the discrete Choquet integral and its underlying capacity, we introduce the concept of k-intolerant capacities which, when varying k from 1 to n, cover all the possible capacities on n objects. Just as the concepts of k-additive capacities and p-s...

We construct a provably secure mix-net from any CCA2 secure cryptosystem. The mix-net is secure against active adversaries that statically corrupt less than λ out of k mix-servers, where λ is a threshold parameter, and it is robust provided that at most min(λ− 1, k − λ) mix-servers are corrupted. The main component of our construction is a mix-net that outputs the correct result if all mix-serv...

In this paper we propose a new solution which utilizing the Gyro Sensor and Tilt Sensor in real-time controlling the balance of wheelchair seat. The existing wheelchair systems have the risk of falling when users go uphill because of the uneven weight allocation. But when applying our new method, the wheelchair seat can automatically adjust to maintain the balance therefore provides a safer and...

This paper provides three improvements over previous work on analyzing CubeHash, based on its classes of symmetric states: (1) We present a detailed analysis of the hierarchy of symmetry classes. (2) We point out some flaws in previously claimed attacks which tried to exploit the symmetry classes. (3) We present and analyze new multicollision and preimage attacks. For the default parameter sett...

We present a new type of probabilistic model which we call DISsimilarity COefficient Networks (DISCO Nets). DISCO Nets allow us to efficiently sample from a posterior distribution parametrised by a neural network. During training, DISCO Nets are learned by minimising the dissimilarity coefficient between the true distribution and the estimated distribution. This allows us to tailor the training...

This article is concerned with the Euler’s function [10] that plays an important role in cryptograms. In the first section, we present some selected theorems on integers. Next, we define the Euler’s function. Finally, three theorems relating to the Euler’s function are proved. The third theorem concerns two relatively prime integers which make up the Euler’s function parameter. In the public ke...

This paper addresses the problem of assigning shares of a new total fixed output to a group of decision making units (DMUs) using data envelopment analysis (DEA), by assuming the existence of a predefined hyperbolic locus of points that characterizes the DEA frontier. The problem of redistributing an already existing output is then addressed, where the total value of this output may vary, so th...