메뉴 건너뛰기




Volumn 24, Issue 2, 2006, Pages 318-328

On trust models and trust evaluation metrics for ad hoc networks

Author keywords

Semiring; Trust evaluation; Trust metric; Trust model

Indexed keywords

AD HOC NETWORKS; TRUST EVALUATION; TRUST MODEL;

EID: 33144465377     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2005.861390     Document Type: Article
Times cited : (444)

References (22)
  • 1
    • 35048850522 scopus 로고    scopus 로고
    • On trust establishment in mobile ad hoc networks
    • B. Christianson, B. Crispo, J. A. Malcolm, and M. Roe, Eds. New York: Springer-Verlag, 2004, Proc. 10th Int. Security Protocols Workshop Apr.
    • L. Eschenauer, V. D. Gligor, and J. Baras, "On trust establishment in mobile ad hoc networks," in Lecture Notes in Computer Science, B. Christianson, B. Crispo, J. A. Malcolm, and M. Roe, Eds. New York: Springer-Verlag, 2004, vol. 2845, Proc. 10th Int. Security Protocols Workshop Apr. 2002, pp. 47-66.
    • (2002) Lecture Notes in Computer Science , vol.2845 , pp. 47-66
    • Eschenauer, L.1    Gligor, V.D.2    Baras, J.3
  • 3
    • 33645422445 scopus 로고    scopus 로고
    • Sprout: P2P routing with social networks
    • Stanford Univ., Stanford, CA, Jan.
    • S. Marti, P. Ganesan, and H. Garcia-Molina, "Sprout: P2P routing with social networks," Stanford Univ., Stanford, CA, Tech. Rep., Jan. 2004.
    • (2004) Tech. Rep.
    • Marti, S.1    Ganesan, P.2    Garcia-Molina, H.3
  • 4
    • 0003247337 scopus 로고    scopus 로고
    • Mobile ad hoc networking (MANET): Routing protocol performance issues and evaluation considerations
    • IETF, Jan.
    • S. Corson and J. Macker, "Mobile ad hoc networking (MANET): Routing protocol performance issues and evaluation considerations," IETF, RFC 2501, Jan. 1999.
    • (1999) RFC , vol.2501
    • Corson, S.1    Macker, J.2
  • 5
    • 0035246564 scopus 로고    scopus 로고
    • Factor graphs and the sum-product algorithm
    • Feb.
    • F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
    • (2001) IEEE Trans. Inf. Theory , vol.47 , Issue.2 , pp. 498-519
    • Kschischang, F.R.1    Frey, B.J.2    Loeliger, H.-A.3
  • 6
    • 0033907315 scopus 로고    scopus 로고
    • The generalized distributive law
    • Mar.
    • S. M. Aji and R. J. McEliece, "The generalized distributive law," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 325-343, Mar. 2000.
    • (2000) IEEE Trans. Inf. Theory , vol.46 , Issue.2 , pp. 325-343
    • Aji, S.M.1    McEliece, R.J.2
  • 8
    • 84947294004 scopus 로고    scopus 로고
    • Modeling a public-key infrastructure
    • E. Bertino, Ed. New York: Springer-Verlag, Proc. Eur. Symp. Res. Comput. Security
    • U. Maurer, "Modeling a public-key infrastructure," in Lecture Notes in Computer Science, E. Bertino, Ed. New York: Springer-Verlag, 1996, vol. 1146, Proc. Eur. Symp. Res. Comput. Security, pp. 325-350.
    • (1996) Lecture Notes in Computer Science , vol.1146 , pp. 325-350
    • Maurer, U.1
  • 9
    • 36649033444 scopus 로고    scopus 로고
    • An algebra for assessing trust in certification chains
    • [Online]. Available: cite-seer.nj.nec.com/200003.html
    • A. Jøsang, "An algebra for assessing trust in certification chains," in Proc. Netw. Distrib. Syst. Security Symp., 1999, [Online]. Available: cite-seer.nj.nec.com/200003.html.
    • (1999) Proc. Netw. Distrib. Syst. Security Symp.
    • Jøsang, A.1
  • 10
    • 85084162792 scopus 로고    scopus 로고
    • Attack-resistant trust metrics for public key certification
    • San Antonio, TX, Jan.. [Online]
    • R. Levien and A. Aiken, "Attack-resistant trust metrics for public key certification," in Proc. 7th USENIX Security Symp., San Antonio, TX, Jan. 1998, pp. 229-242. [Online]. Available: http://www.usenix.org/publications/library/proceedings/sec98/levien.htm.
    • (1998) Proc. 7th USENIX Security Symp. , pp. 229-242
    • Levien, R.1    Aiken, A.2
  • 11
    • 13244288768 scopus 로고    scopus 로고
    • Authentication metric analysis and design
    • May
    • M. K. Reiter and S. G. Stubblebine, "Authentication metric analysis and design," in ACM Trans. Inf. Syst. Secur., vol. 2, May 1999, pp. 138-158.
    • (1999) ACM Trans. Inf. Syst. Secur. , vol.2 , pp. 138-158
    • Reiter, M.K.1    Stubblebine, S.G.2
  • 13
    • 0842289235 scopus 로고    scopus 로고
    • Bootstrapping security associations for routing in mobile ad hoc networks
    • San Francisco, CA, Dec.
    • R. B. Bobba, L. Eschenauer, V. Gligor, and W. Arbaugh, "Bootstrapping security associations for routing in mobile ad hoc networks," in Proc. IEEE GLOBECOM, San Francisco, CA, Dec. 2003, pp. 1511-1515.
    • (2003) Proc. IEEE GLOBECOM , pp. 1511-1515
    • Bobba, R.B.1    Eschenauer, L.2    Gligor, V.3    Arbaugh, W.4
  • 14
    • 0034541756 scopus 로고    scopus 로고
    • Mitigating routing misbehavior in mobile ad hoc networks
    • S. Marti, T. Giuli, K. Lai, and M. Baker, "Mitigating routing misbehavior in mobile ad hoc networks," in Proc. MobiCom, 2000, pp. 255-265.
    • (2000) Proc. MobiCom , pp. 255-265
    • Marti, S.1    Giuli, T.2    Lai, K.3    Baker, M.4
  • 16
    • 84880467894 scopus 로고    scopus 로고
    • The Eigen-Trust algorithm for reputation management in p2p networks
    • May
    • S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina, "The Eigen-Trust algorithm for reputation management in p2p networks," in Proc. WWW2003, May 2003, pp. 640-651.
    • (2003) Proc. WWW2003 , pp. 640-651
    • Kamvar, S.D.1    Schlosser, M.T.2    Garcia-Molina, H.3
  • 17
    • 0005874223 scopus 로고
    • Path problems in graphs
    • [Online]
    • G. Rote, "Path problems in graphs," in Computing Supplementum, vol. 7, 1990, pp. 155-189. [Online]. Available: http://www.inf.fu-berlin.de/rote/Papers/postscript/Path+problems+in+gr%aphs.ps.
    • (1990) Computing Supplementum , vol.7 , pp. 155-189
    • Rote, G.1
  • 18
    • 85149140805 scopus 로고    scopus 로고
    • Parameter estimation for probabilistic finite-state transducers
    • Philadelphia, PA, Jul.
    • J. Eisner, "Parameter estimation for probabilistic finite-state transducers," in Proc. 40th Ann. Meeting of the Assoc. Comput. Linguistics, Philadelphia, PA, Jul. 2002, pp. 1-8.
    • (2002) Proc. 40th Ann. Meeting of the Assoc. Comput. Linguistics , pp. 1-8
    • Eisner, J.1
  • 19
    • 0141425904 scopus 로고    scopus 로고
    • Semiring frameworks and algorithms for shortest-distance problems
    • M. Mohri, "Semiring frameworks and algorithms for shortest-distance problems," J. Autom. Lang. Comb., vol. 7, no. 3, pp. 321-350, 2002.
    • (2002) J. Autom. Lang. Comb. , vol.7 , Issue.3 , pp. 321-350
    • Mohri, M.1
  • 20
    • 34147120474 scopus 로고
    • A note on two problems in connection with graphs
    • E. W. Dijkstra, "A note on two problems in connection with graphs," Numerische Mathematik, vol. 1, pp. 269-271, 1959.
    • (1959) Numerische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 21
    • 0003362481 scopus 로고
    • OSPF Version 2
    • Jul.
    • J. Moy, OSPF Version 2, RFC 2704, Jul. 1991.
    • (1991) RFC , vol.2704
    • Moy, J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.