Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
On-line/off-line digital signatures
CRYPTO '89 Proceedings on Advances in cryptology
End-to-end internet packet dynamics
IEEE/ACM Transactions on Networking (TON)
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
Cryptography: Theory and Practice
Cryptography: Theory and Practice
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Fundamentals of Computer Security
Fundamentals of Computer Security
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Authenticating Multicast Streams in Lossy Channels Using Threshold Techniques
ICN '01 Proceedings of the First International Conference on Networking-Part 2
Efficient multicast stream authentication using erasure codes
ACM Transactions on Information and System Security (TISSEC)
Efficient Multicast Packet Authentication Using Signature Amortization
SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
Secure Broadcast Communication in Wired and Wireless Networks
Secure Broadcast Communication in Wired and Wireless Networks
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: Winning Thesis of the 2002 ACM Doctoral Dissertation Competition (Lecture Notes in Computer Science)
How to authenticate real time streams using improved online/offline signatures
CANS'05 Proceedings of the 4th international conference on Cryptology and Network Security
Finding collisions in the full SHA-1
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
How to break MD5 and other hash functions
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
VSH, an efficient and provable collision-resistant hash function
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Efficient multicast stream authentication for the fully adversarial network model
WISA'05 Proceedings of the 6th international conference on Information Security Applications
A taxonomy of multicast data origin authentication: Issues and solutions
IEEE Communications Surveys & Tutorials
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
Combining prediction hashing and MDS codes for efficient multicast stream authentication
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
An hybrid approach for efficient multicast stream authentication over unsecured channels
ProvSec'07 Proceedings of the 1st international conference on Provable security
Wireless telemedicine and m-health: technologies, applications and research issues
International Journal of Sensor Networks
VECoS'10 Proceedings of the Fourth international conference on Verification and Evaluation of Computer and Communication Systems
Security and Communication Networks
A review of GENI authentication and access control mechanisms
International Journal of Security and Networks
| Hi-index | 0.00 |
We consider the stream authentication problem when an adversary has the ability to drop, reorder or inject data in the network. We propose a coding approach for multicast stream authentication using the list-decoding property of Reed-Solomon codes. We divide the data to be authenticated into a stream of packets and associate a single trapdoor hash collision for every λn packets where λ and n are predesignated parameters. Our scheme, which is also joinable at the boundary of any n-packet block, can be viewed as an extension of Lysyanskaya, Tamassia and Triandopoulos's technique in which λ = 1. We show that by choosing λ and n appropriately, our scheme outperforms theirs in time spent for processing data at the sender and receiver. Our approach relies on the dispersion process as SAIDA and eSAIDA. Assuming that we use RSA for signing and SHA-256 for hashing, we give an approximation of the proportion of extra packets per block which could be processed via our technique with respect to the previous scheme. As example when we process λ = 1000 blocks of 2650 64-byte-packets, the gain of our scheme with respect to Lysyanskaya et al.'s is about 30%.