4,925 research outputs found
Spartan Daily, April 12, 2007
Volume 128, Issue 40https://scholarworks.sjsu.edu/spartandaily/10354/thumbnail.jp
Spartan Daily, September 29, 1986
Volume 87, Issue 22https://scholarworks.sjsu.edu/spartandaily/7479/thumbnail.jp
Non-interactive fuzzy private matching
Two fuzzy private matching protocols are introduced to allow a client to securely compare a list of words to a server list, and discover only those words on the server list that are similar to his, while the server learns nothing. The first protocol achieves perfect client security, while the second achieves almostprivacy and perfect server security. Both protocols are efficient in both communication and computation complexity: for lists of length , only communication and computation is needed
Spartan Daily, November 7, 1988
Volume 91, Issue 48https://scholarworks.sjsu.edu/spartandaily/7774/thumbnail.jp
Some Efficient Solutions to Yao's Millionaire Problem
We present three simple and efficient protocol constructions to solve Yao's
Millionaire Problem when the parties involved are non-colluding and
semi-honest. The first construction uses a partially homomorphic Encryption
Scheme and is a 4-round scheme using 2 encryptions, 2 homomorphic circuit
evaluations (subtraction and XOR) and a single decryption. The second
construction uses an untrusted third party and achieves a communication
overhead linear in input bit-size with the help of an order preserving
function.Moreover, the second construction does not require an apriori input
bound and can work on inputs of different bit-sizes. The third construction
does not use a third party and, even though, it has a quadratic communication
overhead, it is a fairly simple construction.Comment: 17 page
- …