Policy-Enhanced Private Set Intersection: Sharing Information While Enforcing Privacy Policies View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2012

AUTHORS

Emil Stefanov , Elaine Shi , Dawn Song

ABSTRACT

Companies, organizations, and individuals often wish to share information to realize valuable social and economic goals. Unfortunately, privacy concerns often stand in the way of such information sharing and exchange.This paper proposes a novel cryptographic paradigm called Policy-Enhanced Private Set Intersection (PPSI ), allowing two parties to share information while enforcing the desired privacy policies. Our constructions require minimal additional overhead over traditional Private Set Intersection (PSI) protocols, and yet we can handle rich policy semantics previously not possible with traditional PSI and Authorized Private Set Intersection (APSI) protocols. Our scheme involves running a standard PSI protocol over carefully crafted encodings of elements formed as part of a challenge-response mechanism. The structure of these encodings resemble techniques used for aggregating BLS signatures in bilinear groups. We prove that our scheme is secure in the malicious model, under the CBDH assumption, the random oracle model, and the assumption that the underlying PSI protocol is secure against malicious adversaries. More... »

PAGES

413-430

Book

TITLE

Public Key Cryptography – PKC 2012

ISBN

978-3-642-30056-1
978-3-642-30057-8

Author Affiliations

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-30057-8_25

DOI

http://dx.doi.org/10.1007/978-3-642-30057-8_25

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1043940494


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0804", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Data Format", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "UC Berkeley, USA", 
          "id": "http://www.grid.ac/institutes/grid.47840.3f", 
          "name": [
            "UC Berkeley, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Stefanov", 
        "givenName": "Emil", 
        "id": "sg:person.015427206066.62", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015427206066.62"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "UC Berkeley, USA", 
          "id": "http://www.grid.ac/institutes/grid.47840.3f", 
          "name": [
            "UC Berkeley, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Shi", 
        "givenName": "Elaine", 
        "id": "sg:person.014706274717.52", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014706274717.52"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "UC Berkeley, USA", 
          "id": "http://www.grid.ac/institutes/grid.47840.3f", 
          "name": [
            "UC Berkeley, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Song", 
        "givenName": "Dawn", 
        "id": "sg:person.01143152610.86", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01143152610.86"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2012", 
    "datePublishedReg": "2012-01-01", 
    "description": "Companies, organizations, and individuals often wish to share information to realize valuable social and economic goals. Unfortunately, privacy concerns often stand in the way of such information sharing and exchange.This paper proposes a novel cryptographic paradigm called Policy-Enhanced Private Set Intersection (PPSI ), allowing two parties to share information while enforcing the desired privacy policies. Our constructions require minimal additional overhead over traditional Private Set Intersection (PSI) protocols, and yet we can handle rich policy semantics previously not possible with traditional PSI and Authorized Private Set Intersection (APSI) protocols. Our scheme involves running a standard PSI protocol over carefully crafted encodings of elements formed as part of a challenge-response mechanism. The structure of these encodings resemble techniques used for aggregating BLS signatures in bilinear groups. We prove that our scheme is secure in the malicious model, under the CBDH assumption, the random oracle model, and the assumption that the underlying PSI protocol is secure against malicious adversaries.", 
    "editor": [
      {
        "familyName": "Fischlin", 
        "givenName": "Marc", 
        "type": "Person"
      }, 
      {
        "familyName": "Buchmann", 
        "givenName": "Johannes", 
        "type": "Person"
      }, 
      {
        "familyName": "Manulis", 
        "givenName": "Mark", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-30057-8_25", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-642-30056-1", 
        "978-3-642-30057-8"
      ], 
      "name": "Public Key Cryptography \u2013 PKC 2012", 
      "type": "Book"
    }, 
    "keywords": [
      "private set intersection protocol", 
      "set intersection protocol", 
      "privacy policies", 
      "intersection protocol", 
      "PSI protocol", 
      "challenge-response mechanism", 
      "Private Set Intersection", 
      "random oracle model", 
      "such information sharing", 
      "minimal additional overhead", 
      "policy semantics", 
      "malicious model", 
      "cryptographic paradigm", 
      "BLS signature", 
      "malicious adversaries", 
      "privacy concerns", 
      "set intersection", 
      "oracle model", 
      "bilinear groups", 
      "additional overhead", 
      "information sharing", 
      "encoding", 
      "information", 
      "traditional PSI", 
      "scheme", 
      "protocol", 
      "overhead", 
      "adversary", 
      "semantics", 
      "sharing", 
      "paradigm", 
      "model", 
      "companies", 
      "goal", 
      "technique", 
      "way", 
      "intersection", 
      "parties", 
      "organization", 
      "assumption", 
      "construction", 
      "signatures", 
      "policy", 
      "exchange", 
      "concern", 
      "economic goals", 
      "part", 
      "elements", 
      "structure", 
      "mechanism", 
      "individuals", 
      "group", 
      "paper", 
      "psi"
    ], 
    "name": "Policy-Enhanced Private Set Intersection: Sharing Information While Enforcing Privacy Policies", 
    "pagination": "413-430", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1043940494"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-30057-8_25"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-30057-8_25", 
      "https://app.dimensions.ai/details/publication/pub.1043940494"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-10T10:43", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220509/entities/gbq_results/chapter/chapter_246.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-30057-8_25"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-30057-8_25'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-30057-8_25'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-30057-8_25'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-30057-8_25'


 

This table displays all metadata directly associated to this object as RDF triples.

138 TRIPLES      23 PREDICATES      80 URIs      73 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-30057-8_25 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N88194db2f1d64a0aadf6def58effb1ff
4 schema:datePublished 2012
5 schema:datePublishedReg 2012-01-01
6 schema:description Companies, organizations, and individuals often wish to share information to realize valuable social and economic goals. Unfortunately, privacy concerns often stand in the way of such information sharing and exchange.This paper proposes a novel cryptographic paradigm called Policy-Enhanced Private Set Intersection (PPSI ), allowing two parties to share information while enforcing the desired privacy policies. Our constructions require minimal additional overhead over traditional Private Set Intersection (PSI) protocols, and yet we can handle rich policy semantics previously not possible with traditional PSI and Authorized Private Set Intersection (APSI) protocols. Our scheme involves running a standard PSI protocol over carefully crafted encodings of elements formed as part of a challenge-response mechanism. The structure of these encodings resemble techniques used for aggregating BLS signatures in bilinear groups. We prove that our scheme is secure in the malicious model, under the CBDH assumption, the random oracle model, and the assumption that the underlying PSI protocol is secure against malicious adversaries.
7 schema:editor N8df1a07f283a4c9687fead7b982b25ed
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf N800c7e7817eb4793b75972a69a638e74
12 schema:keywords BLS signature
13 PSI protocol
14 Private Set Intersection
15 additional overhead
16 adversary
17 assumption
18 bilinear groups
19 challenge-response mechanism
20 companies
21 concern
22 construction
23 cryptographic paradigm
24 economic goals
25 elements
26 encoding
27 exchange
28 goal
29 group
30 individuals
31 information
32 information sharing
33 intersection
34 intersection protocol
35 malicious adversaries
36 malicious model
37 mechanism
38 minimal additional overhead
39 model
40 oracle model
41 organization
42 overhead
43 paper
44 paradigm
45 part
46 parties
47 policy
48 policy semantics
49 privacy concerns
50 privacy policies
51 private set intersection protocol
52 protocol
53 psi
54 random oracle model
55 scheme
56 semantics
57 set intersection
58 set intersection protocol
59 sharing
60 signatures
61 structure
62 such information sharing
63 technique
64 traditional PSI
65 way
66 schema:name Policy-Enhanced Private Set Intersection: Sharing Information While Enforcing Privacy Policies
67 schema:pagination 413-430
68 schema:productId Na295b9f648ee483486a7e78a8b001754
69 Nda27e3791dab4e34aa86f04fd9322d4a
70 schema:publisher Nbcf7b1359e6049aa9b4fdbeca20e9d18
71 schema:sameAs https://app.dimensions.ai/details/publication/pub.1043940494
72 https://doi.org/10.1007/978-3-642-30057-8_25
73 schema:sdDatePublished 2022-05-10T10:43
74 schema:sdLicense https://scigraph.springernature.com/explorer/license/
75 schema:sdPublisher N4e3935de9e184ba8be52605dcede3e8a
76 schema:url https://doi.org/10.1007/978-3-642-30057-8_25
77 sgo:license sg:explorer/license/
78 sgo:sdDataset chapters
79 rdf:type schema:Chapter
80 N13db578252d04e208318d95ef9fabd36 schema:familyName Manulis
81 schema:givenName Mark
82 rdf:type schema:Person
83 N4e3935de9e184ba8be52605dcede3e8a schema:name Springer Nature - SN SciGraph project
84 rdf:type schema:Organization
85 N591da47c23944f73a0a313948ac2feef rdf:first N13db578252d04e208318d95ef9fabd36
86 rdf:rest rdf:nil
87 N7472c0a887a14e4bb94a61408dbe7c21 rdf:first sg:person.01143152610.86
88 rdf:rest rdf:nil
89 N75df96a171df419db602f1b35f28d5e1 rdf:first N991dc65b933f4b25aafd24f192744d64
90 rdf:rest N591da47c23944f73a0a313948ac2feef
91 N800c7e7817eb4793b75972a69a638e74 schema:isbn 978-3-642-30056-1
92 978-3-642-30057-8
93 schema:name Public Key Cryptography – PKC 2012
94 rdf:type schema:Book
95 N88194db2f1d64a0aadf6def58effb1ff rdf:first sg:person.015427206066.62
96 rdf:rest Nfb4130ef5a2d4a8db344a03828118c6b
97 N8df1a07f283a4c9687fead7b982b25ed rdf:first Ndb75ee39ff2645d38bd210d71e56cd65
98 rdf:rest N75df96a171df419db602f1b35f28d5e1
99 N991dc65b933f4b25aafd24f192744d64 schema:familyName Buchmann
100 schema:givenName Johannes
101 rdf:type schema:Person
102 Na295b9f648ee483486a7e78a8b001754 schema:name dimensions_id
103 schema:value pub.1043940494
104 rdf:type schema:PropertyValue
105 Nbcf7b1359e6049aa9b4fdbeca20e9d18 schema:name Springer Nature
106 rdf:type schema:Organisation
107 Nda27e3791dab4e34aa86f04fd9322d4a schema:name doi
108 schema:value 10.1007/978-3-642-30057-8_25
109 rdf:type schema:PropertyValue
110 Ndb75ee39ff2645d38bd210d71e56cd65 schema:familyName Fischlin
111 schema:givenName Marc
112 rdf:type schema:Person
113 Nfb4130ef5a2d4a8db344a03828118c6b rdf:first sg:person.014706274717.52
114 rdf:rest N7472c0a887a14e4bb94a61408dbe7c21
115 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
116 schema:name Information and Computing Sciences
117 rdf:type schema:DefinedTerm
118 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
119 schema:name Data Format
120 rdf:type schema:DefinedTerm
121 sg:person.01143152610.86 schema:affiliation grid-institutes:grid.47840.3f
122 schema:familyName Song
123 schema:givenName Dawn
124 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01143152610.86
125 rdf:type schema:Person
126 sg:person.014706274717.52 schema:affiliation grid-institutes:grid.47840.3f
127 schema:familyName Shi
128 schema:givenName Elaine
129 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014706274717.52
130 rdf:type schema:Person
131 sg:person.015427206066.62 schema:affiliation grid-institutes:grid.47840.3f
132 schema:familyName Stefanov
133 schema:givenName Emil
134 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015427206066.62
135 rdf:type schema:Person
136 grid-institutes:grid.47840.3f schema:alternateName UC Berkeley, USA
137 schema:name UC Berkeley, USA
138 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...