NDLI: A construction of t-fold perfect splitting authentication codes with equal deception probabilities

Please wait, while we are loading the content...

Cryptography and Communications : Volume 9

Cryptography and Communications : Volume 8

Cryptography and Communications : Volume 7

Cryptography and Communications : Volume 7, Issue 4, December 2015

Cryptography and Communications : Volume 7, Issue 3, September 2015

Cryptography and Communications : Volume 7, Issue 2, June 2015

A construction of t-fold perfect splitting authentication codes with equal deception probabilities

The Walsh transform of a class of monomial functions and cyclic codes

Repeated-root constacyclic codes of length ℓ $^{ t }$ p $^{ s }$ and their dual codes

Cryptographically significant MDS matrices based on circulant and circulant-like matrices for lightweight applications

Cryptography and Communications : Volume 7, Issue 1, March 2015

Cryptography and Communications : Volume 6

Cryptography and Communications : Volume 5

Cryptography and Communications : Volume 4

Cryptography and Communications : Volume 3

Cryptography and Communications : Volume 2

Cryptography and Communications : Volume 1

A construction of t-fold perfect splitting authentication codes with equal deception probabilities

Content Provider	Springer Nature Link
Author	Li, Mingchao Liang, Miao Du, Beiliang
Copyright Year	2014
Abstract	Orthogonal multi-arrays were first formulated by Brickell in investigation of authentication codes. In this article, we will prove that t-fold perfect splitting authentication codes with equal deception probabilities can be characterized in terms of orthogonal multi-arrays. We will also investigate the existence of orthogonal multi-arrays, and show that the existence of orthogonal multi-arrays OMA (t,k×c,n)s is equivalent to the existence of transversal splitting t-designs splitting TD (t,k×c,n)s. Further, we obtain some new infinite classes of t-fold perfect splitting authentication codes with equal deception probabilities.
Starting Page	207
Ending Page	215
Page Count	9
File Format	PDF
ISSN	19362447
Journal	Cryptography and Communications
Volume Number	7
Issue Number	2
e-ISSN	19362455
Language	English
Publisher	Springer US
Publisher Date	2014-09-12
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	t-fold perfect splitting authentication code Orthogonal multi-array Transversal splitting t-design Orthogonal arrays, Latin squares, Room squares Authentication and secret sharing Data Structures, Cryptology and Information Theory Coding and Information Theory Communications Engineering, Networks Information and Communication, Circuits Mathematics of Computing
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Computer Networks and Communications Computational Theory and Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Some new classes of 2-fold optimal or perfect splitting authentication codes

A new class of 3-fold perfect splitting authentication codes

Cheating-immune secret sharing schemes from codes and cumulative arrays

A Latin square autotopism secret sharing scheme

A construction for t-fold perfect authentication codes with arbitration

Secret sharing schemes based on graphical codes

Bounds and constructions for $${\overline{3}}$$ -separable codes with length 3

A novel application on mutually orthogonal graph squares and graph-orthogonal arrays

Indivisible plexes in latin squares

A construction of t-fold perfect splitting authentication codes with equal deception probabilities

Similar Documents

Some new classes of 2-fold optimal or perfect splitting authentication codes

A new class of 3-fold perfect splitting authentication codes

Cheating-immune secret sharing schemes from codes and cumulative arrays

A Latin square autotopism secret sharing scheme

A construction for t-fold perfect authentication codes with arbitration

Secret sharing schemes based on graphical codes

Bounds and constructions for $${\overline{3}}$$ -separable codes with length 3

A novel application on mutually orthogonal graph squares and graph-orthogonal arrays

Indivisible plexes in latin squares

A construction of t-fold perfect splitting authentication codes with equal deception probabilities