Towards automatic verification of authentication protocols on an unbounded network

Background & Objective: Cryptographic protocols had been evident method for ensuring con dentiality, Integrity and authentication in various digital communication systems. However the validation and analysis of such cryptographic protocols was limited to usage of formal mathematical models until few years back. Methods: In this paper, various popular cryptographic protocols have been studied. Some of these protocols (PAP, CHAP, and EAP) achieve security goals in peer to peer communication while others (RADIUS, DIAMETER and Kerberos) can work in multiparty environment. These protocols were validated and analysed over two popular security validation and analysis tools AVISPA and Scyther. The protocols were written according to their documentation using the HLPSL and SPDL for analysis over AVISPA and Scyther respectively. The results of these tools were analysed to nd the possible attack an each protocol. Afterwards The execution time analysis of the protocols were done by repeating the experiment for multiple iterations over the command line versions of these tools.As the literature review suggested, this research also validates that using password based protocols (PAP) is faster in terms of execution time as compared to other methods, Usage of nonces tackles the replay attack and DIAMETER is secure than RADIUS. Results and Conclusion: The results also showed us that DIAMETER is faster than RADIUS. Though Kerberos protocol was found to safe, the results tell us that it is compromisable under particular circumstances.

Download Full-text

An Improved Fuzzy Vector Signature with Reusability

Applied Sciences ◽

10.3390/app10207141 ◽

2020 ◽

Vol 10 (20) ◽

pp. 7141

Author(s):

Ilhwan Lim ◽

Minhye Seo ◽

Dong Hoon Lee ◽

Jong Hwan Park

Keyword(s):

Sampling Method ◽

Performance Comparison ◽

Error Rates ◽

Efficiency Improvement ◽

Fuzzy Extractor ◽

Authentication Protocols ◽

Biometric Data ◽

Single User ◽

Helper Data ◽

Fuzzy Vector

Fuzzy vector signature (FVS) is a new primitive where a fuzzy (biometric) data w is used to generate a verification key (VKw), and, later, a distinct fuzzy (biometric) data w′ (as well as a message) is used to generate a signature (σw′). The primary feature of FVS is that the signature (σw′) can be verified under the verification key (VKw) only if w is close to w′ in a certain predefined distance. Recently, Seo et al. proposed an FVS scheme that was constructed (loosely) using a subset-based sampling method to reduce the size of helper data. However, their construction fails to provide the reusability property that requires that no adversary gains the information on fuzzy (biometric) data even if multiple verification keys and relevant signatures of a single user, which are all generated with correlated fuzzy (biometric) data, are exposed to the adversary. In this paper, we propose an improved FVS scheme which is proven to be reusable with respect to arbitrary correlated fuzzy (biometric) inputs. Our efficiency improvement is achieved by strictly applying the subset-based sampling method used before to build a fuzzy extractor by Canetti et al. and by slightly modifying the structure of the verification key. Our FVS scheme can still tolerate sub-linear error rates of input sources and also reduce the signing cost of a user by about half of the original FVS scheme. Finally, we present authentication protocols based on fuzzy extractor and FVS scheme and give performance comparison between them in terms of computation and transmission costs.

Download Full-text

Remote Quantum-Safe Authentication of Entities with Physical Unclonable Functions

Photonics ◽

10.3390/photonics8070289 ◽

2021 ◽

Vol 8 (7) ◽

pp. 289

Author(s):

Georgios M. Nikolopoulos

Keyword(s):

Authentication Protocol ◽

Authentication Protocols ◽

Photonic Networks ◽

Physical Unclonable Functions ◽

Quantum Protocols ◽

Open Question ◽

Standard Techniques

Physical unclonable functions have been shown to be a useful resource of randomness for implementing various cryptographic tasks including entity authentication. All the related entity authentication protocols that have been discussed in the literature so far, either they are vulnerable to an emulation attack, or they are limited to short distances. Hence, quantum-safe remote entity authentication over large distances remains an open question. In the first part of this work, we discuss the requirements that an entity authentication protocol has to offer, to be useful for remote entity authentication in practice. Subsequently, we propose a protocol, which can operate over large distances, and offers security against both classical and quantum adversaries. The proposed protocol relies on standard techniques, it is fully compatible with the infrastructure of existing and future photonic networks, and it can operate in parallel with other quantum protocols, including QKD protocols.

Download Full-text

Verification of Outstanding Claim Provisions—Separation Technique

Astin Bulletin ◽

10.1017/s0515036100011351 ◽

1977 ◽

Vol 9 (1-2) ◽

pp. 26-32 ◽

Cited By ~ 1

Author(s):

R. E. Beard

Keyword(s):

Distribution Function ◽

Automatic Verification ◽

Separation Technique ◽

Implicit Assumption ◽

Subjective Judgment ◽

Constant Rate ◽

The Future ◽

Average Distribution ◽

Chain Ladder ◽

A Chain

In reference [1] Dr. G. C. Taylor has described a useful advance in the techniques available for verification of outstanding claims estimates when the data provided is the cohort development of numbers and amounts of claims. In this note it is assumed that the numbers relate to settled claims and that the amounts relate to claim payments, so there is an implicit assumption that the pattern of partial payments is constant. If the amounts of settled claims were to be used, there would be a one/one relationship between the numbers and amounts, but the effect of the exogeneous factor would be blurred because the settlements in a year other than the first include partial payments made some time previously, and, by hypothesis, based on different factors. If information relating to partial payments is available the data can be examined for any major fluctuation in the pattern and allowance made accordingly.In paragraph (2) of reference [1] a brief description is given of a standard routine calculation in which the average distribution function of claim payments in time is estimated from the triangle of payments by a chain ladder technique. This distribution function is then used to estimate the expected development of the incomplete cohorts, the implicit assumption being made that the function was stable in time. With a constant rate of inflation the results obtained by this technique were found to be satisfactory but with a rapid increase in the rate of inflation the distribution function changed so that projection led to underestimates of the future claims payments. Various methods of adjusting the projections to allow for the change in the rate of inflation have been investigated, but they all involve an important element of subjective judgment and so far no generally suitable basis for “automatic” verification by this particular technique has been discovered. See however reference [2].

Download Full-text

Automatic Verification of GCD Constraint for Construction of Girth-Eight QC-LDPC Codes

IEEE Communications Letters ◽

10.1109/lcomm.2019.2925792 ◽

2019 ◽

Vol 23 (9) ◽

pp. 1453-1456

Author(s):

Guohua Zhang ◽

Yi Fang ◽

Yuanhua Liu

Keyword(s):

Ldpc Codes ◽

Automatic Verification

Download Full-text