Search: id:"swepub:oai:DiVA.org:kth-157989" >
Private intersectio...
-
Guanciale, RobertoKTH,Teoretisk datalogi, TCS
(author)
Private intersection of regular languages
- Article/chapterEnglish2014
Publisher, publication year, extent ...
-
IEEE conference proceedings,2014
-
electronicrdacarrier
Numbers
-
LIBRIS-ID:oai:DiVA.org:kth-157989
-
https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-157989URI
-
https://doi.org/10.1109/PST.2014.6890930DOI
Supplementary language notes
-
Language:English
-
Summary in:English
Part of subdatabase
Classification
-
Subject category:ref swepub-contenttype
-
Subject category:kon swepub-publicationtype
Notes
-
QC 20150123
-
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.
Subject headings and genre
Added entries (persons, corporate bodies, meetings, titles ...)
-
Gurov, Dilian,1964-KTH,Teoretisk datalogi, TCS,TCS(Swepub:kth)u1jmacmb
(author)
-
Laud, Peeter
(author)
-
KTHTeoretisk datalogi, TCS
(creator_code:org_t)
Related titles
-
In:Privacy, Security and Trust (PST), 2014 Twelfth Annual International Conference on: IEEE conference proceedings, s. 112-1209781479935024
Internet link
Find in a library
To the university's database