{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T11:00:11Z","timestamp":1777806011663,"version":"3.51.4"},"reference-count":37,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2017,1,31]],"date-time":"2017-01-31T00:00:00Z","timestamp":1485820800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer Security"],"published-print":{"date-parts":[[2017,3,16]]},"abstract":"<jats:p>This paper introduces two-party protocols for various operations on two integer intervals that are privacy-preserving in the semi-honest model. Specifically, this work proposes new protocols for determining whether two intervals overlap; computing the boundaries and size of the overlap; and selecting a random sub-interval within the overlap. The protocols are presented both for homomorphic encryption and for secret sharing as basic secure multi-party computation techniques. Moreover, this paper presents a comprehensive performance evaluation of the newly-developed protocols.<\/jats:p>","DOI":"10.3233\/jcs-16830","type":"journal-article","created":{"date-parts":[[2017,1,31]],"date-time":"2017-01-31T10:43:03Z","timestamp":1485859383000},"page":"59-81","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":3,"title":["Designing privacy-preserving interval operations based on homomorphic encryption and secret sharing techniques"],"prefix":"10.1177","volume":"25","author":[{"given":"Stefan","family":"W\u00fcller","sequence":"first","affiliation":[{"name":"Computer Science Department, RWTH Aachen University, Mies-van-der-Rohe Str. 15, D-52074, Aachen, Germany. E-mails:\u00a0,\u00a0,\u00a0,\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Mayer","sequence":"additional","affiliation":[{"name":"Computer Science Department, Stevens Institute of Technology, 1 Castle Point on Hudson, Hoboken, NJ 07030-5991, USA. E-mails:\u00a0,\u00a0,\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabian","family":"F\u00f6rg","sequence":"additional","affiliation":[{"name":"Computer Science Department, Stevens Institute of Technology, 1 Castle Point on Hudson, Hoboken, NJ 07030-5991, USA. E-mails:\u00a0,\u00a0,\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel","family":"Sch\u00fcppen","sequence":"additional","affiliation":[{"name":"Computer Science Department, RWTH Aachen University, Mies-van-der-Rohe Str. 15, D-52074, Aachen, Germany. E-mails:\u00a0,\u00a0,\u00a0,\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Assadsolimani","sequence":"additional","affiliation":[{"name":"Computer Science Department, RWTH Aachen University, Mies-van-der-Rohe Str. 15, D-52074, Aachen, Germany. E-mails:\u00a0,\u00a0,\u00a0,\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrike","family":"Meyer","sequence":"additional","affiliation":[{"name":"Computer Science Department, RWTH Aachen University, Mies-van-der-Rohe Str. 15, D-52074, Aachen, Germany. E-mails:\u00a0,\u00a0,\u00a0,\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susanne","family":"Wetzel","sequence":"additional","affiliation":[{"name":"Computer Science Department, Stevens Institute of Technology, 1 Castle Point on Hudson, Hoboken, NJ 07030-5991, USA. E-mails:\u00a0,\u00a0,\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2017,1,31]]},"reference":[{"key":"ref001","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066187"},{"key":"ref002","unstructured":"G.\u00a0Asharov and Y.\u00a0Lindell, A full proof of the BGW protocol for perfectly-secure multiparty computation, Report 2011\/136, IACR Cryptology ePrint Archive, 2011, available from: http:\/\/eprint.iacr.org\/2011\/136."},{"key":"ref003","doi-asserted-by":"publisher","DOI":"10.1109\/MARK.1979.8817296"},{"key":"ref004","unstructured":"D.\u00a0Bogdanov, Sharemind, programmable secure computations with practical applications, PhD thesis, University of Tartu, 2013."},{"key":"ref005","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70936-7_29"},{"key":"ref006","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46885-4_45"},{"key":"ref007","unstructured":"M.\u00a0Burkhart, Enabling collaborative network security with privacy-preserving data aggregation, PhD thesis, ETH, Zurich, 2011."},{"key":"ref008","unstructured":"M.\u00a0Burkhart, M.\u00a0Strasser, D.\u00a0Many and X.\u00a0Dimitropoulos, SEPIA: Privacy-preserving aggregation of multi-domain network events and statistics, in: Proceedings of the 19th USENIX Conference on Security, USENIX Association, 2010."},{"key":"ref009","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"ref010","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_15"},{"key":"ref011","doi-asserted-by":"publisher","DOI":"10.1109\/PERCOM.2011.5767598"},{"key":"ref012","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"ref013","doi-asserted-by":"publisher","DOI":"10.1109\/PST.2014.6890924"},{"key":"ref014","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45472-1_7"},{"key":"ref015","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"ref016","unstructured":"O.\u00a0Goldreich, Foundations of Cryptography: Volume 2, Basic Applications, Cambridge University Press, 2009."},{"key":"ref017","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012088469-8.50064-4"},{"key":"ref018","unstructured":"C.\u00a0Jost, H.\u00a0Lam, A.\u00a0Maximov and B.\u00a0Smeets, Encryption performance improvements of the Paillier cryptosystem, Report 2015\/864, Cryptology ePrint Archive, 2015, available from: http:\/\/eprint.iacr.org\/2015\/864."},{"key":"ref019","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010756"},{"key":"ref020","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24861-0_18"},{"key":"ref021","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400766"},{"key":"ref022","doi-asserted-by":"publisher","DOI":"10.1109\/IAW.2005.1495971"},{"key":"ref023","unstructured":"D.\u00a0Mayer, Design and implementation of efficient privacy-preserving and unbiased reconciliation protocols, PhD thesis, Stevens Institute of Technology, 2012."},{"key":"ref024","doi-asserted-by":"publisher","DOI":"10.1145\/1943513.1943529"},{"key":"ref025","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom.2010.121"},{"key":"ref026","unstructured":"G.\u00a0Neugebauer, Design and implementation of efficient multi-party protocols for privacy-preserving reconciliation, PhD thesis, RWTH Aachen University, 2014."},{"key":"ref027","unstructured":"G.\u00a0Neugebauer and U.\u00a0Meyer, SMC-MuSe: A framework for secure multi-party computation on multisets, Technical Report AIB-2012-16, RWTH Aachen, 2012."},{"key":"ref028","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71677-8_23"},{"key":"ref029","unstructured":"NIST, SP 800-57 Part 1 Revision 3: Recommendation for key management, 2012."},{"key":"ref030","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"ref031","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref032","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2007.29"},{"key":"ref033","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2429117"},{"key":"ref034","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39650-5_6"},{"key":"ref035","doi-asserted-by":"publisher","DOI":"10.1109\/PST.2015.7232953"},{"key":"ref036","doi-asserted-by":"crossref","unstructured":"S.\u00a0Wueller, U.\u00a0Meyer, F.\u00a0Foerg, S.\u00a0Wetzel and U.\u00a0Meyer, Privacy-preserving conditional random selection \u2013 Extended version, 2015.","DOI":"10.1109\/PST.2015.7232953"},{"key":"ref037","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24316-5_17"}],"container-title":["Journal of Computer Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JCS-16830","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JCS-16830","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JCS-16830","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T20:45:01Z","timestamp":1777495501000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JCS-16830"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,31]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,3,16]]}},"alternative-id":["10.3233\/JCS-16830"],"URL":"https:\/\/doi.org\/10.3233\/jcs-16830","relation":{},"ISSN":["0926-227X","1875-8924"],"issn-type":[{"value":"0926-227X","type":"print"},{"value":"1875-8924","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,31]]}}}