{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T13:46:42Z","timestamp":1766065602379,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1109\/hicss.2003.1174464","type":"proceedings-article","created":{"date-parts":[[2004,6,22]],"date-time":"2004-06-22T16:27:43Z","timestamp":1087921663000},"page":"6 pp.","source":"Crossref","is-referenced-by-count":56,"title":["An efficient protocol for Yao's millionaires' problem"],"prefix":"10.1109","author":[{"given":"I.","family":"Ioannidis","sequence":"first","affiliation":[]},{"given":"A.","family":"Grama","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","first-page":"120","article-title":"Efficient Private Bidding and Auctions with an Oblivious Third Party","author":"cachin","year":"1999","journal-title":"Computer Communications of the ACM"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100287"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"ref6","article-title":"Multiparty computations ensuring privacy of each party's input and correctness of the result, in Advances in Cryptology: CRYPTO '87","volume":"293","author":"chaum","year":"1988","journal-title":"Springer"},{"key":"ref11","article-title":"How to exchange secrets by oblivious transfer","author":"rabin","year":"1981","journal-title":"Technical Report TR-81 Aiken Computation Laboratory Harvard University"},{"key":"ref5","first-page":"94","article-title":"Advances in Cryptology: CRYPTO 2000","volume":"1880","author":"cachin","year":"2000","journal-title":"Optimistic Fair Secure Computation"},{"year":"0","key":"ref12"},{"key":"ref8","first-page":"218","article-title":"How to play any mental game or a completeness theorem for protocols with honest majority","author":"goldreich","year":"1987","journal-title":"Proc 19th Annual ACM Symposium on Theory of Computing (STOC)"},{"key":"ref7","first-page":"554","article-title":"A minimal model for secure computation","author":"feige","year":"1994","journal-title":"Proc 26th Annual ACM Symposium on Theory of Computing (STOC)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63520"},{"key":"ref9","article-title":"Fair computation of general functions in presence of immoral majority, in Advances in Cryptology: CRYPTO '90","volume":"537","author":"goldwasser","year":"1991","journal-title":"Springer Computer Science"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"}],"event":{"name":"36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the","start":{"date-parts":[[2003,1,9]]},"location":"Big Island, HI, USA","end":{"date-parts":[[2003,1,9]]}},"container-title":["36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8360\/26341\/01174464.pdf?arnumber=1174464","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T23:26:27Z","timestamp":1489533987000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1174464\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/hicss.2003.1174464","relation":{},"subject":[],"published":{"date-parts":[[2003]]}}}