Map
Index
Random
Help
th

QuoteRef: jimT5_2000

topics > all references > ThesaHelp: references i-l



ThesaHelp:
references i-l
Topic:
proof-carrying code
Group:
security
Topic:
constructing proof and program together
Topic:
type-safe and secure languages
Topic:
logic programming
Topic:
theorem proving systems
Topic:
digital signature
Topic:
key distribution
Topic:
formal methods and languages
Topic:
abstraction in programming
Topic:
understanding systems
Group:
program proving
Topic:
consistency testing
Topic:
program proving is infeasible

Reference

Jim, T., "SD3: a trust management system with certified evaluation", Proceedings 2001 IEEE Symposium on Security and Privacy, Oakland, California, USA, May 2000, IEEE Computer Society Press, pp. 106-115. Google

Quotations
abstract ;;Quote: SD3 trust management computes answer and verified proof together; only certified evaluator in trusted computing base; e.g., a secure name service
107 ;;Quote: SD3 extends datalog by associating names with authenticated public keys, e.g., T(x,y):-K$E(x,y) holds if E(x,y) and relation E under keyholder of K
107 ;;Quote: SD3 names may be tied to an IP address; e.g., (K@A)$E(x,y) is relation E at A under public key K; remote evaluator returns E(x,y) as a certificate signed by its private key
107 ;;Quote: use one public key K to distribute many keys via chains of trust; K controls key-address pairs for verifying an edge relation
109 ;;Quote: secure DNS resolver in 10 lines of code; easier to understand than BIND's security policy
111 ;;Quote: certified evaluation via a proof checker for lists of facts, security rules, and derivations; 100 lines of code


Related Topics up

ThesaHelp: references i-l (342 items)
Topic: proof-carrying code (7 items)
Group: security   (23 topics, 802 quotes)
Topic: constructing proof and program together (22 items)
Topic: type-safe and secure languages (42 items)
Topic: logic programming (34 items)
Topic: theorem proving systems (20 items)
Topic: digital signature (23 items)
Topic: key distribution (33 items)
Topic: formal methods and languages (53 items)
Topic: abstraction in programming (67 items)
Topic: understanding systems (48 items)
Group: program proving   (10 topics, 310 quotes)
Topic: consistency testing (60 items)
Topic: program proving is infeasible (46 items)

Collected barberCB 12/03
Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.