{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T09:42:58Z","timestamp":1725615778238},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642243714"},{"type":"electronic","value":"9783642243721"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24372-1_13","type":"book-chapter","created":{"date-parts":[[2011,9,29]],"date-time":"2011-09-29T05:41:14Z","timestamp":1317274874000},"page":"168-182","source":"Crossref","is-referenced-by-count":0,"title":["Trust Metrics for the SPKI\/SDSI Authorisation Framework"],"prefix":"10.1007","author":[{"given":"Dominik","family":"Wojtczak","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1109\/TR.1986.4335422","volume":"35","author":"M.O. Ball","year":"1986","unstructured":"Ball, M.O.: Computational Complexity of Network Reliability Analysis: An Overview. IEEE Transactions on Reliability\u00a035(3), 230\u2013239 (1986)","journal-title":"IEEE Transactions on Reliability"},{"issue":"5439","key":"13_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.: Emergence of Scaling in Random Networks. Science\u00a0286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","first-page":"3","volume-title":"Computer Security - ESORICS 94","author":"T. Beth","year":"1994","unstructured":"Beth, T., Borcherding, M., Klein, B.: Valuation of Trust in Open Networks. In: Gollmann, D. (ed.) ESORICS 1994. LNCS, vol.\u00a0875, pp. 3\u201318. Springer, Heidelberg (1994)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-540-78800-3_39","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Bouajjani","year":"2008","unstructured":"Bouajjani, A., Esparza, J., Schwoon, S., Suwimonteerabuth, D.: SDSIrep: A Reputation System Based on SDSI. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 501\u2013516. Springer, Heidelberg (2008)"},{"key":"13_CR5","unstructured":"CAcert certification Authority, http:\/\/www.cacert.org\/"},{"issue":"4","key":"13_CR6","doi-asserted-by":"publisher","first-page":"285","DOI":"10.3233\/JCS-2001-9402","volume":"9","author":"D. Clarke","year":"2002","unstructured":"Clarke, D., Elien, J.-E., Ellison, C., Fredette, M., Morcos, A., Rivest, R.L.: Certificate chain discovery in SPKI\/SDSI. Journal of Computer Security\u00a09(4), 285\u2013322 (2002)","journal-title":"Journal of Computer Security"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I. Dinur","year":"2005","unstructured":"Dinur, I., Safra, S.: On the Hardness of Approximating Minimum Vertex Cover. Annals of Mathematics\u00a0162, 439\u2013485 (2005)","journal-title":"Annals of Mathematics"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Ellison, C., Frantz, B., Lampson, B., Rivest, R., Thomas, B., Ylonen, T.: RFC 2693: SPKI Certificate theory (1999)","DOI":"10.17487\/rfc2693"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford Jr.","year":"1956","unstructured":"Ford Jr., L.R., Fulkerson, D.R.: Maximial flow through a newtork. Can. J. Math.\u00a08, 399\u2013404 (1956)","journal-title":"Can. J. Math."},{"issue":"4","key":"13_CR10","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/COMST.2000.5340804","volume":"3","author":"T. Grandison","year":"2000","unstructured":"Grandison, T., Sloman, M.: A survey of trust in internet applications. IEEE Communications Surveys Tutorials\u00a03(4), 2\u201316 (2000)","journal-title":"IEEE Communications Surveys Tutorials"},{"issue":"301","key":"13_CR11","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability Inequalities for Sums of Bounded Random Variables. Journal of the American Statistical Association\u00a058(301), 13 (1963)","journal-title":"Journal of the American Statistical Association"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"317","DOI":"10.3233\/JCS-2004-123-402","volume":"12","author":"S. Jha","year":"2004","unstructured":"Jha, S., Reps, T.: Model checking SPKI \/ SDSI. Journal of Computer Security\u00a012, 317\u2013353 (2004)","journal-title":"Journal of Computer Security"},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1016\/j.dss.2005.05.019","volume":"43","author":"A. Josang","year":"2007","unstructured":"Josang, A., Ismail, R., Boyd, C.: A survey of trust and reputation systems for online service provision. Decision Support Systems\u00a043(2), 618\u2013644 (2007)","journal-title":"Decision Support Systems"},{"key":"13_CR14","unstructured":"Josang, A.: An algebra for assessing trust in certification chains. In: Proc. of the Network and Distributed Systems Security Symposium (1999)"},{"key":"13_CR15","unstructured":"Levien, R., Aiken, A.: Attack-Resistant Trust Metrics for Public Key Certification. In: Proceedings of the 7th USENIX Security, pp. 229\u2013242 (1998)"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/3-540-61770-1_45","volume-title":"Computer Security - ESORICS 96","author":"U. Maurer","year":"1996","unstructured":"Maurer, U.: Modelling a Public-Key Infrastructure. In: Martella, G., Kurth, H., Montolivo, E., Hwang, J. (eds.) ESORICS 1996. LNCS, vol.\u00a01146, pp. 325\u2013350. Springer, Heidelberg (1996)"},{"issue":"4","key":"13_CR17","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"J. Scott Provan","year":"1983","unstructured":"Scott Provan, J., Ball, M.O.: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected. SIAM Journal on Computing\u00a012(4), 777 (1983)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Raz, R., Safra, S.: A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP (1997)","DOI":"10.1145\/258533.258641"},{"issue":"2","key":"13_CR19","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1145\/317087.317088","volume":"2","author":"M.K. Reiter","year":"1999","unstructured":"Reiter, M.K., Stubblebine, S.G.: Authentication metric analysis and design. ACM Transactions on Information and System Security\u00a02(2), 138\u2013158 (1999)","journal-title":"ACM Transactions on Information and System Security"},{"key":"13_CR20","series-title":"Wiley Series in Probability and Statistics","doi-asserted-by":"publisher","DOI":"10.1002\/9780470230381","volume-title":"Simulation and the Monte Carlo Method","author":"R.Y. Rubinstein","year":"2007","unstructured":"Rubinstein, R.Y., Kroese, D.P.: Simulation and the Monte Carlo Method, 2nd edn. Wiley Series in Probability and Statistics, vol.\u00a0707. John Wiley & Sons, Chichester (2007)","edition":"2"},{"issue":"1","key":"13_CR21","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10462-004-0041-5","volume":"24","author":"J. Sabater","year":"2005","unstructured":"Sabater, J., Sierra, C.: Review on Computational Trust and Reputation Models. Artificial Intelligence Review\u00a024(1), 33\u201360 (2005)","journal-title":"Artificial Intelligence Review"},{"issue":"3","key":"13_CR22","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The Complexity of Enumeration and Reliability Problems. SIAM Journal on Computing\u00a08(3), 410 (1979)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"13_CR23","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.2000.2894","volume":"164","author":"I. Walukiewicz","year":"2001","unstructured":"Walukiewicz, I.: Pushdown Processes: Games and Model-Checking. Information and Computation\u00a0164(2), 234\u2013263 (2001)","journal-title":"Information and Computation"},{"key":"13_CR24","volume-title":"The Official PGP User\u2019s Guide","author":"P.R. Zimmermann","year":"1995","unstructured":"Zimmermann, P.R.: The Official PGP User\u2019s Guide. MIT Press, Cambridge (1995)"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24372-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T14:28:00Z","timestamp":1560695280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24372-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642243714","9783642243721"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24372-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}