Change search
ReferencesLink to record
Permanent link

Direct link
Private intersection of regular languages
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS. (TCS)ORCID iD: 0000-0002-0074-8786
2014 (English)In: Privacy, Security and Trust (PST), 2014 Twelfth Annual International Conference on / [ed] Ali Miri, Urs Hengartner, Nen-Fu Huang, Audun Jøsang, Joaquín García-Alfaro, IEEE conference proceedings, 2014, 112-120 p.Conference paper (Refereed)
Abstract [en]

This paper addresses the problem of computing the intersection of regular languages in a privacy-preserving fashion. Private set intersection has been addressed earlier in the literature, but for finite sets only. We discuss the various possibilities for solving the problem efficiently, and argue for an approach based on minimal deterministic finite automata (DFA) as a suitable, non-leaking representation of regular language intersection. We propose two different algorithms for DFA minimization in a secure multiparty computation setting, illustrating different aspects of programming based on universal composability and the constraints this sets on existing algorithms. The implementation of our algorithms is based on the programming language SECREC, executing on the SHAREMIND platform for secure multiparty computation. As one application domain we consider fusion of virtual enterprise business processes.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2014. 112-120 p.
National Category
Computer Science
URN: urn:nbn:se:kth:diva-157989DOI: 10.1109/PST.2014.6890930ISI: 000360829800014ScopusID: 2-s2.0-84910093642ISBN: 978-1-4799-3502-4 (print)OAI: diva2:773107
Twelfth Annual International Conference on Privacy, Security and Trust,Toronto, Canada, July 23-24, 2014

QC 20150123

Available from: 2014-12-18 Created: 2014-12-18 Last updated: 2016-02-17Bibliographically approved

Open Access in DiVA

pst14.pdf(323 kB)47 downloads
File information
File name FULLTEXT01.pdfFile size 323 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusIEEEXplore

Search in DiVA

By author/editor
Guanciale, RobertoGurov, Dilian
By organisation
Theoretical Computer Science, TCS
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 47 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 22 hits
ReferencesLink to record
Permanent link

Direct link