Efficient anonymous multicast and reception View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2006-05-17

AUTHORS

Shlomi Dolev , Rafail Ostrovsky

ABSTRACT

In this work we examine the problem of efficient anonymous broadcast and reception in general communication networks. We show an algorithm which achieves anonymous communication with O(1) amortized communication complexity on each link and low computational complexity. In contrast, all previous solutions require polynomial (in the size of the network and security parameter) amortized communication complexity. More... »

PAGES

395-409

References to SciGraph publications

Book

TITLE

Advances in Cryptology — CRYPTO '97

ISBN

978-3-540-63384-6
978-3-540-69528-8

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/bfb0052251

DOI

http://dx.doi.org/10.1007/bfb0052251

DIMENSIONS

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


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/0804", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Data Format", 
        "type": "DefinedTerm"
      }, 
      {
        "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"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Ben-Gurion University of the Negev", 
          "id": "https://www.grid.ac/institutes/grid.7489.2", 
          "name": [
            "Department of Mathematics and Computer Science, Ben-Gurion University of the Negev, 84105, Beer-Sheva, Israel"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Dolev", 
        "givenName": "Shlomi", 
        "id": "sg:person.011614320117.59", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011614320117.59"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Ericsson (United States)", 
          "id": "https://www.grid.ac/institutes/grid.432790.b", 
          "name": [
            "Bell Communications Research, 445 South St. MCC 1C-365B, 07960-6438, Morristown, NJ, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Ostrovsky", 
        "givenName": "Rafail", 
        "id": "sg:person.015474716573.95", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015474716573.95"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1016/0167-4048(87)90087-3", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1010342936"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0167-4048(87)90087-3", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1010342936"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf00206326", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1041027293", 
          "https://doi.org/10.1007/bf00206326"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf00206326", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1041027293", 
          "https://doi.org/10.1007/bf00206326"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/358549.358563", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1042225009"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1038/scientificamerican0892-96", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1056586557", 
          "https://doi.org/10.1038/scientificamerican0892-96"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/0213053", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062841787"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2006-05-17", 
    "datePublishedReg": "2006-05-17", 
    "description": "In this work we examine the problem of efficient anonymous broadcast and reception in general communication networks. We show an algorithm which achieves anonymous communication with O(1) amortized communication complexity on each link and low computational complexity. In contrast, all previous solutions require polynomial (in the size of the network and security parameter) amortized communication complexity.", 
    "editor": [
      {
        "familyName": "Kaliski", 
        "givenName": "Burton S.", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/bfb0052251", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-63384-6", 
        "978-3-540-69528-8"
      ], 
      "name": "Advances in Cryptology \u2014 CRYPTO '97", 
      "type": "Book"
    }, 
    "name": "Efficient anonymous multicast and reception", 
    "pagination": "395-409", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1047371602"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bfb0052251"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "e1a9fe759915d9f6930789a0e9c1259c39f9e60971e85d0e2e5b4e9c031a7ff3"
        ]
      }
    ], 
    "publisher": {
      "location": "Berlin, Heidelberg", 
      "name": "Springer Berlin Heidelberg", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/bfb0052251", 
      "https://app.dimensions.ai/details/publication/pub.1047371602"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-16T08:59", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000369_0000000369/records_68978_00000001.jsonl", 
    "type": "Chapter", 
    "url": "https://link.springer.com/10.1007%2FBFb0052251"
  }
]
 

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/bfb0052251'

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/bfb0052251'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/bfb0052251'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/bfb0052251'


 

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

92 TRIPLES      23 PREDICATES      31 URIs      19 LITERALS      8 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/bfb0052251 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N04f50ba1306b47c5a3b26d8624de11b3
4 schema:citation sg:pub.10.1007/bf00206326
5 sg:pub.10.1038/scientificamerican0892-96
6 https://doi.org/10.1016/0167-4048(87)90087-3
7 https://doi.org/10.1137/0213053
8 https://doi.org/10.1145/358549.358563
9 schema:datePublished 2006-05-17
10 schema:datePublishedReg 2006-05-17
11 schema:description In this work we examine the problem of efficient anonymous broadcast and reception in general communication networks. We show an algorithm which achieves anonymous communication with O(1) amortized communication complexity on each link and low computational complexity. In contrast, all previous solutions require polynomial (in the size of the network and security parameter) amortized communication complexity.
12 schema:editor N9b0553c1d1e5457699016b9c6434ff60
13 schema:genre chapter
14 schema:inLanguage en
15 schema:isAccessibleForFree true
16 schema:isPartOf Nfde1bceccf40408c999c11b90411f0e8
17 schema:name Efficient anonymous multicast and reception
18 schema:pagination 395-409
19 schema:productId N34f1aa2c0b294fffb110d6addd71a9f8
20 Nc5d0658afef348179c68d5362f7ce134
21 Nda4d6156716e4f96b8b619b510c608e6
22 schema:publisher Ne9036c11e5a646b2a4465ab323f5f5c4
23 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047371602
24 https://doi.org/10.1007/bfb0052251
25 schema:sdDatePublished 2019-04-16T08:59
26 schema:sdLicense https://scigraph.springernature.com/explorer/license/
27 schema:sdPublisher Nbd97073fef8041179d32f418d41aa0d7
28 schema:url https://link.springer.com/10.1007%2FBFb0052251
29 sgo:license sg:explorer/license/
30 sgo:sdDataset chapters
31 rdf:type schema:Chapter
32 N04f50ba1306b47c5a3b26d8624de11b3 rdf:first sg:person.011614320117.59
33 rdf:rest Nadc74201eef140d385b5433a6d417526
34 N34f1aa2c0b294fffb110d6addd71a9f8 schema:name doi
35 schema:value 10.1007/bfb0052251
36 rdf:type schema:PropertyValue
37 N9b0553c1d1e5457699016b9c6434ff60 rdf:first Na98c2ef5dc2a44288df7de9251d60c89
38 rdf:rest rdf:nil
39 Na98c2ef5dc2a44288df7de9251d60c89 schema:familyName Kaliski
40 schema:givenName Burton S.
41 rdf:type schema:Person
42 Nadc74201eef140d385b5433a6d417526 rdf:first sg:person.015474716573.95
43 rdf:rest rdf:nil
44 Nbd97073fef8041179d32f418d41aa0d7 schema:name Springer Nature - SN SciGraph project
45 rdf:type schema:Organization
46 Nc5d0658afef348179c68d5362f7ce134 schema:name dimensions_id
47 schema:value pub.1047371602
48 rdf:type schema:PropertyValue
49 Nda4d6156716e4f96b8b619b510c608e6 schema:name readcube_id
50 schema:value e1a9fe759915d9f6930789a0e9c1259c39f9e60971e85d0e2e5b4e9c031a7ff3
51 rdf:type schema:PropertyValue
52 Ne9036c11e5a646b2a4465ab323f5f5c4 schema:location Berlin, Heidelberg
53 schema:name Springer Berlin Heidelberg
54 rdf:type schema:Organisation
55 Nfde1bceccf40408c999c11b90411f0e8 schema:isbn 978-3-540-63384-6
56 978-3-540-69528-8
57 schema:name Advances in Cryptology — CRYPTO '97
58 rdf:type schema:Book
59 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
60 schema:name Information and Computing Sciences
61 rdf:type schema:DefinedTerm
62 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
63 schema:name Data Format
64 rdf:type schema:DefinedTerm
65 sg:person.011614320117.59 schema:affiliation https://www.grid.ac/institutes/grid.7489.2
66 schema:familyName Dolev
67 schema:givenName Shlomi
68 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011614320117.59
69 rdf:type schema:Person
70 sg:person.015474716573.95 schema:affiliation https://www.grid.ac/institutes/grid.432790.b
71 schema:familyName Ostrovsky
72 schema:givenName Rafail
73 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015474716573.95
74 rdf:type schema:Person
75 sg:pub.10.1007/bf00206326 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041027293
76 https://doi.org/10.1007/bf00206326
77 rdf:type schema:CreativeWork
78 sg:pub.10.1038/scientificamerican0892-96 schema:sameAs https://app.dimensions.ai/details/publication/pub.1056586557
79 https://doi.org/10.1038/scientificamerican0892-96
80 rdf:type schema:CreativeWork
81 https://doi.org/10.1016/0167-4048(87)90087-3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1010342936
82 rdf:type schema:CreativeWork
83 https://doi.org/10.1137/0213053 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062841787
84 rdf:type schema:CreativeWork
85 https://doi.org/10.1145/358549.358563 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042225009
86 rdf:type schema:CreativeWork
87 https://www.grid.ac/institutes/grid.432790.b schema:alternateName Ericsson (United States)
88 schema:name Bell Communications Research, 445 South St. MCC 1C-365B, 07960-6438, Morristown, NJ, USA
89 rdf:type schema:Organization
90 https://www.grid.ac/institutes/grid.7489.2 schema:alternateName Ben-Gurion University of the Negev
91 schema:name Department of Mathematics and Computer Science, Ben-Gurion University of the Negev, 84105, Beer-Sheva, Israel
92 rdf:type schema:Organization
 




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


...