Oblivious stable sorting protocol and oblivious binary search protocol for secure multi-party computation

2021 ◽  
pp. 1-16
Author(s):  
Ch Koteswara Rao ◽  
Kunwar Singh ◽  
Anoop Kumar
Keyword(s):  
Communication Complexity ◽  
Search Algorithm ◽  
Building Blocks ◽  
Binary Search ◽  
Oblivious Ram ◽  
Detection Systems ◽  
Round Complexity ◽  
Set Intersection ◽  
Private Computation ◽  
Binary Search Algorithm

Multi-party computation (MPC) sorting and searching protocols are frequently used in different databases with varied applications, as in cooperative intrusion detection systems, private computation of set intersection and oblivious RAM. Ivan Damgard et al. have proposed two techniques i.e., bit-decomposition protocol and bit-wise less than protocol for MPC. These two protocols are used as building blocks and have proposed two oblivious MPC protocols. The proposed protocols are based on data-dependent algorithms such as insertion sort and binary search. The proposed multi-party sorting protocol takes the shares of the elements as input and outputs the shares of the elements in sorted order. The proposed protocol exhibits O ( 1 ) constant round complexity and O ( n log n ) communication complexity. The proposed multi-party binary search protocol takes two inputs. One is the shares of the elements in sorted order and the other one is the shares of the element to be searched. If the position of the search element exists, the protocol returns the corresponding shares, otherwise it returns shares of zero. The proposed multi-party binary search protocol exhibits O ( 1 ) round complexity and O ( n log n ) communication complexity. The proposed multi-party sorting protocol works better than the existing quicksort protocol when the input is in almost sorted order. The proposed multi-party searching protocol gives almost the same results, when compared to the general binary search algorithm.

scholarly journals Practical Implementation of an Indoor Robot Localization and Identification System using an Array of Anchor Nodes

2020 ◽  
Vol 16 (1) ◽  
pp. 1-8 ◽  
Author(s):  
Israa AL-Forati ◽  
Abdulmuttalib Rashid
Keyword(s):  
Search Algorithm ◽  
Low Cost ◽  
Binary Search ◽  
Practical Implementation ◽  
Identification System ◽  
Robot Localization ◽  
Light Emitting ◽  
The Matrix ◽  
Anchor Nodes ◽  
Binary Search Algorithm

This paper proposes a low-cost Light Emitting Diodes (LED) system with a novel arrangement that allows an indoor multi-robot localization. The proposed system uses only a matrix of low-cost LED installed uniformly on the ground of an environment and low-cost Light Dependent Resistor (LDR), each equipped on bottom of the robot for detection. The matrix of LEDs which are driven by a modified binary search algorithm are used as active beacons. The robot localizes itself based on the signals it receives from a group of neighbor LEDs. The minimum bounded circle algorithm is used to draw a virtual circle from the information collected from the neighbor LEDs and the center of this circle represents the robot’s location. The propose system is practically implemented on an environment with (16*16) matrix of LEDs. The experimental results show good performance in the localization process.

Routing Lookup Algorithm Performance Analysis and Research

2011 ◽  
Vol 181-182 ◽  
pp. 109-112
Author(s):  
Xian Min Wei
Keyword(s):  
Performance Analysis ◽  
Search Algorithm ◽  
Binary Search ◽  
Algorithm Performance ◽  
Practical Performance ◽  
Binary Search Algorithm ◽  
Routing Lookup ◽  
Searching Performance

This paper describes several current routing lookup algorithms, to study and analysize the complexity and operating practical performance of these routing lookup algorithms. The results show that although the binary search algorithm is not greatly improved in the searching performance, but in IPv6 environment, because searching performance of multi-branch Trie tree will decrease greatly, thus the superiority of binary search algorithm will be reflected better.

scholarly journals A Binary Search Algorithm for Correlation Study of Decay Centrality vs. Degree Centrality and Closeness Centrality

2017 ◽  
Vol 10 (2) ◽  
pp. 52
Author(s):  
Natarajan Meghanathan
Keyword(s):  
Real World ◽  
Search Algorithm ◽  
Threshold Value ◽  
Search Space ◽  
Correlation Study ◽  
Binary Search ◽  
Closeness Centrality ◽  
Node Degree ◽  
Degree Centrality ◽  
Binary Search Algorithm

Results of correlation study (using Pearson's correlation coefficient, PCC) between decay centrality (DEC) vs. degree centrality (DEG) and closeness centrality (CLC) for a suite of 48 real-world networks indicate an interesting trend: PCC(DEC, DEG) decreases with increase in the decay parameter δ (0 < δ < 1) and PCC(DEC, CLC) decreases with decrease in δ. We make use of this trend of monotonic decrease in the PCC values (from both sides of the δ-search space) and propose a binary search algorithm that (given a threshold value r for the PCC) could be used to identify a value of δ (if one exists, we say there exists a positive δ-spacer) for a real-world network such that PCC(DEC, DEG) ≥ r as well as PCC(DEC, CLC) ≥ r. We show the use of the binary search algorithm to find the maximum Threshold PCC value rmax (such that δ-spacermax is positive) for a real-world network. We observe a very strong correlation between rmax and PCC(DEG, CLC) as well as observe real-world networks with a larger variation in node degree to more likely have a lower rmax value and vice-versa.

Speed Sensorless Control of SPMSM Drives for EVs With a Binary Search Algorithm-Based Phase-Locked Loop

2020 ◽  
Vol 69 (5) ◽  
pp. 4968-4978 ◽  
Author(s):  
Xiaodong Sun ◽  
Changchang Hu ◽  
Gang Lei ◽  
Zebin Yang ◽  
Youguang Guo ◽  
...  
Keyword(s):  
Search Algorithm ◽  
Sensorless Control ◽  
Phase Locked Loop ◽  
Binary Search ◽  
Speed Sensorless ◽  
Binary Search Algorithm
Sign in / Sign up

Export Citation Format

Share Document