搜索结果: 16-30 共查到“军事学 secure computation”相关记录83条 . 查询时间(0.109 秒)
A New Approach to Black-Box Concurrent Secure Computation
black-box construction concurrent security multi-party computation
2018/3/7
We consider the task of constructing concurrently composable protocols for general secure computation by making only black-box use of underlying cryptographic primitives. Existing approaches for this ...
Two-Round Multiparty Secure Computation Minimizing Public Key Operations
cryptographic protocols public-key operations
2018/3/6
We show new constructions of semi-honest and malicious two-round multiparty secure computation protocols using only (a fixed) poly(n,λ)poly(n,λ) invocations of a two-round oblivious transfer protocol ...
Secure Computation with Low Communication from Cross-checking
malicious security robustness
2018/3/5
We construct new four-party protocols for secure computation that are secure against a single malicious corruption. Our protocols can perform computations over a binary ring, and require sending just ...
Chameleon: A Hybrid Secure Computation Framework for Machine Learning Applications
SFE CCS'17
2017/12/1
We present Chameleon, a novel hybrid (mixed-protocol) framework for secure function evaluation (SFE) which enables two parties to jointly compute a function without disclosing their private inputs. Ch...
We provide new two-round multiparty secure computation (MPC) protocols assuming the minimal assumption that two-round oblivious transfer (OT) exists. If the assumed two-round OT protocol is secure aga...
Differentially Private Access Patterns in Secure Computation
secure computation differential privacy
2017/10/19
We explore a new security model for secure computation on large datasets. We assume that two servers have been employed to compute on private data that was collected from many users, and, in order to ...
Scaling ORAM for Secure Computation
Oblivious RAM Private Information Retrieval Secure Multi-Party Computation
2017/9/1
We design and implement a Distributed Oblivious Random Access Memory (ORAM) data structure that is optimized for use in two-party secure computation protocols. We improve upon the access time of previ...
Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions
Zero knowledge Witness indistinguishability Super-polynomial simulation
2017/5/23
We study the feasibility of two-message protocols for secure two-party computation in the plain model, for functionalities that deliver output to one party, with security against malicious parties. Si...
We construct a 4-round multi-party computation protocol for any functionality, which is secure against a malicious adversary. Our protocol relies on the sub-exponential hardness of the Learning with E...
Faster LEGO-based Secure Computation without Homomorphic Commitments
cryptographic protocols maliciously secure two-party computation
2017/3/9
LEGO-style cut-and-choose is known for its asymptotic efficiency in realizing actively-secure computations. The dominant cost of LEGO protocols is due to wire-soldering — the key technique enabling to...
Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
secure computation homomorphic secret sharing share conversion
2017/2/23
A recent work of Boyle et al. (Crypto 2016) suggests that ``group-based'' cryptographic protocols, namely ones that only rely on a cryptographically hard (Abelian) group, can be surprisingly powerful....
Ad Hoc PSM Protocols: Secure Computation Without Coordination
Secure Computation Information-Theoretic Security Obfuscation
2017/2/21
We study the notion of {\em ad hoc secure computation}, recently introduced by Beimel et al. (ITCS 2016), in the context of the {\em Private Simultaneous Messages} (PSM) model of Feige et al.\ (STOC 2...
Optimizing Secure Computation Programs with Private Conditionals
languages for secure computation static analysis graph theory
2016/12/8
Secure multiparty computation platforms are often provided with a programming language that allows
to write privacy-preserving applications without thinking of the underlying cryptography. The contro...
Secure Computation in Online Social Networks
Secure multi-party computation online social network privacy
2016/12/8
Apart from their numerous other benefits, online social networks (OSNs) allow users to jointly compute on each other’s data (e.g., profiles, geo-locations, medical records, etc.). Privacy issues natur...
Gate-scrambling Revisited - or: The TinyTable protocol for 2-Party Secure Computation
implementation secure two-party computation
2016/7/14
We propose a new protocol, nicknamed TinyTable, for maliciously secure 2-party computation in the preprocessing model. One version of the protocol is useful in practice and allows, for instance, secur...