Anonymity-Preserving Public-Key Encryption: A Constructive Approach View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2013

AUTHORS

Markulf Kohlweiss , Ueli Maurer , Cristina Onete , Björn Tackmann , Daniele Venturi

ABSTRACT

A receiver-anonymous channel allows a sender to send a message to a receiver without an adversary learning for whom the message is intended. Wireless broadcast channels naturally provide receiver anonymity, as does multi-casting one message to a receiver population containing the intended receiver. While anonymity and confidentiality appear to be orthogonal properties, making anonymous communication confidential is more involved than one might expect, since the ciphertext might reveal which public key has been used to encrypt. To address this problem, public-key cryptosystems with enhanced security properties have been proposed.We investigate constructions as well as limitations for preserving receiver anonymity when using public-key encryption (PKE). We use the constructive cryptography approach by Maurer and Renner and interpret cryptographic schemes as constructions of a certain ideal resource (e.g. a confidential anonymous channel) from given real resources (e.g. a broadcast channel). We define appropriate anonymous communication resources and show that a very natural resource can be constructed by using a PKE scheme which fulfills three properties that appear in cryptographic literature (IND-CCA, key-privacy, weak robustness). We also show that a desirable stronger variant, preventing the adversary from selective ”trial-deliveries” of messages, is unfortunately unachievable by any PKE scheme, no matter how strong. The constructive approach makes the guarantees achieved by applying a cryptographic scheme explicit in the constructed (ideal) resource; this specifies the exact requirements for the applicability of a cryptographic scheme in a given context. It also allows to decide which of the existing security properties of such a cryptographic scheme are adequate for the considered scenario, and which are too weak or too strong. Here, we show that weak robustness is necessary but that so-called strong robustness is unnecessarily strong in that it does not construct a (natural) stronger resource. More... »

PAGES

19-39

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-39077-7_2

DOI

http://dx.doi.org/10.1007/978-3-642-39077-7_2

DIMENSIONS

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


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": "Microsoft Research, Cambridge, England", 
          "id": "http://www.grid.ac/institutes/grid.24488.32", 
          "name": [
            "Microsoft Research, Cambridge, England"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Kohlweiss", 
        "givenName": "Markulf", 
        "id": "sg:person.013244500115.57", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013244500115.57"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "ETH Z\u00fcrich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "ETH Z\u00fcrich, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Maurer", 
        "givenName": "Ueli", 
        "id": "sg:person.01316567627.91", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01316567627.91"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "CASED, Darmstadt University of Technology, Germany", 
          "id": "http://www.grid.ac/institutes/grid.6546.1", 
          "name": [
            "CASED, Darmstadt University of Technology, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Onete", 
        "givenName": "Cristina", 
        "id": "sg:person.013532620345.41", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013532620345.41"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "ETH Z\u00fcrich, Switzerland", 
          "id": "http://www.grid.ac/institutes/grid.5801.c", 
          "name": [
            "ETH Z\u00fcrich, Switzerland"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Tackmann", 
        "givenName": "Bj\u00f6rn", 
        "id": "sg:person.07617171521.69", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07617171521.69"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Aarhus University, Denmark", 
          "id": "http://www.grid.ac/institutes/grid.7048.b", 
          "name": [
            "Aarhus University, Denmark"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Venturi", 
        "givenName": "Daniele", 
        "id": "sg:person.011520342003.25", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011520342003.25"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2013", 
    "datePublishedReg": "2013-01-01", 
    "description": "A receiver-anonymous channel allows a sender to send a message to a receiver without an adversary learning for whom the message is intended. Wireless broadcast channels naturally provide receiver anonymity, as does multi-casting one message to a receiver population containing the intended receiver. While anonymity and confidentiality appear to be orthogonal properties, making anonymous communication confidential is more involved than one might expect, since the ciphertext might reveal which public key has been used to encrypt. To address this problem, public-key cryptosystems with enhanced security properties have been proposed.We investigate constructions as well as limitations for preserving receiver anonymity when using public-key encryption (PKE). We use the constructive cryptography approach by Maurer and Renner and interpret cryptographic schemes as constructions of a certain ideal resource (e.g. a confidential anonymous channel) from given real resources (e.g. a broadcast channel). We define appropriate anonymous communication resources and show that a very natural resource can be constructed by using a PKE scheme which fulfills three properties that appear in cryptographic literature (IND-CCA, key-privacy, weak robustness). We also show that a desirable stronger variant, preventing the adversary from selective \u201dtrial-deliveries\u201d of messages, is unfortunately unachievable by any PKE scheme, no matter how strong. The constructive approach makes the guarantees achieved by applying a cryptographic scheme explicit in the constructed (ideal) resource; this specifies the exact requirements for the applicability of a cryptographic scheme in a given context. It also allows to decide which of the existing security properties of such a cryptographic scheme are adequate for the considered scenario, and which are too weak or too strong. Here, we show that weak robustness is necessary but that so-called strong robustness is unnecessarily strong in that it does not construct a (natural) stronger resource.", 
    "editor": [
      {
        "familyName": "De Cristofaro", 
        "givenName": "Emiliano", 
        "type": "Person"
      }, 
      {
        "familyName": "Wright", 
        "givenName": "Matthew", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-39077-7_2", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-642-39076-0", 
        "978-3-642-39077-7"
      ], 
      "name": "Privacy Enhancing Technologies", 
      "type": "Book"
    }, 
    "keywords": [
      "public key encryption", 
      "cryptographic schemes", 
      "security properties", 
      "PKE scheme", 
      "receiver anonymity", 
      "wireless broadcast channels", 
      "public key cryptosystem", 
      "cryptography approach", 
      "anonymous communication", 
      "public key", 
      "communication resources", 
      "cryptographic literature", 
      "constructive approach", 
      "considered scenario", 
      "weak robustness", 
      "receiver population", 
      "anonymity", 
      "broadcast channel", 
      "adversary", 
      "strong robustness", 
      "messages", 
      "exact requirements", 
      "scheme", 
      "orthogonal property", 
      "resources", 
      "stronger variant", 
      "robustness", 
      "encrypt", 
      "encryption", 
      "ciphertext", 
      "cryptosystem", 
      "confidentiality", 
      "sender", 
      "guarantees", 
      "strong resource", 
      "communication", 
      "ideal resource", 
      "real resources", 
      "scenarios", 
      "requirements", 
      "key", 
      "receiver", 
      "Maurer", 
      "channels", 
      "construction", 
      "applicability", 
      "context", 
      "limitations", 
      "variants", 
      "literature", 
      "Renner", 
      "properties", 
      "natural resources", 
      "population", 
      "approach", 
      "problem"
    ], 
    "name": "Anonymity-Preserving Public-Key Encryption: A Constructive Approach", 
    "pagination": "19-39", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1031833387"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-39077-7_2"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-39077-7_2", 
      "https://app.dimensions.ai/details/publication/pub.1031833387"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-10T10:57", 
    "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_98.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-39077-7_2"
  }
]
 

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-39077-7_2'

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-39077-7_2'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-39077-7_2'

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-39077-7_2'


 

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

158 TRIPLES      23 PREDICATES      82 URIs      75 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-39077-7_2 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N41e0fd5eeb0940a395661fb050b2beb5
4 schema:datePublished 2013
5 schema:datePublishedReg 2013-01-01
6 schema:description A receiver-anonymous channel allows a sender to send a message to a receiver without an adversary learning for whom the message is intended. Wireless broadcast channels naturally provide receiver anonymity, as does multi-casting one message to a receiver population containing the intended receiver. While anonymity and confidentiality appear to be orthogonal properties, making anonymous communication confidential is more involved than one might expect, since the ciphertext might reveal which public key has been used to encrypt. To address this problem, public-key cryptosystems with enhanced security properties have been proposed.We investigate constructions as well as limitations for preserving receiver anonymity when using public-key encryption (PKE). We use the constructive cryptography approach by Maurer and Renner and interpret cryptographic schemes as constructions of a certain ideal resource (e.g. a confidential anonymous channel) from given real resources (e.g. a broadcast channel). We define appropriate anonymous communication resources and show that a very natural resource can be constructed by using a PKE scheme which fulfills three properties that appear in cryptographic literature (IND-CCA, key-privacy, weak robustness). We also show that a desirable stronger variant, preventing the adversary from selective ”trial-deliveries” of messages, is unfortunately unachievable by any PKE scheme, no matter how strong. The constructive approach makes the guarantees achieved by applying a cryptographic scheme explicit in the constructed (ideal) resource; this specifies the exact requirements for the applicability of a cryptographic scheme in a given context. It also allows to decide which of the existing security properties of such a cryptographic scheme are adequate for the considered scenario, and which are too weak or too strong. Here, we show that weak robustness is necessary but that so-called strong robustness is unnecessarily strong in that it does not construct a (natural) stronger resource.
7 schema:editor N01f269f21c3244f68c5026e43bf5ff11
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf N4d5b4db1ceca480e984fe27aeca0d791
12 schema:keywords Maurer
13 PKE scheme
14 Renner
15 adversary
16 anonymity
17 anonymous communication
18 applicability
19 approach
20 broadcast channel
21 channels
22 ciphertext
23 communication
24 communication resources
25 confidentiality
26 considered scenario
27 construction
28 constructive approach
29 context
30 cryptographic literature
31 cryptographic schemes
32 cryptography approach
33 cryptosystem
34 encrypt
35 encryption
36 exact requirements
37 guarantees
38 ideal resource
39 key
40 limitations
41 literature
42 messages
43 natural resources
44 orthogonal property
45 population
46 problem
47 properties
48 public key
49 public key cryptosystem
50 public key encryption
51 real resources
52 receiver
53 receiver anonymity
54 receiver population
55 requirements
56 resources
57 robustness
58 scenarios
59 scheme
60 security properties
61 sender
62 strong resource
63 strong robustness
64 stronger variant
65 variants
66 weak robustness
67 wireless broadcast channels
68 schema:name Anonymity-Preserving Public-Key Encryption: A Constructive Approach
69 schema:pagination 19-39
70 schema:productId N4e07fe02774c440390f04b53b72f4fa4
71 N8d76701234264375bb921c24ef404c93
72 schema:publisher N78114472a79c41dead711f61517ee166
73 schema:sameAs https://app.dimensions.ai/details/publication/pub.1031833387
74 https://doi.org/10.1007/978-3-642-39077-7_2
75 schema:sdDatePublished 2022-05-10T10:57
76 schema:sdLicense https://scigraph.springernature.com/explorer/license/
77 schema:sdPublisher Nb07e4ad85e924f97b108a939880a50bc
78 schema:url https://doi.org/10.1007/978-3-642-39077-7_2
79 sgo:license sg:explorer/license/
80 sgo:sdDataset chapters
81 rdf:type schema:Chapter
82 N01f269f21c3244f68c5026e43bf5ff11 rdf:first N70b3e524f39a4fa2833df95903dce88a
83 rdf:rest Nde6c7c6df0b045d49014e289e66e0c80
84 N27e545a83f46431b9ba142d3f5a589f2 rdf:first sg:person.01316567627.91
85 rdf:rest Nf0101ce3da16474eaf587403f3bbceb1
86 N41e0fd5eeb0940a395661fb050b2beb5 rdf:first sg:person.013244500115.57
87 rdf:rest N27e545a83f46431b9ba142d3f5a589f2
88 N4d5b4db1ceca480e984fe27aeca0d791 schema:isbn 978-3-642-39076-0
89 978-3-642-39077-7
90 schema:name Privacy Enhancing Technologies
91 rdf:type schema:Book
92 N4e07fe02774c440390f04b53b72f4fa4 schema:name doi
93 schema:value 10.1007/978-3-642-39077-7_2
94 rdf:type schema:PropertyValue
95 N5be8e24008a74ff6b41ea28a0ea16755 rdf:first sg:person.07617171521.69
96 rdf:rest N703b6f79eb8441bda98bcb2688ca55e0
97 N703b6f79eb8441bda98bcb2688ca55e0 rdf:first sg:person.011520342003.25
98 rdf:rest rdf:nil
99 N70b3e524f39a4fa2833df95903dce88a schema:familyName De Cristofaro
100 schema:givenName Emiliano
101 rdf:type schema:Person
102 N78114472a79c41dead711f61517ee166 schema:name Springer Nature
103 rdf:type schema:Organisation
104 N8d76701234264375bb921c24ef404c93 schema:name dimensions_id
105 schema:value pub.1031833387
106 rdf:type schema:PropertyValue
107 Nb07e4ad85e924f97b108a939880a50bc schema:name Springer Nature - SN SciGraph project
108 rdf:type schema:Organization
109 Nde6c7c6df0b045d49014e289e66e0c80 rdf:first Nf6950eefd3af4ab09e21d691dce11c81
110 rdf:rest rdf:nil
111 Nf0101ce3da16474eaf587403f3bbceb1 rdf:first sg:person.013532620345.41
112 rdf:rest N5be8e24008a74ff6b41ea28a0ea16755
113 Nf6950eefd3af4ab09e21d691dce11c81 schema:familyName Wright
114 schema:givenName Matthew
115 rdf:type schema:Person
116 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
117 schema:name Information and Computing Sciences
118 rdf:type schema:DefinedTerm
119 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
120 schema:name Data Format
121 rdf:type schema:DefinedTerm
122 sg:person.011520342003.25 schema:affiliation grid-institutes:grid.7048.b
123 schema:familyName Venturi
124 schema:givenName Daniele
125 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011520342003.25
126 rdf:type schema:Person
127 sg:person.01316567627.91 schema:affiliation grid-institutes:grid.5801.c
128 schema:familyName Maurer
129 schema:givenName Ueli
130 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01316567627.91
131 rdf:type schema:Person
132 sg:person.013244500115.57 schema:affiliation grid-institutes:grid.24488.32
133 schema:familyName Kohlweiss
134 schema:givenName Markulf
135 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013244500115.57
136 rdf:type schema:Person
137 sg:person.013532620345.41 schema:affiliation grid-institutes:grid.6546.1
138 schema:familyName Onete
139 schema:givenName Cristina
140 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013532620345.41
141 rdf:type schema:Person
142 sg:person.07617171521.69 schema:affiliation grid-institutes:grid.5801.c
143 schema:familyName Tackmann
144 schema:givenName Björn
145 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07617171521.69
146 rdf:type schema:Person
147 grid-institutes:grid.24488.32 schema:alternateName Microsoft Research, Cambridge, England
148 schema:name Microsoft Research, Cambridge, England
149 rdf:type schema:Organization
150 grid-institutes:grid.5801.c schema:alternateName ETH Zürich, Switzerland
151 schema:name ETH Zürich, Switzerland
152 rdf:type schema:Organization
153 grid-institutes:grid.6546.1 schema:alternateName CASED, Darmstadt University of Technology, Germany
154 schema:name CASED, Darmstadt University of Technology, Germany
155 rdf:type schema:Organization
156 grid-institutes:grid.7048.b schema:alternateName Aarhus University, Denmark
157 schema:name Aarhus University, Denmark
158 rdf:type schema:Organization
 




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


...