Towards a marketplace for secure outsourced computations
This paper presents Kosto–a framework that provisions a marketplace for secure outsourced
computations, wherein the pool of computing resources aggregates that which are offered …
computations, wherein the pool of computing resources aggregates that which are offered …
Secure multiparty computation with free branching
We study secure multi-party computation (MPC) protocols for branching circuits that contain
multiple sub-circuits (ie, branches) and the output of the circuit is that of single “active” …
multiple sub-circuits (ie, branches) and the output of the circuit is that of single “active” …
David & goliath oblivious affine function evaluation-asymptotically optimal building blocks for universally composable two-party computation from a single untrusted …
N Döttling, D Kraschewski… - Cryptology ePrint Archive, 2012 - eprint.iacr.org
In a seminal work, Katz (Eurocrypt 2007) showed that parties being able to issue tamper-
proof hardware can implement universally composable secure computation without a trusted …
proof hardware can implement universally composable secure computation without a trusted …
Revocation in publicly verifiable outsourced computation
The combination of software-as-a-service and the increasing use of mobile devices gives
rise to a considerable difference in computational power between servers and clients. Thus …
rise to a considerable difference in computational power between servers and clients. Thus …
Universally composable multiparty computation with partially isolated parties
It is well known that universally composable multiparty computation cannot, in general, be
achieved in the standard model without setup assumptions when the adversary can corrupt …
achieved in the standard model without setup assumptions when the adversary can corrupt …
Constant-round asynchronous multi-party computation based on one-way functions
Secure multi-party computation (MPC) allows several mutually distrustful parties to securely
compute a joint function of their inputs and exists in two main variants: In synchronous MPC …
compute a joint function of their inputs and exists in two main variants: In synchronous MPC …
One-sided adaptively secure two-party computation
Adaptive security is a strong security notion that captures additional security threats that are
not addressed by static corruptions. For instance, it captures real-world scenarios where …
not addressed by static corruptions. For instance, it captures real-world scenarios where …
Asynchronous multi-party computation with quadratic communication
M Hirt, JB Nielsen, B Przydatek - International Colloquium on Automata …, 2008 - Springer
We present an efficient protocol for secure multi-party computation in the asynchronous
model with optimal resilience. For n parties, up to t< n/3 of them being corrupted, and …
model with optimal resilience. For n parties, up to t< n/3 of them being corrupted, and …
How to simulate it in isabelle: Towards formal proof for secure multi-party computation
Abstract In cryptography, secure Multi-Party Computation (MPC) protocols allow participants
to compute a function jointly while keeping their inputs private. Recent breakthroughs are …
to compute a function jointly while keeping their inputs private. Recent breakthroughs are …
Fortified Multi-Party Computation: Taking Advantage of Simple Secure Hardware Modules
B Broadnax, A Koch, J Mechler, T Müller… - Proceedings on …, 2021 - petsymposium.org
In practice, there are numerous settings where mutually distrusting parties need to perform
distributed computations on their private inputs. For instance, participants in a first-price …
distributed computations on their private inputs. For instance, participants in a first-price …