Hiding a Needle in a Haystack Using Negative Databases View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2008

AUTHORS

Fernando Esponda

ABSTRACT

In this paper we present a method for hiding a list of data by mixing it with a large amount of superfluous items. The technique uses a device known as a negative database which stores the complement of a set rather that the set itself to include an arbitrary number of garbage entries efficiently. The resulting structure effectively hides the data, without encrypting it, and obfuscates the number of data items hidden; it prevents arbitrary data lookups, while supporting simple membership queries; and can be manipulated to reflect relational algebra operations on the original data. More... »

PAGES

15-29

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-540-88961-8_2

DOI

http://dx.doi.org/10.1007/978-3-540-88961-8_2

DIMENSIONS

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


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/0806", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information Systems", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, Instituto Tecnol\u00f3gico Aut\u00f3nomo de M\u00e9xico, Mexico City, Mexico", 
          "id": "http://www.grid.ac/institutes/grid.454349.b", 
          "name": [
            "Department of Computer Science, Instituto Tecnol\u00f3gico Aut\u00f3nomo de M\u00e9xico, Mexico City, Mexico"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Esponda", 
        "givenName": "Fernando", 
        "id": "sg:person.0720117634.32", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0720117634.32"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2008", 
    "datePublishedReg": "2008-01-01", 
    "description": "In this paper we present a method for hiding a list of data by mixing it with a large amount of superfluous items. The technique uses a device known as a negative database which stores the complement of a set rather that the set itself to include an arbitrary number of garbage entries efficiently. The resulting structure effectively hides the data, without encrypting it, and obfuscates the number of data items hidden; it prevents arbitrary data lookups, while supporting simple membership queries; and can be manipulated to reflect relational algebra operations on the original data.", 
    "editor": [
      {
        "familyName": "Solanki", 
        "givenName": "Kaushal", 
        "type": "Person"
      }, 
      {
        "familyName": "Sullivan", 
        "givenName": "Kenneth", 
        "type": "Person"
      }, 
      {
        "familyName": "Madhow", 
        "givenName": "Upamanyu", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-540-88961-8_2", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-88960-1", 
        "978-3-540-88961-8"
      ], 
      "name": "Information Hiding", 
      "type": "Book"
    }, 
    "keywords": [
      "negative database", 
      "relational algebra operations", 
      "data lookup", 
      "data items", 
      "superfluous items", 
      "algebra operations", 
      "membership queries", 
      "list of data", 
      "original data", 
      "arbitrary number", 
      "large amount", 
      "queries", 
      "lookup", 
      "database", 
      "set", 
      "haystack", 
      "data", 
      "items", 
      "devices", 
      "operation", 
      "technique", 
      "number", 
      "list", 
      "method", 
      "structure", 
      "amount", 
      "needle", 
      "entry", 
      "complement", 
      "paper"
    ], 
    "name": "Hiding a Needle in a Haystack Using Negative Databases", 
    "pagination": "15-29", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1024671221"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-540-88961-8_2"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-540-88961-8_2", 
      "https://app.dimensions.ai/details/publication/pub.1024671221"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-10T10:56", 
    "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_8.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-540-88961-8_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-540-88961-8_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-540-88961-8_2'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-88961-8_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-540-88961-8_2'


 

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

100 TRIPLES      23 PREDICATES      56 URIs      49 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-540-88961-8_2 schema:about anzsrc-for:08
2 anzsrc-for:0806
3 schema:author Nfe14bb40fc984ca29e71aeb712ffe79a
4 schema:datePublished 2008
5 schema:datePublishedReg 2008-01-01
6 schema:description In this paper we present a method for hiding a list of data by mixing it with a large amount of superfluous items. The technique uses a device known as a negative database which stores the complement of a set rather that the set itself to include an arbitrary number of garbage entries efficiently. The resulting structure effectively hides the data, without encrypting it, and obfuscates the number of data items hidden; it prevents arbitrary data lookups, while supporting simple membership queries; and can be manipulated to reflect relational algebra operations on the original data.
7 schema:editor N131a04d25d554815a07af3c8757016dd
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf N4ac2a0312ecd4831af45f8cd961f94bc
12 schema:keywords algebra operations
13 amount
14 arbitrary number
15 complement
16 data
17 data items
18 data lookup
19 database
20 devices
21 entry
22 haystack
23 items
24 large amount
25 list
26 list of data
27 lookup
28 membership queries
29 method
30 needle
31 negative database
32 number
33 operation
34 original data
35 paper
36 queries
37 relational algebra operations
38 set
39 structure
40 superfluous items
41 technique
42 schema:name Hiding a Needle in a Haystack Using Negative Databases
43 schema:pagination 15-29
44 schema:productId N77a46abda27a4334a6b00496fbfd0c1b
45 N9ec3f63bfb8d44eabeac1379a6ea0be4
46 schema:publisher Nbd209503143d4e0e832954ca2936f113
47 schema:sameAs https://app.dimensions.ai/details/publication/pub.1024671221
48 https://doi.org/10.1007/978-3-540-88961-8_2
49 schema:sdDatePublished 2022-05-10T10:56
50 schema:sdLicense https://scigraph.springernature.com/explorer/license/
51 schema:sdPublisher Nc5b71aa442034649924e5204b6aa728f
52 schema:url https://doi.org/10.1007/978-3-540-88961-8_2
53 sgo:license sg:explorer/license/
54 sgo:sdDataset chapters
55 rdf:type schema:Chapter
56 N131a04d25d554815a07af3c8757016dd rdf:first N905c66bba38c40b995a6d6af01bed8e3
57 rdf:rest N2e4bdb59e97b4a4ea6afa747d9c20a36
58 N2e4bdb59e97b4a4ea6afa747d9c20a36 rdf:first N76ebad744e454141a61a5790ab6c9d7c
59 rdf:rest Nb2978eeeb78a4ce48a5c89d9fba62ead
60 N4ac2a0312ecd4831af45f8cd961f94bc schema:isbn 978-3-540-88960-1
61 978-3-540-88961-8
62 schema:name Information Hiding
63 rdf:type schema:Book
64 N76ebad744e454141a61a5790ab6c9d7c schema:familyName Sullivan
65 schema:givenName Kenneth
66 rdf:type schema:Person
67 N77a46abda27a4334a6b00496fbfd0c1b schema:name doi
68 schema:value 10.1007/978-3-540-88961-8_2
69 rdf:type schema:PropertyValue
70 N905c66bba38c40b995a6d6af01bed8e3 schema:familyName Solanki
71 schema:givenName Kaushal
72 rdf:type schema:Person
73 N9ec3f63bfb8d44eabeac1379a6ea0be4 schema:name dimensions_id
74 schema:value pub.1024671221
75 rdf:type schema:PropertyValue
76 Nb2978eeeb78a4ce48a5c89d9fba62ead rdf:first Nf090a8d66d15455d9f397831d43fecc3
77 rdf:rest rdf:nil
78 Nbd209503143d4e0e832954ca2936f113 schema:name Springer Nature
79 rdf:type schema:Organisation
80 Nc5b71aa442034649924e5204b6aa728f schema:name Springer Nature - SN SciGraph project
81 rdf:type schema:Organization
82 Nf090a8d66d15455d9f397831d43fecc3 schema:familyName Madhow
83 schema:givenName Upamanyu
84 rdf:type schema:Person
85 Nfe14bb40fc984ca29e71aeb712ffe79a rdf:first sg:person.0720117634.32
86 rdf:rest rdf:nil
87 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
88 schema:name Information and Computing Sciences
89 rdf:type schema:DefinedTerm
90 anzsrc-for:0806 schema:inDefinedTermSet anzsrc-for:
91 schema:name Information Systems
92 rdf:type schema:DefinedTerm
93 sg:person.0720117634.32 schema:affiliation grid-institutes:grid.454349.b
94 schema:familyName Esponda
95 schema:givenName Fernando
96 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0720117634.32
97 rdf:type schema:Person
98 grid-institutes:grid.454349.b schema:alternateName Department of Computer Science, Instituto Tecnológico Autónomo de México, Mexico City, Mexico
99 schema:name Department of Computer Science, Instituto Tecnológico Autónomo de México, Mexico City, Mexico
100 rdf:type schema:Organization
 




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


...