{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:59:35Z","timestamp":1729630775780,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8007020","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T14:54:37Z","timestamp":1504018477000},"page":"2703-2707","source":"Crossref","is-referenced-by-count":1,"title":["Characterizing optimal security and round-complexity for secure OR evaluation"],"prefix":"10.1109","author":[{"given":"Amisha","family":"Jhanji","sequence":"first","affiliation":[]},{"given":"Hemanta K.","family":"Maji","sequence":"additional","affiliation":[]},{"given":"Raphael Arkady","family":"Meyer","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","first-page":"20","article-title":"Founding cryptography on oblivious transfer","author":"kilian","year":"1988","journal-title":"The 20th ACM STOC"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1016\/0196-6774(82)90004-9"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1007\/s001459910006"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/SFCS.1989.63512"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/978-3-642-40041-4_17","article-title":"Accuracy-privacy tradeoffs for two-party differentially private protocols","volume":"8042","author":"goyal","year":"2013","journal-title":"CRYPTO 2013 Part I LNCS"},{"key":"ref5","first-page":"230","article-title":"One-way functions are essential for complexity based cryptography (extended abstract)","author":"impagliazzo","year":"1989","journal-title":"30th FOCS"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/ISIT.2017.8007020"},{"key":"ref8","first-page":"256","article-title":"Complexity of multiparty computation problems: The case of 2-party symmetric secure function evaluation","volume":"5444","author":"maji","year":"2009","journal-title":"TCC 2009 ser LNCS"},{"key":"ref7","first-page":"65","article-title":"Perfect privacy for two-party protocols","volume":"2","author":"beaver","year":"1989","journal-title":"Proceedings of DIMACS Workshop on Distributed Computing and Cryptography"},{"key":"ref2","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":"19th ACM STOC"},{"key":"ref9","first-page":"238","article-title":"Secure computability of functions in the IT setting with dishonest majority and applications to long-term security","volume":"5444","author":"k\u00fcnzler","year":"2009","journal-title":"TCC 2009 ser LNCS"},{"key":"ref1","first-page":"160","article-title":"Protocols for secure computations (extended abstract)","author":"yao","year":"1982","journal-title":"23rd FOCS"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08007020.pdf?arnumber=8007020","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T18:40:57Z","timestamp":1659379257000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8007020\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8007020","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}