We study Input Indistinguishable Computation (IIC), a security notion proposed by Micali, Pass, and Rosen in [14] and recently considered also by Garg, Goyal, Jain and Sahai in [9]. IIC aims at generalizing the notion of a Witness Indistinguishable (WI) proof system to general two-party functionalities and in its concurrent version (cIIC) also considers security against man-in-the-middle (MiM) ...

Nearly all spatial reasoning problems in­ volve uncertainty of one sort or another. Uncertainty arises due to the inaccuracies of sensors used in measuring distances and angles. We refer to this as directional un­ certainty. Uncertainty also arises in com­ bining spatial information when one loca­ tion is mistakenly identified with another. We refer to this as recognition uncertainty. Most prob...

We analyze the observability of motion estimates from the fusion of visual and inertial sensors. Because the model contains unknown parameters, such as sensor biases, the problem is usually cast as a mixed identification/filtering, and the resulting observability analysis provides a necessary condition for any algorithm to converge to a unique point estimate. Unfortunately, most models treat se...

We compare the properties of three-body systems obtained with two-body potentials with Pauli forbidden states and with the corresponding phase equivalent two-body potentials. In the first case the forbidden states are explicitly excluded in the calculation. Differences arise due to the off-shell properties of these on-shell equivalent potentials. We use the adiabatic hyperspherical method to fo...

Fast gradient sign attack series are popular methods that used to generate adversarial examples. However, most of the approaches based on fast cannot balance indistinguishability and transferability due limitations basic structure. To address this problem, we propose a method, called Adam Iterative Gradient Tanh Method (AI-FGTM), indistinguishable examples with high transferability. Besides, sm...