• No results found

[PDF] Top 20 On Secure Two-party Integer Division

Has 10000 "On Secure Two-party Integer Division" found on our website. Below are the top 20 most common "On Secure Two-party Integer Division".

On  Secure  Two-party  Integer  Division

On Secure Two-party Integer Division

... of secure integer division – computing bn/dc given n and d – in the two-party ...of secure integer division is equivalent to that of secure modulo reduction ... See full document

24

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

... the party whose inputs are to be verified participates in an OT protocol on her inputs as part of garbled circuit evaluation ...the party is the circuit evaluator and acts as the receiver in the ...the ... See full document

31

Secure Two-Party Protocol for Privacy-Preserving Classification via Differential Privacy

Secure Two-Party Protocol for Privacy-Preserving Classification via Differential Privacy

... use two differentially-private non-interactive mechanisms for profile representation, Bloom-and-Flip (BLIP) [2] and Johnson-Lindenstrauss Transform (JLT) ... See full document

79

Variance: Secure Two-Party Protocol for Solving Yao's Millionaires' Problem in Bitcoin

Variance: Secure Two-Party Protocol for Solving Yao's Millionaires' Problem in Bitcoin

... This leaves the Comparison Protocol. The shuffle and PET is privacy-preserving un- der the ECDLP, as proven by Jakobsson and Juels in their paper [15]. This leaves the encryptions and the proof. The encryptions are ... See full document

75

TinyLEGO:  An  Interactive  Garbling  Scheme  for  Maliciously  Secure  Two-Party  Computation

TinyLEGO: An Interactive Garbling Scheme for Maliciously Secure Two-Party Computation

... Motivation. Efficient protocols for maliciously secure two-party computation based on garbled circuits are often extremely complex. The corresponding proofs of security are no better and often hinges ... See full document

42

Data Integration of Distributed Data Using Secure Two Party Algorithm

Data Integration of Distributed Data Using Secure Two Party Algorithm

... a two-level memory hierarchy, most transactions should be processed using the fragments in primary ...A two-phase approach for the determination of fragments is proposed; in the first phase, the design is ... See full document

5

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

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

... The next classifier in the Tensorflow tutorial is a convolution neural net with two convolutions (with 32 output channels) and two fully connected layers with ReLU as the activation function. This DNN is ... See full document

15

Secure  two-party  computation  in  applied  pi-calculus:  models   and  verification

Secure two-party computation in applied pi-calculus: models and verification

... manner, for instance relying on a trusted third party and private channels. Secondly, one has to show that the view of every attacker on the real protocol can be matched by a computationally indistinguishable view ... See full document

18

Complete  Characterization  of  Fairness  in  Secure  Two-Party  Computation  of  Boolean  Functions

Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions

... in secure two-party and multiparty ...one party exerts more influence on the output compared to the other party, then the function can be computed with full ... See full document

38

Secure  Certification  of  Mixed  Quantum  States  with  Application  to  Two-Party  Randomness  Generation

Secure Certification of Mixed Quantum States with Application to Two-Party Randomness Generation

... to Two-Party ...for secure unconditional two-party computation is ...of two-party classical cryptographic primitives must leak at least some minimal amount of information ... See full document

33

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

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

... one party, called the creator, generates a Boolean circuit of the function f and garbles the circuit by assigning symmetric keys to the input wires of the circuit and recursively encrypting every possible output ... See full document

20

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 polynomial-time ... See full document

54

Parallel Matrix Implementation of an Integer Division Algorithm Using FPGA

Parallel Matrix Implementation of an Integer Division Algorithm Using FPGA

... considered: two n bit positive integer numbers, X and Y are ...the two numbers are aligned and ...of two values, which makes it easy to decide on the appropriate value by the sign of the ... See full document

7

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  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

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

... In this paper, we give the efficient construction of cut-and-choose bilateral oblivious transfer based on decisional Diffied-Hellman assumption. The construction is divided into two stages. At first, we “inverse” ... See full document

18

Fp-Tree Algorithm Using Modified-Ck Secure Sum Method

Fp-Tree Algorithm Using Modified-Ck Secure Sum Method

... In secure sum protocol basically divide the whole database into number of horizontal partition database and each party have their particular sequence number (p1, p2,…………p n) so that if p2 want the value of ... See full document

9

Fair  Two-Party  Computations  via  Bitcoin  Deposits

Fair Two-Party Computations via Bitcoin Deposits

... third party functionality in a secure ...just two parties and one of them is cheating), then such protocols also exist, but in general they do not provide fairness, ...dishonest party can ... See full document

15

Secure  Multi-Party  Shuffling

Secure Multi-Party Shuffling

... with two input wires and two output wires. When two values enter a comparator, it outputs the lower value on the top output wire, and the higher value on the bottom output ... See full document

24

Cross-Domain  Password-Based  Authenticated  Key  Exchange  Revisited

Cross-Domain Password-Based Authenticated Key Exchange Revisited

... provably secure in our security model; however, no implementation results were ...propose two new 4PAKE protocols: a 4PAKE variant that optimises our earlier protocol shown in [19] by allowing key reuse; ... See full document

31

Show all 10000 documents...