메뉴 건너뛰기




Volumn 5536 LNCS, Issue , 2009, Pages 292-305

Homomorphic MACs: MAC-based integrity for network coding

Author keywords

[No Author keywords available]

Indexed keywords

CODED SYSTEM; EN-ROUTE; IN-NETWORK; INTERMEDIATE NODE; MALICIOUS NODES; NETWORK CODING; POLLUTION ATTACK; SIGNATURE SCHEME;

EID: 68849097857     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01957-9_18     Document Type: Conference Paper
Times cited : (210)

References (17)
  • 2
    • 0242334165 scopus 로고    scopus 로고
    • An algebraic approach to network coding
    • Koetter, R.: An algebraic approach to network coding. IEEE/ACM Transactions on Networking 11, 782-795 (2003)
    • (2003) IEEE/ACM Transactions on Networking , vol.11 , pp. 782-795
    • Koetter, R.1
  • 4
    • 68849117052 scopus 로고    scopus 로고
    • Signing a linear subspace: Signature schemes for network coding
    • Boneh, D., Freeman, D., Katz, J., Waters, B.: Signing a linear subspace: Signature schemes for network coding. In: Proc. of PKC 2009 (2009)
    • (2009) Proc. of PKC
    • Boneh, D.1    Freeman, D.2    Katz, J.3    Waters, B.4
  • 7
    • 44049100993 scopus 로고    scopus 로고
    • Signatures for network coding
    • to appear in International Journal of Information and Coding Theory
    • Charles, D., Jain, K., Lauter, K.: Signatures for network coding. In: CISS 2006 (2006); to appear in International Journal of Information and Coding Theory
    • (2006) CISS
    • Charles, D.1    Jain, K.2    Lauter, K.3
  • 9
    • 25644448947 scopus 로고    scopus 로고
    • Network coding for large scale content distribution
    • Gkantsidis, C., Rodriguez, P.: Network coding for large scale content distribution. In: Proc. of IEEE INFOCOM 2005, pp. 2235-2245 (2005)
    • (2005) Proc. of IEEE INFOCOM , pp. 2235-2245
    • Gkantsidis, C.1    Rodriguez, P.2
  • 15
    • 58349118819 scopus 로고    scopus 로고
    • Compact proofs of retrievability
    • Pieprzyk, J, ed, Asiacrypt 2008, Springer, Heidelberg
    • Shacham, H., Waters, B.: Compact proofs of retrievability. In: Pieprzyk, J. (ed.) Asiacrypt 2008. LNCS, vol. 5350, pp. 90-107. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.5350 , pp. 90-107
    • Shacham, H.1    Waters, B.2
  • 17
    • 84957057937 scopus 로고    scopus 로고
    • Coding constructions for blacklisting problems without computational assumptions
    • Wiener, M, ed, CRYPTO 1999, Springer, Heidelberg
    • Kumar, R., Rajagopalan, S., Sahai, A.: Coding constructions for blacklisting problems without computational assumptions. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 609-623. Springer, Heidelberg (1999)
    • (1999) LNCS , vol.1666 , pp. 609-623
    • Kumar, R.1    Rajagopalan, S.2    Sahai, A.3


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