Formal definitions and complexity results for trust relations and trust domains fit for TTPs, the Web of Trust, PKIs, and ID-Based Cryptography

Citation

Kramer, S, Gore, R & Okamoto, E 2010, 'Formal definitions and complexity results for trust relations and trust domains fit for TTPs, the Web of Trust, PKIs, and ID-Based Cryptography', SIGACT News, vol. 41, no. 1.

Year

2010

ANU Authors

Field of Research

  • Computational Logic And Formal Languages

Updated:  20 April 2024 / Responsible Officer:  Director (Research Services Division) / Page Contact:  Researchers