Ontology type: schema:Chapter Open Access: True
2010
AUTHORSAdam Barth , Benjamin I. P. Rubinstein , Mukund Sundararajan , John C. Mitchell , Dawn Song , Peter L. Bartlett
ABSTRACTDespite the conventional wisdom that proactive security is superior to reactive security, we show that reactive security can be competitive with proactive security as long as the reactive defender learns from past attacks instead of myopically overreacting to the last attack. Our game-theoretic model follows common practice in the security literature by making worst-case assumptions about the attacker: we grant the attacker complete knowledge of the defender’s strategy and do not require the attacker to act rationally. In this model, we bound the competitive ratio between a reactive defense algorithm (which is inspired by online learning theory) and the best fixed proactive defense. Additionally, we show that, unlike proactive defenses, this reactive strategy is robust to a lack of information about the attacker’s incentives and knowledge. More... »
PAGES192-206
Financial Cryptography and Data Security
ISBN
978-3-642-14576-6
978-3-642-14577-3
http://scigraph.springernature.com/pub.10.1007/978-3-642-14577-3_16
DOIhttp://dx.doi.org/10.1007/978-3-642-14577-3_16
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1027453285
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": "Computer Science Division",
"id": "http://www.grid.ac/institutes/None",
"name": [
"Computer Science Division"
],
"type": "Organization"
},
"familyName": "Barth",
"givenName": "Adam",
"id": "sg:person.07455524432.87",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07455524432.87"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Computer Science Division",
"id": "http://www.grid.ac/institutes/None",
"name": [
"Computer Science Division"
],
"type": "Organization"
},
"familyName": "Rubinstein",
"givenName": "Benjamin I. P.",
"id": "sg:person.014377611465.47",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014377611465.47"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Google Inc., Mountain View, CA",
"id": "http://www.grid.ac/institutes/grid.420451.6",
"name": [
"Google Inc., Mountain View, CA"
],
"type": "Organization"
},
"familyName": "Sundararajan",
"givenName": "Mukund",
"id": "sg:person.010222560615.03",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010222560615.03"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Department of Computer Science, Stanford University",
"id": "http://www.grid.ac/institutes/grid.168010.e",
"name": [
"Department of Computer Science, Stanford University"
],
"type": "Organization"
},
"familyName": "Mitchell",
"givenName": "John C.",
"id": "sg:person.016213414603.79",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016213414603.79"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Computer Science Division",
"id": "http://www.grid.ac/institutes/None",
"name": [
"Computer Science Division"
],
"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"
},
{
"affiliation": {
"alternateName": "Department of Statistics, UC Berkeley",
"id": "http://www.grid.ac/institutes/None",
"name": [
"Computer Science Division",
"Department of Statistics, UC Berkeley"
],
"type": "Organization"
},
"familyName": "Bartlett",
"givenName": "Peter L.",
"id": "sg:person.014367747662.33",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014367747662.33"
],
"type": "Person"
}
],
"datePublished": "2010",
"datePublishedReg": "2010-01-01",
"description": "Despite the conventional wisdom that proactive security is superior to reactive security, we show that reactive security can be competitive with proactive security as long as the reactive defender learns from past attacks instead of myopically overreacting to the last attack. Our game-theoretic model follows common practice in the security literature by making worst-case assumptions about the attacker: we grant the attacker complete knowledge of the defender\u2019s strategy and do not require the attacker to act rationally. In this model, we bound the competitive ratio between a reactive defense algorithm (which is inspired by online learning theory) and the best fixed proactive defense. Additionally, we show that, unlike proactive defenses, this reactive strategy is robust to a lack of information about the attacker\u2019s incentives and knowledge.",
"editor": [
{
"familyName": "Sion",
"givenName": "Radu",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/978-3-642-14577-3_16",
"inLanguage": "en",
"isAccessibleForFree": true,
"isPartOf": {
"isbn": [
"978-3-642-14576-6",
"978-3-642-14577-3"
],
"name": "Financial Cryptography and Data Security",
"type": "Book"
},
"keywords": [
"proactive security",
"proactive defense",
"defense algorithm",
"attacker's incentives",
"reactive security",
"defender strategy",
"past attacks",
"security",
"security literature",
"game-theoretic model",
"competitive ratio",
"attacker",
"worst-case assumptions",
"complete knowledge",
"attacks",
"reactive strategies",
"algorithm",
"learning",
"common practice",
"information",
"knowledge",
"model",
"lack of information",
"defenders",
"strategies",
"defense",
"incentives",
"assumption",
"last attack",
"lack",
"conventional wisdom",
"practice",
"wisdom",
"literature",
"ratio",
"approach"
],
"name": "A Learning-Based Approach to Reactive Security",
"pagination": "192-206",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1027453285"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/978-3-642-14577-3_16"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/978-3-642-14577-3_16",
"https://app.dimensions.ai/details/publication/pub.1027453285"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-05-20T07:42",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/chapter/chapter_145.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/978-3-642-14577-3_16"
}
]Download the RDF metadata as: json-ld nt turtle xml License info
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-14577-3_16'
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-14577-3_16'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-14577-3_16'
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-14577-3_16'
This table displays all metadata directly associated to this object as RDF triples.
139 TRIPLES
23 PREDICATES
62 URIs
55 LITERALS
7 BLANK NODES