Sökning: (WFRF:(Gurov Dilian 1964 ))
> (2014) >
Private intersectio...
Private intersection of regular languages
-
- Guanciale, Roberto (författare)
- KTH,Teoretisk datalogi, TCS
-
- Gurov, Dilian, 1964- (författare)
- KTH,Teoretisk datalogi, TCS,TCS
-
Laud, Peeter (författare)
-
(creator_code:org_t)
- IEEE conference proceedings, 2014
- 2014
- Engelska.
-
Ingår i: Privacy, Security and Trust (PST), 2014 Twelfth Annual International Conference on. - : IEEE conference proceedings. - 9781479935024 ; , s. 112-120
- Relaterad länk:
-
https://doi.org/10.1...
-
visa fler...
-
http://ieeexplore.ie...
-
https://kth.diva-por... (primary) (Raw object)
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas