NDLI: Practical unconditionally secure two-channel message authentication

Content Provider	Springer Nature Link
Author	Stinson, Douglas R. Mashatan, Atefeh
Copyright Year	2009
Abstract	We investigate unconditional security for message authentication protocols that are designed using two-channel cryptography. (Two-channel cryptography employs a broadband, insecure wireless channel and an authenticated, narrow-band manual channel at the same time.) We study both noninteractive message authentication protocols (NIMAPs) and interactive message authentication protocols (IMAPs) in this setting. First, we provide a new proof of nonexistence of nontrivial unconditionally secure NIMAPs. This proof consists of a combinatorial counting argument and is much shorter than the previous proof by Wang and Safavi-Naini, which was based on probability distribution arguments. We also prove a new result which holds in a weakened attack model. Further, we propose a generalization of an unconditionally secure 3-round IMAP due to Naor, Segev and Smith. The IMAP is based on two ϵ-Δ universal hash families. With a careful choice of parameters, our scheme improves that of Naor et al. Our scheme is very close to optimal for most parameter situations of practical interest. Finally, a variation of the 3-round IMAP is presented, in which only one hash family is required.
Ending Page	188
Page Count	20
Starting Page	169
File Format	PDF
ISSN	09251022
e-ISSN	15737586
Journal	Designs, Codes and Cryptography
Issue Number	2-3
Volume Number	55
Language	English
Publisher	Springer US
Publisher Date	2010-01-03
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Information and Communication, Circuits Unconditional security Data Structures, Cryptology and Information Theory Discrete Mathematics in Computer Science Authentication Data Encryption Coding and Information Theory Authentication and secret sharing Combinatorics Two-channel cryptography
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Discrete Mathematics and Combinatorics Theoretical Computer Science Computer Science Applications

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

A case study in almost-perfect security for unconditionally secure communication

A geometric protocol for cryptography with cards

Cheating in Visual Cryptography

Sharing Multiple Secrets: Models, Schemes and Analysis

On the optimization of bipartite secret sharing schemes

New results and applications for multi-secret sharing schemes

Authentication Schemes from Highly Nonlinear Functions

Anonymity in shared symmetric key primitives

Generalized oblivious transfer by secret sharing

Practical unconditionally secure two-channel message authentication

Similar Documents

A case study in almost-perfect security for unconditionally secure communication

A geometric protocol for cryptography with cards

Cheating in Visual Cryptography

Sharing Multiple Secrets: Models, Schemes and Analysis

On the optimization of bipartite secret sharing schemes

New results and applications for multi-secret sharing schemes

Authentication Schemes from Highly Nonlinear Functions

Anonymity in shared symmetric key primitives

Generalized oblivious transfer by secret sharing

Practical unconditionally secure two-channel message authentication