{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T05:51:30Z","timestamp":1746769890126,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1109\/pst.2014.6890930","type":"proceedings-article","created":{"date-parts":[[2014,9,10]],"date-time":"2014-09-10T15:43:34Z","timestamp":1410363814000},"page":"112-120","source":"Crossref","is-referenced-by-count":6,"title":["Private intersection of regular languages"],"prefix":"10.1109","author":[{"given":"Roberto","family":"Guanciale","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dilian","family":"Gurov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peeter","family":"Laud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-57108-4"},{"journal-title":"Deploying Secure Multiparty Computation for Joint Data Analysis - A Case Study","year":"2011","author":"talviste","key":"17"},{"key":"18","article-title":"Introduction to bpmn","volume":"2","author":"white","year":"2004","journal-title":"IBM Cooperation"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.04.001"},{"key":"16","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/11593447_13","article-title":"Privacy-preserving graph algorithms in the semi-honest model","author":"brickell","year":"2005","journal-title":"Advances in Cryptology-ASIACRYPT 2005"},{"key":"13","first-page":"273","article-title":"Privacy-preserving cooperative scientific computations","author":"du","year":"2001","journal-title":"Computer Security Foundations Workshop IEEE IEEE Computer Society"},{"key":"14","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1145\/1755688.1755695","article-title":"Securely outsourcing linear algebra computations","author":"atallah","year":"2010","journal-title":"ASIACCS"},{"journal-title":"Sharemind Programmable Secure Computations with Practical Applications","year":"2013","author":"bogdanov","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24861-0_18"},{"key":"21","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1007\/11494744_25","article-title":"The prom framework: A new era in process mining tool support","author":"van dongen","year":"2005","journal-title":"Applications and Theory of Petri Nets 2005"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1142\/S0218126698000043"},{"key":"22","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/3-540-63139-9_48","article-title":"Verification of workflow nets","author":"aalst der van","year":"1997","journal-title":"Application and Theory of Petri Nets 1997"},{"key":"23","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1145\/1315245.1315309","article-title":"Privacy preserving error resilient dna searching through oblivious automata","author":"troncoso-pastoriza","year":"2007","journal-title":"Proceedings of the 14th ACM Conference on Computer and Communications Security ACM"},{"key":"24","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-3-642-13739-6_4","article-title":"Secure outsourcing of dna searching via finite automata","author":"blanton","year":"2010","journal-title":"Data and Applications Security and Privacy XXIV"},{"journal-title":"Universally Composable Privacy Preserving Finite Automata Execution with Low Online and Offline Complexity","year":"2013","author":"laud","key":"25"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/EEE.2004.1287334"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1007\/s10626-007-0016-1"},{"key":"3","first-page":"129","article-title":"Gedanken-experiments on sequential machines","volume":"34","author":"moore","year":"1956","journal-title":"Automata Studies"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1844-9"},{"key":"10","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/978-3-540-88313-5_13","article-title":"Sharemind: A framework for fast privacy-preserving computations","volume":"5283","author":"bogdanov","year":"2008","journal-title":"ESORICS Ser Lecture Notes in Computer Science"},{"key":"1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","article-title":"Efficient private matching and set intersection","author":"freedman","year":"2004","journal-title":"Advances in Cryptology-EUROCRYPT 2004"},{"journal-title":"Minimization of Automata","year":"2010","author":"berstel","key":"7"},{"key":"6","first-page":"529","article-title":"Canonical regular expressions and minimal state graphs for definite events","volume":"12","author":"brzozowski","year":"1962","journal-title":"Mathematical Theory of Automata"},{"journal-title":"A taxonomy of finite automata minimization algorithms","year":"1993","author":"watson","key":"5"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"9","first-page":"469","article-title":"On the number of distinct languages accepted by finite automata with n states","volume":"7","author":"domaratzki","year":"2002","journal-title":"Journal of Automata Languages and Combinatorics"},{"key":"8","article-title":"Secure multi-party computation","author":"goldreich","year":"1998","journal-title":"Manuscript Preliminary Version"}],"event":{"name":"2014 Twelfth Annual Conference on Privacy, Security and Trust (PST)","start":{"date-parts":[[2014,7,23]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2014,7,24]]}},"container-title":["2014 Twelfth Annual International Conference on Privacy, Security and Trust"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6883276\/6890911\/06890930.pdf?arnumber=6890930","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T21:33:51Z","timestamp":1565818431000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6890930\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/pst.2014.6890930","relation":{},"subject":[],"published":{"date-parts":[[2014,7]]}}}