• No results found

[PDF] Top 20 Secure Similarity Coefficients Computation with Malicious Adversaries

Has 10000 "Secure Similarity Coefficients Computation with Malicious Adversaries" found on our website. Below are the top 20 most common "Secure Similarity Coefficients Computation with Malicious Adversaries".

Secure  Similarity  Coefficients  Computation  with  Malicious  Adversaries

Secure Similarity Coefficients Computation with Malicious Adversaries

... Abstract. Similarity coefficients play an important role in many application ...privacy-preserving similarity coefficients protocol for binary data was proposed by Wong and Kim (Computers and ... See full document

15

More  Efficient  Oblivious  Transfer  Extensions  with  Security  for  Malicious  Adversaries

More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries

... increasing computation through more work in the consistency check ...actively secure OT extension protocol, which only has 20% more time and 50% more communication than the passively secure OT ... See full document

36

Universally  Composable  Secure  Computation  with (Malicious)  Physically  Uncloneable  Functions

Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions

... of adversaries that can create malicious ...consider adversaries making “hidden” queries to PUFs (so that the simulator can not observe these ...stronger adversaries and in both cases we give ... See full document

53

Multi-Client  Verifiable  Computation  with  Stronger  Security  Guarantees

Multi-Client Verifiable Computation with Stronger Security Guarantees

... We then present a generic compiler that upgrades our intermediate solution (as well as the one by Choi et al. [15]) to handle an arbitrary subset of malicious clients. While we could rely on standard techniques ... See full document

34

Efficient  Interval  Check  in  the  Presence  of  Malicious  Adversaries

Efficient Interval Check in the Presence of Malicious Adversaries

... a secure two-party computation problem: Two parties, Client and Server, each with an integer b and an integer interval [a, e] respectively, want to evaluate whether b ∈ [a, e], such that: (i) Client can not ... See full document

17

Topology-Hiding  Computation  Beyond  Semi-Honest  Adversaries

Topology-Hiding Computation Beyond Semi-Honest Adversaries

... obtain secure MPC protocols, which requires a way to bound the aggregated leakage when multiple small-leakage protocols are executed in parallel or ...topology-hiding computation on ... See full document

33

Fast  Large-Scale  Honest-Majority  MPC  for  Malicious  Adversaries

Fast Large-Scale Honest-Majority MPC for Malicious Adversaries

... circuit computation, thereby constituting a SPDZ-like MAC ...the computation, and so any cheating by the adversary will be ...actually secure for malicious adversaries up to an additive ... See full document

31

On  the  Oblivious  Transfer  Capacity  of  Generalized  Erasure  Channels  against  Malicious  Adversaries

On the Oblivious Transfer Capacity of Generalized Erasure Channels against Malicious Adversaries

... information-theoretically secure key agreement, commit- ment and oblivious transfer protocols, among ...for secure multi- party computation, and the OT capacity characterizes how efficiently a ... See full document

15

Blazing  Fast 2PC  in  the  Offline/Online  Setting   with  Security  for  Malicious  Adversaries

Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries

... efficient secure two-party (2PC) computation protocols in the pres- ence of malicious adversaries has been an active area of research in the recent ...the malicious setting, which is ... See full document

32

Broadcast  from  Minicast  Secure  Against  General  Adversaries

Broadcast from Minicast Secure Against General Adversaries

... are malicious. The malicious misbehavior is modeled by a central adversary corrupting up to t parties and taking full control of their ...for secure multi-party computation (MPC) as defined in ... See full document

12

Billion-Gate  Secure  Computation  with  Malicious  Adversaries

Billion-Gate Secure Computation with Malicious Adversaries

... two-party secure com- putation system which guarantees privacy and correct- ness in the presence of a malicious ...purpose secure com- putation starting from a high level description of a func- ... See full document

16

Find U: Privacy-Preserving Distributed Profile Matching in Secure Multi-party Computation (SMC) for Preventing Malicious Attacks

Find U: Privacy-Preserving Distributed Profile Matching in Secure Multi-party Computation (SMC) for Preventing Malicious Attacks

... actual intersection set. For the network, we assume devices communicate through wireless interfaces such as Bluetooth or WIFI. For simplicity, we assume every participating device is in the communication range of each ... See full document

10

A Sentence Similarity Computation for Restricted Domain

A Sentence Similarity Computation for Restricted Domain

... is the most classical sentence similarity algorithm, it mainly uses the word frequency to calculate the similarity, which is a statistical method. In Natural Language Processing, the vector space model is ... See full document

6

Malicious Domain Detection Based on Traffic Similarity

Malicious Domain Detection Based on Traffic Similarity

... Malicious domain traffic similarity refers to the ground truth that malicious domains share common features. For the bots’ common behavior, Internet security workers have done a lot of [5,6]. In a ... See full document

6

Rigorous computation of diffusion coefficients for expanding maps

Rigorous computation of diffusion coefficients for expanding maps

... of computation, though a key point is that the computational effort is relatively light in comparison to that required for locating the 2 n period-n points for some high value of n ...The coefficients s ( n ... See full document

34

k-Round  MPC  from  k-Round  OT  via  Garbled  Interactive  Circuits

k-Round MPC from k-Round OT via Garbled Interactive Circuits

... The construction is very similar to the one of Section 7. The semi-malicious binding property easily follows from the semi-malicious sender privacy property of the OT. The main difficulty is to add the ... See full document

88

Quantum-Secure  Message  Authentication  Codes

Quantum-Secure Message Authentication Codes

... When the signing algorithm is deterministic there is no need to choose an r. However, for randomized signing algorithms the same randomness is used to compute the tag for all slots in the superposition. Alternatively, we ... See full document

27

Dimension Independent Similarity Computation

Dimension Independent Similarity Computation

... streaming computation model, we can remove the dependence by paying an extra logarithmic factor in memory ...the similarity score with a high threshold ... See full document

22

Incentivized  Outsourced  Computation  Resistant  to  Malicious  Contractors

Incentivized Outsourced Computation Resistant to Malicious Contractors

... Finally, we also tackle the problem of fair payment of fines and rewards. This is important in the settings where the contractors and the boss mutually distrust each other. We solve this problem using newly-developed ... See full document

34

Correlation Coefficients and Semantic Textual Similarity

Correlation Coefficients and Semantic Textual Similarity

... tual similarity has focused on constructing state-of-the-art embeddings using sophisti- cated modelling, careful choice of learning signals and many clever ...cosine similarity being used unquestionably in ... See full document

12

Show all 10000 documents...