搜索结果: 1-15 共查到“知识库 Cut”相关记录181条 . 查询时间(0.187 秒)
LC-MS/MS技术检测新生儿干血斑甲基丙二酸、同型半胱氨酸cut-off值的建立
高效液相色谱质谱-串联质谱联合检测 二阶筛查 甲基丙二酸血症 甲基丙二酸 同型半胱氨酸 ROC曲线
2021/3/29
探讨建立高效液相色谱质谱-串联质谱联合检测(liquid chromatography-tandem mass spectrometry，LC-MS/MS)技术检测新生儿干血斑甲基丙二酸(methylmalonic acid，MMA)和同型半胱氨酸(homocysteine，Hcy)cut-off值的方法。方法?收集本院分娩的新生儿MS/MS筛查中C3、C3/C2和C3/C0任一指标偏高的正常干血...
Cut-and-choose (C&C) is the standard approach to making Yao’s garbled circuit two-party computation (2PC) protocol secure against malicious adversaries. Traditional cut-and-choose operates at the leve...
Cost-Aware Cut-and-Choose Games with Applications in Cryptography and Prefix-Free Codes
Cut-and-choose games Algorithmic game theory Unequal-cost Huffman codes
2017/2/28
Cost-aware cut-and-choose game is a fundamental technique that has many cryptographic applications. Best existing solutions of this game assumed for simplicity that the number of challenges is publicl...
Garbled RAM, introduced by Lu and Ostrovsky (Eurocrypt 2013), provides a novel method to garble RAM (Random Access Machine) programs directly. It can be seen as a RAM analogue of Yao's garbled circuit...
Lizard: Cut off the Tail! Practical Post-Quantum Public-Key Encryption from LWE and LWR
Post-Quantum Cryptography Public-Key Encryption Learning with Rounding (LWR)
2016/12/7
The Learning with Errors (LWE) is one of the most promising primitive for post-quantum cryptography due to its strong security reduction from the worst-case of NP-hard problems and its lightweight ope...
A MIN-CUT BASED FILTER FOR AIRBORNE LIDAR DATA
LiDAR graph-cuts ground filtering classification optimization
2016/7/27
LiDAR (Light Detection and Ranging) is a routinely employed technology as a 3-D data collection technique for topographic mapping. Conventional workflows for analyzing LiDAR data require the ground to...
一种古建墙壁受污文字图像的多特征引导Grab Cut分割方法
毛笔文字 多特征引导 超像素分割 Grab Cut分割
2021/4/14
古建墙壁题记毛笔文字受霉变污染影响,字迹不清,不利于辨识,而传统算法对文字图像进行分割时未充分考虑污染和文字的特征信息,结果中往往存在误分割或缺损现象。本研究提出一种结合图像偏振信息的多特征引导Grab Cut分割算法,该方法首先对采集的0°、45°、90°、135°四个角度偏振图像进行斯托克斯解算,得到偏振度特征图；然后利用SLIC对可见光相机采集的题记图像进行超像素分割,并提取超像素的颜色特征...
Fast Optimistically Fair Cut-and-Choose 2PC
secure two-party computation covert adversaries cut-and-choose
2016/1/27
Secure two party computation (2PC) is a well-studied problem with many real world applications.
Due to Cleve’s result on general impossibility of fairness, however, the state-of-the-art
solutions on...
Efficient Three-Party Computation from Cut-and-Choose
cryptographic protocols secure computation
2016/1/25
With relatively few exceptions, the literature on efficient (practical) secure computation has
focused on secure two-party computation (2PC). It is, in general, unclear whether the techniques
used t...
Cut-and-Choose Based Two-Party Computation in the Online/Offline and Batch Settings
secure computation garbled circuits malicious adversaries
2016/1/7
Protocols for secure two-party computation enable a pair of mistrusting parties to compute a joint function of their private inputs without revealing anything but the output. One of the fundamental te...
Cut-and-Choose Bilateral Oblivious Transfer and Its Application in Secure Two-party Computation
Secure Two-party Computation Round Complexity Cut-and-choose Inverse OT
2016/1/7
In secure two-party computation protocols, the cut-and-choose paradigm is used to prevent
the malicious party who constructs the garbled circuits from cheating. In previous realization of the cutand-...
Non-Interactive Secure Computation Based on Cut-and-Choose
cryptographic protocols public-key encryption
2015/12/31
In recent years, secure two-party computation (2PC) has been demonstrated to be feasible
in practice. However, all efficient general-computation 2PC protocols require multiple rounds of interaction
...
Identity-Set-based Broadcast Encryption supporting “Cut-or-Select” with Short Ciphertext
Broadcast Encryption Cryptographic Membership Aggregation Function
2015/12/31
In this paper we present an identity-set-based broadcast encryption scheme with three working modes: positive membership (Select-mode), all member (All-mode), and negative membership (Cut-mode) over t...
Cut Down the Tree to Achieve Constant Complexity in Divisible E-Cash
Divisible E-Cash Anonymity Bilinear Groups
2015/12/22
Divisible e-cash, proposed in 1991 by Okamoto and Ohta, addresses a practical concern
of electronic money, the problem of paying the exact amount. Users of such systems can indeed
withdraw coins of ...
Research on High-Cut Slope Information Model of the Three Gorges Area
Hazards Monitoring Modeling Geo-Spatial Information Model
2015/12/18
Taking advantages of geo-spatial technology integrated with monitoring methods, and aiming at high-cut slope monitoring and management, this paper proposed a new concept of high-cut slope geo-spatial ...