Authentication theory/coding theory
Proceedings of CRYPTO 84 on Advances in cryptology
A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Introduction to algorithms
Multi-receiver/multi-sender network security: efficient authenticated multicast/feedback
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Distributed fingerprints and secure information dispersal
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Digital signatures for flows and multicasts
IEEE/ACM Transactions on Networking (TON)
A compact and fast hybrid signature scheme for multicast packet authentication
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Signature schemes based on the strong RSA assumption
ACM Transactions on Information and System Security (TISSEC)
Learning Polynomials with Queries: The Highly Noisy Case
SIAM Journal on Discrete Mathematics
The BiBa one-time signature and broadcast authentication protocol
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Authenticated multicast immune to denial-of-service attack
Proceedings of the 2002 ACM symposium on Applied computing
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
The Cramer-Shoup Strong-RSASignature Scheme Revisited
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Efficient multicast stream authentication using erasure codes
ACM Transactions on Information and System Security (TISSEC)
Expander Graphs for Digital Stream Authentication and Robust Overlay Networks
SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
Efficient Authentication and Signing of Multicast Streams over Lossy Channels
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Graph-Based Authentication of Digital Streams
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
List decoding of error-correcting codes
List decoding of error-correcting codes
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Improving the Robustness of Private Information Retrieval
SP '07 Proceedings of the 2007 IEEE Symposium on Security and Privacy
Optimal error correction against computationally bounded noise
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
Efficient erasure correcting codes
IEEE Transactions on Information Theory
Challenging the feasibility of authentication mechanisms for P2P live streaming
Proceedings of the 6th Latin America Networking Conference
| Hi-index | 0.00 |
We consider the problem of authenticating a stream of packets transmitted over a network controlled by an adversary who may perform arbitrary attacks on the stream: He may drop or modify chosen packets, rearrange the order of the packets in any way, and inject new, random, or specially crafted packets into the stream. In contrast, prior work on the multicast authentication problem has focused on a less powerful adversarial network model or has examined a considerably more restrictive setting with specific timing or structural assumptions about the network. We model the ability of the network to modify a stream of n packets with two parameters: the survival rate α (0 flood rate β (β ≥ 1) indicating the factor by which the size of the received stream at any particular receiver may exceed the size of the transmitted stream. Combining error-correcting codes with standard cryptographic primitives, our approach gives almost the same security guarantees as if each packet were individually signed, but requires only one signature operation for the entire stream and adds to each transmitted packet only a small amount of authentication information, proportional to β/α2. We prove the security and correctness of our scheme and analyze its performance in terms of communication overhead and computational effort at the sender and the receiver. Our results demonstrate how list decoding can be transformed into unambiguous decoding in the public-key model and the bounded computational model for the underlying communication channel. Overall, our technique provides an authenticated error-correcting code of independent interest that may be useful in other settings.