Results 121 to 130 of about 177,134 (147)
TESLA-Based Homomorphic MAC for Authentication in P2P System for Live Streaming with Network Coding
IEEE Journal on Selected Areas in Communications, 2013 Recently, the peer-to-peer (P2P) live streaming system has benefited from the advent of network coding. However, it was demonstrated that malicious nodes could significantly reduce the network throughput by launching pollution attacks or entropy attacks.
Chi Cheng, Qian Zhang, Tao Jiang
exaly +4 more sources
Practical Homomorphic MACs for Arithmetic Circuits [PDF]
Lecture Notes in Computer Science, 2013 Homomorphic message authenticators allow the holder of a (public) evaluation key to perform computations over previously authenticated data, in such a way that the produced tag σ can be used to certify the authenticity of the computation. More precisely, a user knowing the secret key sk used to authenticate the original data, can verify that σ ...
Dario Fiore, Dario Catalano
exaly +4 more sources
Generalizing Homomorphic MACs for Arithmetic Circuits [PDF]
Lecture Notes in Computer Science, 2014 Homomorphic MACs, introduced by Gennaro and Wichs in 2013, allow anyone to validate computations on authenticated data without knowledge of the secret key.Moreover, the secret-key owner can verify the validity of the computation without needing to know the original authenticated inputs.
Dario Fiore +2 more
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A Novel Homomorphic MAC Scheme for Authentication in Network Coding
IEEE Communications Letters, 2011Recently, homomorphic message authentication code (MAC) schemes have been proposed to thwart pollution attacks in network coding. However, existing schemes adopt the inner product operation to construct the MAC, which could be broken with probability Pr=1/q, where the predetermined system parameter q is typically set as 28. Usually, the homomorphic MAC
Chi Cheng, Tao Jiang
exaly +2 more sources
Homomorphic Subspace MAC Scheme for Secure Network Coding [PDF]
ETRI Journal, 2013 Existing symmetric cryptography-based solutions against pollution attacks for network coding systems suffer various drawbacks, such as highly complicated key distribution and vulnerable security against collusion. This letter presents a novel homomorphic subspace message authentication code (MAC) scheme that can thwart pollution attacks in an efficient
Guangjun Liu, Xiao Wang
exaly +3 more sources
An Efficient Homomorphic MAC with Small Key Size for Authentication in Network Coding
IEEE Transactions on Computers, 2013Recently, homomorphic message authentication code (MAC) schemes have been proposed to resist against pollution attacks in network coding. However, existing methods face a common challenge: the generated MAC t belongs to a small finite field Fq, which means that an adversary could attack by randomly guessing the value of t, and succeed with probability ...
Chi Cheng, Tao Jiang
exaly +3 more sources
Privacy-Preserving Homomorphic MACs with Efficient Verification
Lecture Notes in Computer Science, 2018Homomorphic Message Authentication Code (MAC) allows a user to outsource data to an untrusted server and verify that results of computation on the data returned by the server are correct. Recently, much effort has been independently focused on whether a homomorphic MAC scheme supports data confidentiality or the authenticators can be efficiently ...
Shimin Li, Xin Wang, Rui Zhang 0016
exaly +2 more sources
Two improved homomorphic MAC schemes in network coding
2015 12th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD), 2015Network coding provides the advantage of maximizing the usage of network resources, but the natural properties of network coding also make the pollution attack more threatening. Much work on resisting pollution attacks is through homomorphic MACs. But majority have same security parameter 1/q. In this paper, we present two ways to construct homomorphic
Fang-Wei Fu
exaly +2 more sources
Generalized homomorphic MACs with efficient verification
Proceedings of the 2nd ACM workshop on ASIA public-key cryptography, 2014Homomorphic MACs allow the holder of a secret key to construct authenticators for data blocks such that an untrusted server that computes a function of the data, can also compute an authenticator that can be verified by the key holder, guaranteeing correctness of the computation.
Liang Feng Zhang
exaly +2 more sources
Comments on “An Efficient Homomorphic MAC with Small Key Size for Authentication in Network Coding”
IEEE Transactions on Computers, 2015Recently, an efficient homomorphic MAC scheme for authentication in network coding is proposed and it is claimed that it achieves a security parameter $1/q^l$ where $l$ is selected according to different security requirements. However, in this paper, we show that there is an attack to make the security parameter $1/q$ instead of
Young-Sik Kim
exaly +2 more sources