{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T18:36:07Z","timestamp":1719858967514},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"name":"Ph.D. Science Foundation of Polytechnic University","award":["107020331"],"award-info":[{"award-number":["107020331"]}]},{"name":"Nature Science Foundation of China","award":["61272435","61373020","U1536102","U1536116"],"award-info":[{"award-number":["61272435","61373020","U1536102","U1536116"]}]},{"name":"China Mobile Research Fund Project","award":["MCM20170407"],"award-info":[{"award-number":["MCM20170407"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2827025","type":"journal-article","created":{"date-parts":[[2018,4,16]],"date-time":"2018-04-16T20:42:27Z","timestamp":1523911347000},"page":"25532-25542","source":"Crossref","is-referenced-by-count":4,"title":["Secure \u201cRatio\u201d Computation and Efficient Protocol for General Secure Two-Party Comparison"],"prefix":"10.1109","volume":"6","author":[{"given":"Linming","family":"Gong","sequence":"first","affiliation":[]},{"given":"Shundong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Chunying","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Daoshun","family":"Wang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CCECE.2017.7946602"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/5207386"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48965-0_30"},{"key":"ref30","first-page":"798","article-title":"Efficient secure multiparty computation based on homomorphic encryption","volume":"41","author":"li","year":"2013","journal-title":"Acta Electronica Sinica"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-009-9040-7"},{"key":"ref36","volume":"2","author":"goldreich","year":"2009","journal-title":"Foundations of Cryptography Basic Applications"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1142\/S012905411750023X"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1049\/cje.2017.06.014"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-005-0258-z"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.04.004"},{"key":"ref12","first-page":"578","article-title":"A secure protocol for determining whether a point is inside a convex polygon","volume":"15","author":"yonglong","year":"2006","journal-title":"Chin J Electron"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1109\/TST.2016.7488738","article-title":"Private proximity detection for convex polygons","volume":"21","author":"mu","year":"2016","journal-title":"Tsinghua Sci Technol"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2714576.2714603"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2230221"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813725"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2568460"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.87"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48965-0_40"},{"key":"ref28","first-page":"205","article-title":"An efficient protocol for private comparison problem","volume":"18","author":"luo","year":"2009","journal-title":"Chin J Electron"},{"key":"ref4","first-page":"110","article-title":"Practically efficient secure single-commodity multi-market auctions","author":"aly","year":"2016","journal-title":"Proc Int Conf Financial Cryptograph Data Secur"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/11496137_31"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2494009"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21837-3_28"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2429117"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2315200"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2434217"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2015.2488618"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/sec.1522"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2014.06.004"},{"key":"ref1","article-title":"Negotiations using secure multi-party computation","author":"mawet","year":"2015"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30539-2_36"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-014-9190-0"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/319709.319726"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref26","first-page":"6","article-title":"An efficient protocol for Yao’s millionaires’ problem","author":"ioannidis","year":"2003","journal-title":"Proc IEEE 36th Annu Hawaii Int Conf"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45353-9_33"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08338046.pdf?arnumber=8338046","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:15:31Z","timestamp":1642004131000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8338046\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2827025","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}