搜索结果: 31-45 共查到“军事学 secure computation”相关记录83条 . 查询时间(0.117 秒)
Overlaying Circuit Clauses for Secure Computation
set-universal circuit secure computation garbled circuit
2016/7/13
Our approach naturally and cheaply supports nested clauses. Our algorithm is a heuristic; we show that solving the circuit embedding problem is NP-hard. Our algorithms are in the semi-honest model and...
Faster Malicious 2-party Secure Computation with Online/Ofine Dual Execution
secure computation garbled circuits dual execution
2016/6/22
We describe a highly optimized protocol for general-purpose secure two-party computation (2PC) in the presence of malicious adversaries. Our starting point is a protocol of Kolesnikov \etal (TCC 2015)...
New Feasibility Results in Unconditional UC-Secure Computation with (Malicious) PUFs
Physically uncloneable functions UC security hardware setup assumptions
2016/6/22
Brzuska \etal. (Crypto 2011) proved that unconditional UC-secure computation is possible if parties have access to honestly generated physically unclonable functions (PUFs). Dachman-Soled \etal. (Cryp...
Breaking the Circuit Size Barrier for Secure Computation Under DDH
Secure computation function secret sharing private information retrieval
2016/6/7
Under the Decisional Diffie-Hellman (DDH) assumption, we present a 2-out-of-2 secret sharing scheme that supports a compact evaluation of branching programs on the shares. More concretely, there is an...
MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer
Multi-party computation oblivious transfer
2016/5/24
We consider the task of secure multi-party computation of arithmetic circuits over a finite field.
Unlike Boolean circuits, arithmetic circuits allow natural computations on integers to be expressed
...
Secure Computation from Elastic Noisy Channels
elastic noisy channels unfair noisy channels secure computation
2016/5/23
Noisy channels enable unconditionally secure multi-party computation even against parties with unbounded computational power. But inaccurate noise estimation and adversarially determined channel chara...
High-precision Secure Computation of Satellite Collision Probabilities
Secure Computation Numerical Analysis
2016/3/23
The costs of designing, building, launching and maintaining satellites make satellite operators extremely motivated to protect their on-orbit assets. Unfortunately, privacy concerns present a serious ...
The Exact Round Complexity of Secure Computation
Exact Round Complexity Multi-Party Computation Two-Party Computation
2016/3/9
We revisit the exact round complexity of secure computation in the multi-party and twoparty
settings. For the special case of two-parties without a simultaneous message exchange channel, this
questi...
A Framework for Outsourcing of Secure Computation
outsourcing of computation secure multiparty computation verifiable computation
2016/1/27
We study the problem of how to efficiently outsource a sensitive computation on secret inputs to a number of untrusted workers, under the assumption that at least one worker is honest.
An Empirical Study and some Improvements of the MiniMac Protocol for Secure Computation
Multiparty computation Constant-overhead Boolean Circuit
2016/1/23
Recent developments in Multi-party Computation (MPC) has resulted in very efficient protocols for dishonest majority in the preprocessing model. In particular, two very promising protocols for Boole...
We are interested in secure computation protocols in settings where the number of parties
is huge and their data even larger. Assuming the existence of a single-use broadcast channel
(per player), w...
General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
resettable tamper-proof hardware universal composability statistical security
2016/1/8
Universally composable secure computation was assumed to require trusted setups, until it
was realized that parties exchanging (untrusted) tamper-proof hardware tokens allow an alternative
approach ...
Oblivious RAMs (ORAMs) have traditionally been measured by their \emph{bandwidth overhead} and \emph{client storage}. We observe that when using ORAMs to build secure computation protocols for RAM pro...
Pseudonymous Broadcast and Secure Computation from Cryptographic Puzzles
computational puzzles distributed systems consensus
2016/1/6
In standard models of distributed computation, point-to-point channels
between parties are assumed to be authenticated by some preexisting
means. In other cases, even stronger pre-existing setup—e.g...
Circuits Resilient to Additive Attacks with Applications to Secure Computation
fault tolerant circuits secure computation
2016/1/4
We study the question of protecting arithmetic circuits against additive attacks, which can add
an arbitrary fixed value to each wire in the circuit. This extends the notion of algebraic manipulation...