搜索结果: 1-15 共查到“军事学 Computation”相关记录466条 . 查询时间(0.088 秒)
Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation
Fairness and Guaranteed Output Delivery MPC Round Complexity
font style='font-size:12px;'>
2019/9/5
Two of the most sought-after properties of Multi-party Computation (MPC) protocols are fairness and guaranteed output delivery (GOD), the latter also referred to as robustness. Achieving both, however...
A High-Assurance, Automatically-Synthesized, Evaluator for Machine-Checked (Proactively) Secure Multi-Party Computation
Secure Multi-Party Computation Verified Implementation High-Assurance Cryptography
font style='font-size:12px;'>
2019/8/14
Secure Multi-Party Computation (MPC) enables a group of nn distrusting parties to jointly compute a function using private inputs. MPC guarantees correctness of computation and confidentiality of inpu...
Efficient Information-Theoretic Secure Multiparty Computation over Z/pkZ via Galois Rings
MPC Galois Rings
font style='font-size:12px;'>
2019/7/30
At CRYPTO 2018, Cramer et al. introduced a secret-sharing based protocol called SPDZ2kZ2k that allows for secure multiparty computation (MPC) in the dishonest majority setting over the ring of integer...
Fast Actively Secure Five-Party Computation with Security Beyond Abort
Secure Multiparty Computation Guaranteed Output Delivery Fairness
font style='font-size:12px;'>
2019/7/26
Secure Multi-party Computation (MPC) with small population and honest majority has drawn focus specifically due to customization in techniques and resulting efficiency that the constructions can offer...
Optimizing Transport Layer for Secure Computation
Framework Transport layer Garbled circuits Implementation
font style='font-size:12px;'>
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...
Verifiable Computing for Approximate Computation
verifiable computing interactive proofs approximate arithmetic
font style='font-size:12px;'>
2019/7/8
Verifiable computing (VC) is a complexity-theoretic method to secure the integrity of computations. The need is increasing as more computations are outsourced to untrusted parties, e.g., cloud platfor...
Privacy-Preserving Classification of Personal Text Messages with Secure Multi-Party Computation: An Application to Hate-Speech Detection
cryptographic protocols SMC
font style='font-size:12px;'>
2019/6/26
Classification of personal text messages has many useful applications in surveillance, e-commerce, and mental health care, to name a few. Giving applications access to personal texts can easily lead t...
Secure Computation for Cloud data Storage
Multi-party computation semi-trusted cloud data security
font style='font-size:12px;'>
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...
Improved Building Blocks for Secure Multi-Party Computation based on Secret Sharing with Honest Majority
cryptographic protocols secret sharing
font style='font-size:12px;'>
2019/6/19
Secure multi-party computation permits evaluation of any desired functionality on private data without disclosing the data to the participants and is gaining its popularity due to increasing collectio...
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation
oblivious transfer differential privacy hardness amplification
font style='font-size:12px;'>
2019/6/4
Consider a PPT two-party protocol Π=(A,B)Π=(A,B) in which the parties get no private inputs and obtain outputs OA,OB∈{0,1}OA,OB∈{0,1}, and let VAVA and VBVB denote the parties' individual views. Proto...
Unconditionally Secure Computation Against Low-Complexity Leakage
Low-Complexity Leakage complexity-theoretic assumptions
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...
Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
NFS optimal ate pairing computation
font style='font-size:12px;'>
2019/4/28
Recent algorithmic improvements of discrete logarithm computation in special extension fields threaten the security of pairing-friendly curves used in practice. A possible answer to this delicate situ...
A Single Shuffle Is Enough for Secure Card-Based Computation of Any Circuit
Card-based protocols Secure computations Garbled circuits
font style='font-size:12px;'>
2019/4/16
It is known that information-theoretically secure computation can be done by using a deck of physical cards. In card-based protocols, shuffles, which covertly rearrange the order of cards according to...
Field Extension in Secret-Shared Form and Its Applications to Efficient Secure Computation
secure computation secret sharing, active security
font style='font-size:12px;'>
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...