搜索结果: 1-4 共查到“secure comparison”相关记录4条 . 查询时间(0.115 秒)
Fast Secure Comparison for Medium-Sized Integers and Its Application in Binarized Neural Networks
multiparty computation secret sharing secure comparison
font style='font-size:12px;'>
2019/1/2
In 1994, Feige, Kilian, and Naor proposed a simple protocol for secure 33-way comparison of integers aa and bb from the range [0,2][0,2]. Their observation is that for p=7p=7, the Legendre symbol (x|p...
Efficient and Constant-Rounds Secure Comparison through Dynamic Groups and Asymmetric Computations
cryptographic protocols secure comparison
font style='font-size:12px;'>
2018/3/6
Within recent years, secure comparison protocols have been proposed using binary decomposition and properties of algebraic fields. These have been repeatedly optimized and increased in efficiency, but...
Efficient Secure Comparison Protocols
Two-party computation Secure comparison Oblivious transfer
font style='font-size:12px;'>
2016/6/2
A secure comparison protocol allows players to evaluate the
greater-than predicate on hidden values; it addresses a problem that belongs
to the field of multiparty computation, in which players wish...
A correction to“Efficient and Secure Comparison for On-Line Auctions”
cryptosystem On-Line Auctions secure
font style='font-size:12px;'>
2009/6/5
In this note, we describe a correction to the cryptosystem
proposed in [1, 2]. Although the correction is small and does not af-
fect the performance of the protocols from [1, 2], it is necessary as...