搜索结果: 1-15 共查到“军事学 Secure Computation”相关记录83条 . 查询时间(0.14 秒)
Optimizing Transport Layer for Secure Computation
Framework Transport layer Garbled circuits Implementation
2019/7/22
Transport layer: Although significantly improved, the performance of 2PC is still prohibitive for practical systems. Contrary to the common belief that bandwidth is the remaining bottleneck for 2PC im...
Secure Computation for Cloud data Storage
Multi-party computation semi-trusted cloud data security
2019/6/19
One of the main goals of securing data transmission is focused on the security of cloud data storage. In this paper, we describe several cryptographic techniques which can be used to address the relev...
Unconditionally Secure Computation Against Low-Complexity Leakage
Low-Complexity Leakage complexity-theoretic assumptions
2019/6/4
We consider the problem of constructing leakage-resilient circuit compilers that are secure against global leakage functions with bounded output length. By global, we mean that the leakage can depend ...
A Practical Approach to the Secure Computation of the Moore-Penrose Pseudoinverse over the Rationals
secure linear algebra multiparty computation Moore-Penrose pseudoinverse
2019/5/13
We devise an efficient and data-oblivious algorithm for solving a bounded integral linear system of arbitrary rank over the rational numbers via the Moore-Penrose pseudoinverse, using finite-field ari...
Field Extension in Secret-Shared Form and Its Applications to Efficient Secure Computation
secure computation secret sharing, active security
2019/4/16
Secure computation enables participating parties to jointly compute a function over their inputs while keeping them private. Secret sharing plays an important role for maintaining privacy during the c...
Secure Computation of the $k^\text{th}$-ranked Integer on Blockchains
applications secret sharing zero knowledge
2019/3/13
We focus on securely computing the kthkth-ranked integer in a sequence of integers distributed among nn parties, e.g., the largest or smallest integer or the median. Our specific objective is low inte...
We show that classical rewinding-based simulation techniques used in many security proofs fail against blockchain-active adversaries that have read and post access to a global blockchain. In particula...
Perfect Secure Computation in Two Rounds
MPC MPRE
2018/11/9
We show that any multi-party functionality can be evaluated using a two-round protocol with perfect correctness and perfect semi-honest security, provided that the majority of parties are honest. This...
Reusable Non-Interactive Secure Computation
oblivious transfer oblivious linear-function evaluation non-interactive secure computation
2018/11/7
We consider the problem of Non-Interactive Secure Computation (NISC), a 2-message ``Sender-Receiver'' secure computation protocol that retains its security even when both parties can be malicious. Whi...
Non-Interactive Secure Computation from One-Way Functions
Secure Computation Hardware Tokens
2018/11/2
The notion of non-interactive secure computation (NISC) first introduced in the work of Ishai et al. [EUROCRYPT 2011] studies the following problem: Suppose a receiver R wishes to publish an encryptio...
Fast Secure Computation for Small Population over the Internet
Secure Multiparty Computation Fairness Guaranteed Output Delivery
2018/8/2
Secure Multi-Party Computation (MPC) with small number of parties is an interesting area of research, primarily due to its ability to model most real-life MPC applications and the simplicity and effic...
Limits of Practical Sublinear Secure Computation
Secure Computation Private Information Retrieval Sublinear Communication
2018/6/6
Secure computations on big data call for protocols that have sublinear communication complexity in the input length. While fully homomorphic encryption (FHE) provides a general solution to the problem...
Pushing the Communication Barrier in Secure Computation using Lookup Tables
Secure computation compiler GMW lookup tables
2018/5/28
Secure two-party computation has witnessed significant efficiency improvements in the recent years. Current implementations of protocols with security against passive adversaries generate and process ...
Secure Computation using Leaky Correlations (Asymptotically Optimal Constructions)
MPC protocols Correlation Extractors Small Bias Distributions
2018/5/2
Most secure computation protocols can be effortlessly adapted to offload a significant fraction of their computationally and cryptographically expensive components to an offline phase so that the part...
This paper initiates a study of Fine Grained Secure Computation: i.e. the construction of secure computation primitives against ``moderately complex" adversaries. We present definitions and constructi...