• No results found

[PDF] Top 20 Secure Multi-Party Computation with Identifiable Abort

Has 10000 "Secure Multi-Party Computation with Identifiable Abort" found on our website. Below are the top 20 most common "Secure Multi-Party Computation with Identifiable Abort".

Secure  Multi-Party  Computation  with  Identifiable  Abort

Secure Multi-Party Computation with Identifiable Abort

... with abort: Either the protocol succeeds, in which case every party receives its output, or the protocol aborts, in which case all honest parties learn that the protocol ...upon abort every ... See full document

37

A Proposal of Back Propagation Learning for Secure Multi-Party Computation Methods

A Proposal of Back Propagation Learning for Secure Multi-Party Computation Methods

... on secure sharing and computing methods are desired to avoid secure risks being abused or ...The secure multi-party computa- tion (SMC) is one of these ...with secure shared data ... See full document

6

From  Keys  to  Databases --   Real-World  Applications  of  Secure  Multi-Party  Computation

From Keys to Databases -- Real-World Applications of Secure Multi-Party Computation

... example, secure multi-party computation systems are typically characterized as providing a certain level of security against either a semi-honest, covert, or malicious adversary ...input ... See full document

32

Adaptively  Secure  Multi-Party  Computation  from  LWE (via  Equivocal  FHE)

Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE)

... Achieving a simulatable protocol. A harder problem is how to simulate the output phase in which ciphertexts containing the outputs are decrypted. In the simulation we cannot expect that these ciphertexts are correctly ... See full document

31

Secure Multi-party Computation Protocols For
          Collaborative Data Publishing With m-Privacy

Secure Multi-party Computation Protocols For Collaborative Data Publishing With m-Privacy

... The experiments confirm that the specification of the multi-QID anonymity requirement helps avoid unnecessary masking and, therefore, preserves more of the cluster structure. However, if the data recipient and the ... See full document

5

Everlasting  Multi-Party  Computation

Everlasting Multi-Party Computation

... is secure against adversaries that are computationally unlimited after the protocol ...as secure communication and oblivious transfer cannot be achieved with everlasting ...implement secure com- ... See full document

53

Improved  Signature  Schemes  for  Secure  Multi-Party  Computation  with  Certified  Inputs

Improved Signature Schemes for Secure Multi-Party Computation with Certified Inputs

... In this work we study two types of signatures in the context of this problem: (i) CL-signatures [6, 7] which were designed for anonymity applications and achieve both message privacy and unlink- ability of multiples ... See full document

25

Upending  Stock  Market  Structure  Using  Secure  Multi-Party  Computation

Upending Stock Market Structure Using Secure Multi-Party Computation

... particular multi-party secure computation, to setup a novel stock market structure that, to a large extent, removes the negative consequences of liquidity costs and periodic price ...by ... See full document

15

Adaptively  Secure,  Universally  Composable,  Multi-Party  Computation  in  Constant  Rounds

Adaptively Secure, Universally Composable, Multi-Party Computation in Constant Rounds

... for secure computation, there are several different ad- versarial models one can ...are secure in a static-corruption model, but that are trivially insecure in the adaptive ... See full document

26

Online consecutive secure multi-party computation algorithm for preserving privacy

Online consecutive secure multi-party computation algorithm for preserving privacy

... with secure multi-party computation algorithms. A secure, applicable and standard offline multi-party aggregation algorithm is developed using ElGamal cryptosystem, due to ... See full document

37

How  Fair  is  Your  Protocol?  A  Utility-based  Approach  to  Protocol  Optimality

How Fair is Your Protocol? A Utility-based Approach to Protocol Optimality

... upon abort, the amount of computation that the honest party needs for producing the output is comparable to the adversary’s for the same task; this is clearly not the case for any of the protocols, ... See full document

30

EzPC:  Programmable,  Efficient,   and  Scalable  Secure  Two-Party  Computation  for  Machine  Learning

EzPC: Programmable, Efficient, and Scalable Secure Two-Party Computation for Machine Learning

... Fairplay’s Secure Function Definition Language (SFDL) [5, 41] and CBMC-GC [29] compile C or Pascal like programs into boolean circuits that are then evaluated using garbled circuits ...In Secure ... See full document

15

On  the  Exact  Round  Complexity  of  Secure  Three-Party  Computation

On the Exact Round Complexity of Secure Three-Party Computation

... remaining party to carry out the responsibility of circuit ...different party enacting the role of the evaluator (much like ...‘identifiable abort’. For the fair and unanimous abort, ... See full document

70

Secure  Two-Party  Computation  over  Unreliable  Channels

Secure Two-Party Computation over Unreliable Channels

... for secure 2PC protocols over noisy channels, the state of the art is a compiler by Ishai et ...(with abort) and achieves statistical security by utilizing the strong machinery of the IPS compiler ...to ... See full document

28

Revisiting  Secure  Two-Party  Computation  with  Rational  Players

Revisiting Secure Two-Party Computation with Rational Players

... rational party wishes to learn the output while allowing as few others as possible to learn the ...rational party chooses abort to maximize its ... See full document

13

On  the  Communication  Complexity  of  Secure  Computation

On the Communication Complexity of Secure Computation

... a secure multi-party computation protocol, with a few notable exceptions ...a secure multi-party computation protocol [3,9], such lower bounds would imply ... See full document

18

Secure  Multi-Party  Shuffling

Secure Multi-Party Shuffling

... In secure multi-party shuffling (MPS) problem, a group of parties each holding an input value want to randomly permute their inputs while ensuring no party can map any of the outputs to any of ... See full document

24

AN ENHANCED RULE APPROACH FOR NETWORK INTRUSION DETECTION USING EFFICIENT DATA 
ADAPTED DECISION TREE ALGORITHM

AN ENHANCED RULE APPROACH FOR NETWORK INTRUSION DETECTION USING EFFICIENT DATA ADAPTED DECISION TREE ALGORITHM

... of secure multi-party computation market to become more ...the secure computation well is the key thought of each enterprise, secure multi-party ... See full document

7

Multi-Party computation with omnipresent adversary

Multi-Party computation with omnipresent adversary

... construct a perfectly secure MPC with an omnipresent adversary, we employ the MPC protocol from [4]. In the case of passively corrupted participants, if n ≥ 2t+ 1, their t-private MPC protocol provides perfect ... See full document

17

SECURE  MULTI-PARTY  COMPUTATION:  HOW  TO  SOLVE  THE  CONFLICT  BETWEEN  SECURITY &  BUSINESS  INTELLIGENCE

SECURE MULTI-PARTY COMPUTATION: HOW TO SOLVE THE CONFLICT BETWEEN SECURITY & BUSINESS INTELLIGENCE

... of secure multi-party computation ...a computation based on their private inputs but neither of them wants to share its proprietary data set to ...of secure multi- ... See full document

7

Show all 10000 documents...