{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T23:10:22Z","timestamp":1740525022312,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232087"},{"type":"electronic","value":"9783540301448"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30144-8_25","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T00:34:45Z","timestamp":1284856485000},"page":"292-303","source":"Crossref","is-referenced-by-count":3,"title":["Certificate Recommendations to Improve the Robustness of Web of Trust"],"prefix":"10.1007","author":[{"given":"Qinglin","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Douglas S.","family":"Reeves","sequence":"additional","affiliation":[]},{"given":"Peng","family":"Ning","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","volume-title":"Network flows : theory, algorithms, and applications","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs (1993)"},{"key":"25_CR2","first-page":"14","volume-title":"Proc. 11th IEEE Computer Security Foundations Workshop","author":"T. Aura","year":"1998","unstructured":"Aura, T.: On the structure of delegation networks. In: Proc. 11th IEEE Computer Security Foundations Workshop, Rockport, MA, June 1998, pp. 14\u201326. IEEE Computer Society Press, Los Alamitos (1998)"},{"issue":"2-3","key":"25_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0166-218X(02)00570-X","volume":"129","author":"A.A. Bencz\u00far Pushdown-reduce","year":"2003","unstructured":"Bencz\u00far Pushdown-reduce, A.A.: an algorithm for connectivity augmentation and poset covering problems. Discrete Applied Mathematics\u00a0129(2-3), 233\u2013262 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR4","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":"25_CR5","unstructured":"Blaze, M., Feigenbaum, J., Lacy, J.: Decentralized trust management. In: Proceedings of the 1996 IEEE Symposium on Security and Privacy, May 6-8, pp. 164\u2013173. Oakland, CA,USA (1996)"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/844102.844108","volume-title":"Proceedings of the 2002 workshop on New security paradigms","author":"S. Capkun","year":"2002","unstructured":"Capkun, S., Butty\u00e1n, L., Hubaux, J.-P.: Small worlds in security systems: an analysis of the pgp certificate graph. In: Proceedings of the 2002 workshop on New security paradigms, pp. 28\u201335. ACM Press, New York (2002)"},{"issue":"1","key":"25_CR7","first-page":"59","volume":"12","author":"D. Darnell","year":"1999","unstructured":"Darnell, D.: Pgp or pki? the future of internet security. EDI Forum: The Journal of Electronic Commerce\u00a012(1), 59\u201362 (1999)","journal-title":"EDI Forum: The Journal of Electronic Commerce"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Ellison, C., Frantz, B., Lampson, B., Rivest, R., Thomas, B., Ylonen, T.: RFC 2693: SPKI certificate theory (September 1999)","DOI":"10.17487\/rfc2693"},{"key":"25_CR9","first-page":"34","volume":"1994","author":"A. Frank","year":"1994","unstructured":"Frank, A.: Connectivity augmentation problems in network design. Mathematical Programming: State of the Art\u00a01994, 34\u201363 (1994)","journal-title":"Mathematical Programming: State of the Art"},{"issue":"1","key":"25_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jctb.1995.1044","volume":"65","author":"A. Frank","year":"1995","unstructured":"Frank, A., Jordan, T.: Minimal edge-coverings of pairs of sets. Journal of Combinatorial Theory, Series B\u00a065(1), 73\u2013110 (1995)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"3","key":"25_CR11","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s101070050038","volume":"84","author":"A. Frank","year":"1999","unstructured":"Frank, A., Jordan, T.: Directed vertex-connectivity augmentation. Mathematical Programming\u00a084(3), 537\u2013553 (1999)","journal-title":"Mathematical Programming"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Harary, F.: Graph Theory. Addison-Wesley, Reading (1969)","DOI":"10.21236\/AD0705364"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Jiang, Q., Reeves, D.S., Ning, P.: Certificate recommendations to improve robustness of webs of trust. Technical Report TR-2004-04, Department of Computer Science, N.C. State University (January 2004)","DOI":"10.1007\/978-3-540-30144-8_25"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-24660-2_16","volume-title":"Topics in Cryptology \u2013 CT-RSA 2004","author":"Q. Jiang","year":"2004","unstructured":"Jiang, Q., Reeves, D.S., Ning, P.: Improving robustness of PGP by conflict detection. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol.\u00a02964, pp. 194\u2013207. Springer, Heidelberg (2004)"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1145\/335305.335325","volume-title":"Proceedings of the thirty-second annual ACM symposium on Theory of computing","author":"J. Kleinberg","year":"2000","unstructured":"Kleinberg, J.: The small-world phenomenon: an algorithm perspective. In: Proceedings of the thirty-second annual ACM symposium on Theory of computing, pp. 163\u2013170. ACM Press, New York (2000)"},{"key":"25_CR16","unstructured":"Levien, R., Aiken, A.: Attack-resistant trust metrics for public key certification. In: Proceedings of the Seventh USENIX Security Symposium (1998)"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/3-540-68339-9","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., Bertino, E. (eds.) ESORICS 1996. LNCS, vol.\u00a01146, pp. 324\u2013350. Springer, Heidelberg (1996)"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Mendes, S., Huitema, C.: A new approach to the X.509 framework: Allowing a global authentication infrastructure without a global trust model. In: Proceedings of the Symposium on Network and Distributed System Security, San Diego, CA, USA, February 1995, pp. 172\u2013189 (1995)","DOI":"10.1109\/NDSS.1995.390635"},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Grotschel","year":"1981","unstructured":"Grotschel, M., Lovasz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica\u00a01, 169\u2013197 (1981)","journal-title":"Combinatorica"},{"issue":"1-3","key":"25_CR20","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0166-218X(01)00349-3","volume":"123","author":"H. Nagamochi","year":"2002","unstructured":"Nagamochi, H., Ibaraki, T.: Graph connectivity and its augmentation: applications of ma orderings. Discrete Appl. Math.\u00a0123(1-3), 447\u2013472 (2002)","journal-title":"Discrete Appl. Math."},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Reiter, M., Stubblebine, S.: Toward acceptable metrics of authentication. In: IEEE Symposium on Security and Privacy, pp. 10\u201320 (1997)","DOI":"10.1109\/SECPRI.1997.601308"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Reiter, M., Stubblebine, S.: Resilient authentication using path independence. IEEE Transactions on Computers\u00a047(12) (December 1998)","DOI":"10.1109\/12.737682"},{"key":"25_CR23","unstructured":"Drew Streib, M.: Keyanalyze - analysis of a large OpenPGP ring., http:\/\/www.dtype.org\/keyanalyze\/"},{"key":"25_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BFb0013898","volume-title":"Computer Security - ESORICS 92","author":"A. Tarah","year":"1992","unstructured":"Tarah, A., Huitema, C.: Associating metrics to certification paths. In: Deswarte, Y., Quisquater, J.-J., Eizenberg, G. (eds.) ESORICS 1992. LNCS, vol.\u00a0648, pp. 175\u2013189. Springer, Heidelberg (1992)"},{"key":"25_CR25","unstructured":"Int\u2019l Telecommunications Union\/ITU Telegraph & Tel. ITU-T recommendation X.509: The directory: Public-key and attribute certificate frameworks (March 2000)"},{"key":"25_CR26","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D. Watts","year":"1998","unstructured":"Watts, D., Strogatz, S.: Collective dynamics of small-world networks. Nature\u00a0393, 440 (1998)","journal-title":"Nature"},{"key":"25_CR27","unstructured":"Zimmermann, P.: The official PGP user\u2019s guide. MIT Press, Cambridge (1995)"}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30144-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T22:37:30Z","timestamp":1740523050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30144-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232087","9783540301448"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30144-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}