DC FieldValueLanguage
dc.contributor.authorAdams, Robin-
dc.contributor.authorSchupp, Sibylle-
dc.date.accessioned2019-06-05T16:09:03Z-
dc.date.available2019-06-05T16:09:03Z-
dc.date.issued2018-
dc.identifier.citationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (11294 LNCS): 196-214 (2018-01-01)de_DE
dc.identifier.isbn9783030035914de_DE
dc.identifier.issn0302-9743de_DE
dc.identifier.urihttp://hdl.handle.net/11420/2740-
dc.description.abstractPrivacy by design (PbD) is the principle that privacy should be considered at every stage of the software engineering process. It is increasingly both viewed as best practice and required by law. It is therefore desirable to have formal methods that provide guarantees that certain privacy-relevant properties hold. We propose an approach that can be used to design a privacy-compliant architecture without needing to know the source code or internal structure of any individual component. We model an architecture as a set of agents or components that pass messages to each other. We present in this paper algorithms that take as input an architecture and a set of privacy constraints, and output an extension of the original architecture that satisfies the privacy constraints.en
dc.language.isoende_DE
dc.relation.ispartofLecture notes in computer sciencede_DE
dc.titleConstructing Independently Verifiable Privacy-Compliant Type Systems for Message Passing Between Black-Box Componentsde_DE
dc.typeinProceedingsde_DE
dc.type.dinicontributionToPeriodical-
dcterms.DCMITypeText-
tuhh.abstract.englishPrivacy by design (PbD) is the principle that privacy should be considered at every stage of the software engineering process. It is increasingly both viewed as best practice and required by law. It is therefore desirable to have formal methods that provide guarantees that certain privacy-relevant properties hold. We propose an approach that can be used to design a privacy-compliant architecture without needing to know the source code or internal structure of any individual component. We model an architecture as a set of agents or components that pass messages to each other. We present in this paper algorithms that take as input an architecture and a set of privacy constraints, and output an extension of the original architecture that satisfies the privacy constraints.de_DE
tuhh.publisher.doi10.1007/978-3-030-03592-1_11-
tuhh.publication.instituteSoftwaresysteme E-16de_DE
tuhh.type.opusInProceedings (Aufsatz / Paper einer Konferenz etc.)-
tuhh.institute.germanSoftwaresysteme E-16de
tuhh.institute.englishSoftwaresysteme E-16de_DE
tuhh.gvk.hasppnfalse-
dc.type.drivercontributionToPeriodical-
dc.type.casraiConference Paper-
tuhh.container.startpage196de_DE
tuhh.container.endpage214de_DE
item.languageiso639-1en-
item.grantfulltextnone-
item.openairetypeinProceedings-
item.cerifentitytypePublications-
item.creatorOrcidAdams, Robin-
item.creatorOrcidSchupp, Sibylle-
item.fulltextNo Fulltext-
item.creatorGNDAdams, Robin-
item.creatorGNDSchupp, Sibylle-
item.openairecristypehttp://purl.org/coar/resource_type/c_5794-
crisitem.author.deptSoftwaresysteme E-16-
crisitem.author.deptSoftwaresysteme E-16-
crisitem.author.orcid0000-0003-2644-1093-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
Appears in Collections:Publications without fulltext
Show simple item record

Page view(s)

155
Last Week
0
Last month
24
checked on Oct 19, 2020

Google ScholarTM

Check

Add Files to Item

Note about this record

Export

Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.