scholarly journals A New Construction of Multisender Authentication Codes from Pseudosymplectic Geometry over Finite Fields

2013 ◽  
Vol 2013 ◽  
pp. 1-10
Author(s):  
Xiuli Wang
Keyword(s):  
Finite Fields ◽  
Authentication Codes ◽  
Authentication Code ◽  
New Construction

Multisender authentication codes allow a group of senders to construct an authenticated message for one receiver such that the receiver can verify authenticity of the received message. In this paper, we construct one multisender authentication code from pseudosymplectic geometry over finite fields. The parameters and the probabilities of deceptions of this code are also computed.

scholarly journals A New Construction of Multisender Authentication Codes from Polynomials over Finite Fields

2013 ◽  
Vol 2013 ◽  
pp. 1-7
Author(s):  
Xiuli Wang
Keyword(s):  
Finite Fields ◽  
Authentication Codes ◽  
Authentication Code ◽  
Polynomials Over Finite Fields ◽  
New Construction

Multisender authentication codes allow a group of senders to construct an authenticated message for a receiver such that the receiver can verify the authenticity of the received message. In this paper, we construct one multisender authentication code from polynomials over finite fields. Some parameters and the probabilities of deceptions of this code are also computed.

scholarly journals Some New Constructions of Authentication Codes with Arbitration and Multi-Receiver from Singular Symplectic Geometry

2011 ◽  
Vol 2011 ◽  
pp. 1-18
Author(s):  
You Gao ◽  
Huafeng Yu
Keyword(s):  
Probability Distribution ◽  
Finite Fields ◽  
Symplectic Geometry ◽  
Authentication Codes ◽  
Uniform Probability ◽  
Different Types ◽  
Uniform Probability Distribution ◽  
New Construction

A new construction of authentication codes with arbitration and multireceiver from singular symplectic geometry over finite fields is given. The parameters are computed. Assuming that the encoding rules are chosen according to a uniform probability distribution, the probabilities of success for different types of deception are also computed.

Construction of Multi-receiver Multi-fold Authentication Codes from Singular Symplectic Geometry over Finite Fields

2013 ◽  
Vol 20 (04) ◽  
pp. 701-710 ◽  
Author(s):  
Shangdi Chen ◽  
Dawei Zhao
Keyword(s):  
Finite Fields ◽  
Symplectic Geometry ◽  
Key Distribution ◽  
Authentication Codes ◽  
Authentication Code ◽  
Message Transmission ◽  
Basic Model ◽  
Distribution Phase

As an extension of the basic model of MRA-codes, multi-receiver multi-fold authentication codes can use a single key distribution phase for multiple message transmission. A multi-receiver multi-fold authentication code is constructed from the singular symplectic geometry over finite fields in this paper. The parameters and probabilities of success in impersonation and substitution attacks by malicious groups of receivers of this code are computed.

scholarly journals Efficient Secret Image Sharing Scheme with Authentication and Cheating Prevention

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Lina Zhang ◽  
Xuan Dang ◽  
Li Feng ◽  
Junhan Yang
Keyword(s):  
Distributed Storage ◽  
Limited Resources ◽  
Secret Image Sharing ◽  
Authentication Codes ◽  
Authentication Code ◽  
Secret Image ◽  
Image Sharing ◽  
Sharing Scheme ◽  
Hash Algorithm ◽  
Security Levels

Due to the widespread adoption and popularity of digital images in distributed storage, Secret Image Sharing (SIS) has attracted much attention. However, preventing the cheating of shares is an important problem that needs to be solved in the traditional SIS scheme. An adversary without image shares may participate in the restoration phase as a share owner. In this phase, the adversary can obtain real shares or prevent recovering real images by submitting fake shadows. Our schemes are based on the original Thien-Lin’s scheme. In the scheme I, we use some XOR operations to get two authentication codes through all secret pixel values to achieve a lightweight and fast-calculated authentication scheme for cheating prevention. This scheme is suitable for small devices with limited resources. In scheme II, we use a hash algorithm to generate the authentication code. This scheme is suitable for environments with larger storage space and higher security levels. Since all pixel values are involved in the authentication in our proposed schemes, it can prevent fake shadow images from cheating. Meanwhile, the shadow size is almost the same as the original Thien-Lin’s scheme. Experimental results and theoretical analysis show that the proposed schemes are feasible and effective.

Power trace functions over finite fields

2019 ◽  
Vol 19 (10) ◽  
pp. 2050196
Author(s):  
Robert W. Fitzgerald ◽  
Yasanthi Kottegoda
Keyword(s):  
Finite Fields ◽  
Trace Function ◽  
Authentication Code ◽  
Number Of Solutions ◽  
Successful Attack

We count the number of solutions to a power trace function equal to a constant and use this to find the probability of a successful attack on an authentication code proposed by Ding et al. (2005) [C. Ding, A. Salomaa, P. Solé and X. Tian, Three constructions of authentication/secrecy codes, J. Pure Appl. Algebra 196 (2005) 149–168].

scholarly journals A Construction of Multisender Authentication Codes with Sequential Model from Symplectic Geometry over Finite Fields

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Shangdi Chen ◽  
Chunli Yang
Keyword(s):  
Finite Fields ◽  
Symplectic Geometry ◽  
Authentication Codes ◽  
Sequential Model

Multisender authentication codes allow a group of senders to construct an authenticated message for a receiver such that the receiver can verify authenticity of the received message. In this paper, we construct multisender authentication codes with sequential model from symplectic geometry over finite fields, and the parameters and the maximum probabilities of deceptions are also calculated.

Sign in / Sign up

Export Citation Format

Share Document