• Non ci sono risultati.

In FOCS ’02: Proceedings of the 43rd Symposiumon Foundations of Computer Science, page 271

N/A
N/A
Protected

Academic year: 2021

Condividi "In FOCS ’02: Proceedings of the 43rd Symposiumon Foundations of Computer Science, page 271"

Copied!
2
0
0

Testo completo

(1)

80

Bibliografia

[1] M. Luby. Lt codes. In FOCS ’02: Proceedings of the 43rd Symposiumon Foundations of Computer Science, page 271. IEEE Computer Society, 2002.

[2] C. Karlof, N. Sastry, Y. Li, A. Perrig, and J. Tygar. Distillation codes and applications to DoS resistant multicast authentication. In Proceedings of the 11th Annual Network and Distributed Systems Security Symposium (NDSS 2004), pages 37-56, February 2004.

[3] L. Rizzo. Effective erasure codes for reliable computer communication protocols. In ACM SIGCOMM Computer communication Review, pages 24- 36, April 1997.

[4] M. O. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM, 36(2): pages 335-348, 1989.

[5] F. P. Preparata. Holographic dispersal and recovery of information. IEEE Transactions on Information Theory, 35(5): pages 1123-1124, 1989.

[6] R. Di Petro, S. Chessa, P. Maestrini. Computation, memory and bandwidth efficient distillation codes to mitigate DoS in multicast. August 2005.

[7] O. Goldreich. Foundations of cryptography: basic tools. Cambridge University press, August 2001.

[8] NIST. Secure hash standard. FIPS.PUB 180-1, Apr 1995.

[9] J.F. Kurose, K.W. Ross. Computer Networking: a top-down approach featuring the internet. Addison Wesley, second edition, 2003.

[10] A. Coccoli, A. Bondavalli, L. Simoncini. Consensus in Asynchronous

Distributed System. In IDPT '2000 5th, Int. Conference on Integrated Design and Process Technology, June 2000.

[11] C. Almeida, P. Veríssimo. Real-time communication in quasi-synchronous systems. Providing support for dynamic real-time applications. INESC, May 1996.

(2)

81

[12] A. Perrig, J. D. Tygar, D. Song, and R. Canetti. Efficient authentication and signing of multicast streams over lossy channels. In Proceedings of the 2000 IEEE Symposium onSecurity and Privacy (S&P 2000), page 56. IEEE Computer Society, 2000.

[13] S. E. Deering. Multicast routing in internetworks and extended LANs.

Computer Communiacation Review, 18(4), 1998. ACM SIGCOMM ’88 Symposium: Communications Architectures and Protocols.

[14] H. Eriksson. Mbone: the Multicast backbone. Commun. ACM, 37(8):54-60, 1994.

[15] A. Pannetrat, R. Molva. Efficient multicast packet authentication. In Proceedings of the Network and Distributed System Security Symposium (NDSS). The Internet Society, 2003.

[16] J. M. Park, E. K. P. Chong, and H. J. Siegel. Efficient multicast packet authentication using signature amortization. In Proceedings of the 2002 IEEE Symposium on Security and Privacy, page 227. IEEE Computer Society, 2002.

[17] R. Merkle. Protocols for public key cryptosystems. In Proceedings of the IEEE Symposium on Security and Privacy, pages 122–134, Oakland, California, USA, 1980.

[18] D. X. Song, J. D. Tygar, and D. Zuckerman. Expander graphs for digital stream authentication and robust overlay networks. In IEEE Symposium on Security and Privacy, pages 258–270, 2002.

[19] R. L. Rivest. The MD5 message-digest algorithm. Internet Request for Comments, April 1992. RFC 1321.

[20] A. Shamir. How to share a secret. Communications of the ACM, vol. 22, n. 11, Nov. 1979.

[21] C. Casanovi. Algoritmi per autenticazione multicast. Tesi di tirocinio A.A.

2004/05. 07 Aprile 2006.

Riferimenti

Documenti correlati

27 In the beginning of the annals of the Assyrian kings, Girra is not mentioned among the great gods, except for a little evidence in the texts of Tiglath-Pileser I (1114-1076 BC,

a computational problem expressed by a specification has solutions by a multiplicity of different algorithms, which can differ for some important properties but are all equally valid

Tondi, “The Source Identification Game: an Information Theoretic Perspective", IEEE Transactions on Information Forensics and Security, Vol. Tondi, “A Universal Attack

Available Open Access on Cadmus, European University Institute Research Repository... RSC

It is the implementation of an algorithm in a programming language, that can be executed by an autonomous machine (calculator) It can be executed several times, every time

Lipari (Scuola Superiore Sant’Anna) Fundamentals of Programming February 27, 2012 4 / 1!. Algorithms,

● Control unit (also known as CU) reads data from the instruction memory and data executes the instructions and copies the results to memory or

In spite of the loss of value of “auratic dimension” (however “deconstructed” by historians of art such as Georges Didi-Huberman), of the irretrievable philosophisation of its