• No results found

[PDF] Top 20 Fairplay A Secure Two-Party Computation System

Has 10000 "Fairplay A Secure Two-Party Computation System" found on our website. Below are the top 20 most common "Fairplay A Secure Two-Party Computation System".

Fairplay A Secure Two-Party Computation System

Fairplay A Secure Two-Party Computation System

... vs. computation. Another im- portant contribution of a working system is that it enables a systematic, realistic investigation of the rel- ative cost of its various ...the two-party SFE proto- ... See full document

17

Efficient  Server-Aided  Secure  Two-Party  Function  Evaluation  with  Applications  to  Genomic  Computation

Efficient Server-Aided Secure Two-Party Function Evaluation with Applications to Genomic Computation

... to two-party computation in presence of malicious participants, our solution reduces both computation and communication for the participants by at least two orders of ...the ... See full document

31

Ad-Hoc  Secure  Two-Party  Computation  on  Mobile  Devices  using  Hardware  Tokens

Ad-Hoc Secure Two-Party Computation on Mobile Devices using Hardware Tokens

... Ad-Hoc Secure Two-Party Computa- tion on Mobile Devices (§4) We develop a token-aided secure computation protocol which offloads the main workload of the GMW protocol to a ... See full document

20

Adaptively  Secure  Multi-Party  Computation  with  Dishonest  Majority

Adaptively Secure Multi-Party Computation with Dishonest Majority

... between two parties. Further note that for an OT call between two parties security is required only if at least one of the two parties is ...adaptively secure protocol it suffices for us to ... See full document

26

Malicious-Client  Security  in  Blind  Seer:  A  Scalable  Private  DBMS

Malicious-Client Security in Blind Seer: A Scalable Private DBMS

... achieve secure computation, also called secure function evaluation (SFE), which intuitively means that the two-party function is computed so that each of the parties learns no ... See full document

16

On  the  Exact  Round  Complexity  of  Secure  Three-Party  Computation

On the Exact Round Complexity of Secure Three-Party Computation

... a party takes three different roles across the three composed execution: an evaluator, a garbler who initiate the GC generation by picking the randomness, a co-garbler who verifies the sanity of the ...in ... See full document

70

Secure  Similarity  Coefficients  Computation  with  Malicious  Adversaries

Secure Similarity Coefficients Computation with Malicious Adversaries

... Execution in the Real Model. The malicious adversary may follow an arbitrary fea- sible strategy in the real model. Let f be as above and Π be as a two-party protocol for computing f . Furthermore, let A be ... See full document

15

Amending Protection and Efficiency in Information Sharing

Amending Protection and Efficiency in Information Sharing

... a secure two- party computation such that any curious key generation center or data storing center cannot derive the private keys ...sharing system against any system managers as ... See full document

5

Round-Optimal  Secure  Multi-Party  Computation

Round-Optimal Secure Multi-Party Computation

... In [GMPP16], Garg, et al., proved a lower bound of four rounds for MPC protocols that relies on black-box simulation. Following this work, in independent works, Ananth, Choudhuri and Jain [ACJ17] and Brakerski, Halevi ... See full document

53

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

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

... of secure prediction benchmarks including linear and naïve bayes classifiers, decision trees, deep neural networks, state-of-the-art classifiers from Tensor- flow [1] and Bonsai [36], and also the matrix ... See full document

15

Cut-and-Choose  Bilateral  Oblivious  Transfer   and  Its  Application  in  Secure  Two-party  Computation

Cut-and-Choose Bilateral Oblivious Transfer and Its Application in Secure Two-party Computation

... malicious party in Yan’s protocol can successfully cheat only if they generate exactly κ − c fake garbled circuits and none of them is checked by the other ... See full document

18

Encryption  Switching  Protocols

Encryption Switching Protocols

... Secure Two-Party and Multiparty Computation. Secure two-party computation (2-PC) targets the following problem: Alice and Bob, modeled as probabilistic ... See full document

54

Actively  Secure  OT  Extension  with  Optimal  Overhead

Actively Secure OT Extension with Optimal Overhead

... only secure against passive adversaries, who are trusted to strictly follow the ...actively secure protocols, which remain secure against arbitrary deviations from the protocol, typically most ... See full document

18

Secure Multi Party Computation Technique for Classification Rule Sharing

Secure Multi Party Computation Technique for Classification Rule Sharing

... into two categories, derived based on the privacy level provided to the data held by each party or data custodians as in referred here namely Secure Multiparty computation and partial ... See full document

10

Non-Interactive  Secure  Computation  from  One-Way  Functions

Non-Interactive Secure Computation from One-Way Functions

... of two individuals and determines whether or not they are ...either party from influencing the output (beyond the choice of their respective inputs), while also ensuring the privacy of their DNA ... See full document

22

Partially-Fair  Computation  from  Timed-Release  Encryption   and  Oblivious  Transfer

Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer

... Two Party Computation against Covert ...of two-party computation captures security against malicious adversaries, who can mount arbitrary attacks on a ... See full document

26

Secure  Two-Party  Computation  with  Reusable  Bit-Commitments,  via  a    Cut-and-Choose  with  Forge-and-Lose  Technique

Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique

... third party would choose, the protocol needs to ensure that the final UH BitCom values of the protocol are ...each party, independently of the number of ... See full document

75

On  Secure  Two-party  Integer  Division

On Secure Two-party Integer Division

... the two-party Pailier- based setting, they are easily converted to both the multiparty setting as well as to other forms of secure arithmetic, ...unconditionally secure multiparty ... See full document

24

From  FE  Combiners  to  Secure  MPC   and  Back

From FE Combiners to Secure MPC and Back

... to secure MPC: Our first result shows how to construct a passively secure multi-party computation protocol that is both round-optimal (two rounds) and communication efficient (depends ... See full document

51

Mobile  Commerce:  Secure  Multi-party  Computation &  Financial  Cryptography

Mobile Commerce: Secure Multi-party Computation & Financial Cryptography

... payment system: what are the economic benefits? who is doing the cost-benefit analysis? How can it mitigate the risks of black money, fake or counterfeit currencies, terrorism, corruption and ease of doing ... See full document

13

Show all 10000 documents...