View in EDS PDF Full Text

Computer-aided decision-making with trust relations and trust domains (cryptographic applications)*.

Saved in:
Bibliographic Details
Title: Computer-aided decision-making with trust relations and trust domains (cryptographic applications)*.
Authors: Kramer, Simon1, Goré, Rajeev2, Okamoto, Eiji3
Source: Journal of Logic & Computation. Feb2014, Vol. 24 Issue 1, p19-54. 36p.
Subjects: Scalability, Datalog (Computer program language), Computational learning theory, Access control, Cryptography, Symmetric domains
Abstract: We propose generic declarative definitions of individual and collective trust relations between interacting agents and agent collections, and trust domains of trust-related agents in distributed systems. Our definitions yield (1) (in)compatibility, implicational and transitivity results for trust relationships, including a Datalog-implementability result for their logical structure; (2) computational complexity results for deciding potential and actual trust relationships and membership in trust domains; (3) a positive (negative) compositionality result for strong (weak) trust domains; (4) a computational design pattern for building up strong trust domains; and (5) a negative scalability result for trust domains in general. We instantiate our generic trust concepts in five major cryptographic applications of trust, namely: Access Control, Trusted Third Parties, the Web of Trust, Public-Key Infrastructures and Identity-Based Cryptography. We also show that accountability induces trust. Our defining principle for weak and strong trust (domains) is (common) belief in and (common) knowledge of agent correctness, respectively. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 93915132
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Computer-aided decision-making with trust relations and trust domains (cryptographic applications)*.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Kramer%2C+Simon%22">Kramer, Simon</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Goré%2C+Rajeev%22">Goré, Rajeev</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Okamoto%2C+Eiji%22">Okamoto, Eiji</searchLink><relatesTo>3</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Logic+%26+Computation%22">Journal of Logic & Computation</searchLink>. Feb2014, Vol. 24 Issue 1, p19-54. 36p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Scalability%22">Scalability</searchLink><br /><searchLink fieldCode="DE" term="%22Datalog+%28Computer+program+language%29%22">Datalog (Computer program language)</searchLink><br /><searchLink fieldCode="DE" term="%22Computational+learning+theory%22">Computational learning theory</searchLink><br /><searchLink fieldCode="DE" term="%22Access+control%22">Access control</searchLink><br /><searchLink fieldCode="DE" term="%22Cryptography%22">Cryptography</searchLink><br /><searchLink fieldCode="DE" term="%22Symmetric+domains%22">Symmetric domains</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: We propose generic declarative definitions of individual and collective trust relations between interacting agents and agent collections, and trust domains of trust-related agents in distributed systems. Our definitions yield (1) (in)compatibility, implicational and transitivity results for trust relationships, including a Datalog-implementability result for their logical structure; (2) computational complexity results for deciding potential and actual trust relationships and membership in trust domains; (3) a positive (negative) compositionality result for strong (weak) trust domains; (4) a computational design pattern for building up strong trust domains; and (5) a negative scalability result for trust domains in general. We instantiate our generic trust concepts in five major cryptographic applications of trust, namely: Access Control, Trusted Third Parties, the Web of Trust, Public-Key Infrastructures and Identity-Based Cryptography. We also show that accountability induces trust. Our defining principle for weak and strong trust (domains) is (common) belief in and (common) knowledge of agent correctness, respectively. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=93915132
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1093/logcom/exs013
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 36
        StartPage: 19
    Subjects:
      – SubjectFull: Scalability
        Type: general
      – SubjectFull: Datalog (Computer program language)
        Type: general
      – SubjectFull: Computational learning theory
        Type: general
      – SubjectFull: Access control
        Type: general
      – SubjectFull: Cryptography
        Type: general
      – SubjectFull: Symmetric domains
        Type: general
    Titles:
      – TitleFull: Computer-aided decision-making with trust relations and trust domains (cryptographic applications)*.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Kramer, Simon
      – PersonEntity:
          Name:
            NameFull: Goré, Rajeev
      – PersonEntity:
          Name:
            NameFull: Okamoto, Eiji
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 02
              Text: Feb2014
              Type: published
              Y: 2014
          Identifiers:
            – Type: issn-print
              Value: 0955792X
          Numbering:
            – Type: volume
              Value: 24
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Journal of Logic & Computation
              Type: main
ResultId 1