Add to ORKGAbstract We show how a (big) PEZ dispenser can be used by two or more players to compute a functionof their inputs while hiding the values of the inputs from each other. In contrast to traditiona
Card-based protocols allow to evaluate an arbitrary fixed Boolean function f on a hidden input to ob...
Classical results in unconditionally secure multi-party computation (MPC) protocols with a passive a...
Abstract—The existing work on distributed secure multi-party computation, e.g., set operations, dot ...
AbstractWe show how a (big) PEZ dispenser can be used by two or more players to compute a function o...
We show how two or more deterministic players can privately compute a function of their inputs using...
AbstractMany simple calculations can be done easier without computers than by using them. We show th...
We introduce covert two-party computation, a stronger notion of security than standard secure twopar...
Two parties, each holding one input of a two-variable function, communicate in order to determine th...
. This paper improves on the classical results in unconditionally secure multi-party computation amo...
We introduce an extension of covert two-party computation (as introducted by von Ahn, Hopper, Langfo...
Secure computation is the computation of a function over private inputs. In the general setting, par...
Abstract. In secure multiparty computation, a set of mutually mistrusting players engage in a protoc...
The number of opportunities for cooperative computation has exponentially been increasing with growi...
In this work we revisit the SPDZ multiparty computation protocol by Damgård et al. for securely comp...
In this work we revisit the SPDZ multiparty computation protocol by Damgård et al. for securely comp...
Card-based protocols allow to evaluate an arbitrary fixed Boolean function f on a hidden input to ob...
Classical results in unconditionally secure multi-party computation (MPC) protocols with a passive a...
Abstract—The existing work on distributed secure multi-party computation, e.g., set operations, dot ...
AbstractWe show how a (big) PEZ dispenser can be used by two or more players to compute a function o...
We show how two or more deterministic players can privately compute a function of their inputs using...
AbstractMany simple calculations can be done easier without computers than by using them. We show th...
We introduce covert two-party computation, a stronger notion of security than standard secure twopar...
Two parties, each holding one input of a two-variable function, communicate in order to determine th...
. This paper improves on the classical results in unconditionally secure multi-party computation amo...
We introduce an extension of covert two-party computation (as introducted by von Ahn, Hopper, Langfo...
Secure computation is the computation of a function over private inputs. In the general setting, par...
Abstract. In secure multiparty computation, a set of mutually mistrusting players engage in a protoc...
The number of opportunities for cooperative computation has exponentially been increasing with growi...
In this work we revisit the SPDZ multiparty computation protocol by Damgård et al. for securely comp...
In this work we revisit the SPDZ multiparty computation protocol by Damgård et al. for securely comp...
Card-based protocols allow to evaluate an arbitrary fixed Boolean function f on a hidden input to ob...
Classical results in unconditionally secure multi-party computation (MPC) protocols with a passive a...
Abstract—The existing work on distributed secure multi-party computation, e.g., set operations, dot ...