We introduce two new schemes for securely computing Hamming distance in the two-party setting. Our first scheme is a very efficient protocol, based solely on 1-out-of-2 Oblivious Transfer, that achieves full security ...
详细信息
ISBN:
(纸本)9783642413193;9783642413209
We introduce two new schemes for securely computing Hamming distance in the two-party setting. Our first scheme is a very efficient protocol, based solely on 1-out-of-2 Oblivious Transfer, that achieves full security in the semi-honest setting and one-sided security in the malicious setting. Moreover we show that this protocol is significantly more efficient than the previous proposals, that are either based on garbled circuits or on homomorphic encryption. Our second scheme achieves full security against malicious adversaries and is based on Committed Oblivious Transfer. these protocols have direct applications to secure biometric identification.
the proceedings contain 16 papers. the topics discussed include: the impact of length and mathematical operators on the usability and security of system-assigned one-time PINs;QRishing: the susceptibility of smartphon...
ISBN:
(纸本)9783642413193
the proceedings contain 16 papers. the topics discussed include: the impact of length and mathematical operators on the usability and security of system-assigned one-time PINs;QRishing: the susceptibility of smartphone users to QR code phishing attacks;soulmate or acquaintance? visualizing tie strength for trust inference;awareness about photos on the web and how privacy-privacy-tradeoffs could help;bootstrapping trust in online dating: social verification of online dating profiles;SHADE: secure hamming distance computation from oblivious transfer;privacy preserving data processing with collaboration of homomorphic cryptosystems;and targeting FPGA DSP slices for a large integer multiplier for integer based FHE.
Trading Systems are beneficial for financial investments due to the complexity of nowadays markets. On one hand, finance markets are influenced by a great amount of factors of different sources such as government poli...
详细信息
Data uncertainty has posed many unique challenges to nearly all types of data mining tasks, creating a need for uncertain data mining. In this paper, we focus on the particular task of mining probabilistic frequent se...
详细信息
Tracking of multiple ground targets with airborne Ground Moving Target Indicator (GMTI) sensor measurements is a challenging problem where heavy and dense false alarms with high target density are inevitably encounter...
详细信息
ISBN:
(纸本)9781479902842
Tracking of multiple ground targets with airborne Ground Moving Target Indicator (GMTI) sensor measurements is a challenging problem where heavy and dense false alarms with high target density are inevitably encountered in the surveillance scenes. Hence, optimal approaches require heavy computational load where the duration of overall computation rises exponentially withthe number of target tracks and measurements in observation per scan. Consequently, more practical suboptimal approaches, such as Linear Multi-Target (LM) approach, is explored due to linear number of operations in the number of target tracks with a negligible performance loss compared to optimal approaches. Although LM approach performs modestly adequate with significantly less computation duration than optimal approaches, it is highly susceptible to track loss, as in the rest of suboptimal approaches, when the targets are closely spaced and the number of targets and measurements are considerably high. Simulations are carried out in realistic test scenarios to compare single target tracking algorithms including IMM-PDA and IMM-IPDA algorithms;Optimal approaches in multitarget tracking including IMM-JPDA, IMM-IJPDA and IMM-JIPDA algorithms and an example of Linear Multi-target approaches in multitarget tracking including IMM-LMIPDA algorithm. Benchmarkings of these algorithms are done under RMSE performance, track loss and computation time evaluation results.
In this paper we propose two methods to remove the black regions that appear on Kinect camera depth images. We describe the various reasons why these regions of missing information appear. the proposed algorithms will...
详细信息
Fast computation of two-dimensional layouts of hierarchically clustered networks is a well-studied problem in graph visualization. We present algorithmic and experimental advances on the subject: (i) We propose a new ...
详细信息
the paper considers the uncertainty modeling and compensation in the context of ultrasonic image generation with fixed working frequency. From the set of uncertainty sources, which could be considered at the level of ...
详细信息
the following paper presents various applications for a robotic arm using image processing. these applications have as a basis a video camera that captures the images to be processed for either recognition and sorting...
详细信息
Fast computation of two-dimensional layouts of hierarchically clustered networks is a well-studied problem in graph visualization. We present algorithmic and experimental advances on the subject: (i) We propose a new ...
详细信息
Fast computation of two-dimensional layouts of hierarchically clustered networks is a well-studied problem in graph visualization. We present algorithmic and experimental advances on the subject: (i) We propose a new drawing algorithm that combines space-filling and fast force-directed methods; it runs in O(nlogn+m) time, where n and m are the number of vertices and edges of the network, respectively. this running time does not depend on the number of clusters, thus the algorithm guarantees good time performances independently of the structure of the cluster hierarchy. As a further advantage, the algorithm can be easily parallelized. (ii) We present an experimental analysis aimed at understanding which clustering algorithms can be used, in combination with our visualization technique, to generate better quality drawings for medium and large networks with small-world and scale-free structure. As far as we know, no previous similar experiments have been done in this respect.
暂无评论