scispace - formally typeset
Search or ask a question
JournalISSN: 0925-1022

Designs, Codes and Cryptography 

Springer Nature
About: Designs, Codes and Cryptography is an academic journal published by Springer Nature. The journal publishes majorly in the area(s): Linear code & Computer science. It has an ISSN identifier of 0925-1022. Over the lifetime, 3050 publications have been published receiving 52538 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: A simple, efficient protocol referred to as the station-to-station (STS) protocol is introduced, examined in detail, and considered in relation to existing protocols.
Abstract: We discuss two-party mutual authentication protocols providing authenticated key exchange, focusing on those using asymmetric techniques. A simple, efficient protocol referred to as the station-to-station (STS) protocol is introduced, examined in detail, and considered in relation to existing protocols. The definition of a secure protocol is considered, and desirable characteristics of secure protocols are discussed.

1,270 citations

Journal ArticleDOI
TL;DR: The "coding theory" point of view for studying the existence of almost bent functions is developed, showing explicitly the links with cyclic codes and new characterizations are given by means of associated Boolean functions.
Abstract: Almost bent functions oppose an optimum resistance to linear and differential cryptanalysis. We present basic properties of almost bent functions; particularly we give an upper bound on the degree. We develop the "coding theory" point of view for studying the existence of almost bent functions, showing explicitly the links with cyclic codes. We also give new characterizations of almost bent functions by means of associated Boolean functions.

649 citations

Journal ArticleDOI
TL;DR: This paper proposes an efficient two-pass protocol for authenticated key agreement in the asymmetric (public-key) setting based on Diffie-Hellman key agreement and can be modified to work in an arbitrary finite group and, in particular, elliptic curve groups.
Abstract: This paper proposes an efficient two-pass protocol for authenticated key agreement in the asymmetric (public-key) setting. The protocol is based on Diffie-Hellman key agreement and can be modified to work in an arbitrary finite group and, in particular, elliptic curve groups. Two modifications of this protocol are also presented: a one-pass authenticated key agreement protocol suitable for environments where only one entity is on-line, and a three-pass protocol in which key confirmation is additionally provided. Variants of these protocols have been standardized in IEEE P1363 [17], ANSI X9.42 [2], ANSI X9.63 [4] and ISO 15496-3 [18], and are currently under consideration for standardization and by the U.S. government's National Institute for Standards and Technology [30].

559 citations

Journal ArticleDOI
TL;DR: In this paper, the authors describe a fuzzy vault, a cryptographic construction that allows a player Alice to place a secret value in a secure vault and "lock" it using a set A of elements from some public universe U. If Bob tries to "unlock" the vault using another set B of similar length, he obtains only if B is close to A, i.e., only if A and B overlap substantially.
Abstract: We describe a simple and novel cryptographic construction that we refer to as a fuzzy vault. A player Alice may place a secret value ? in a fuzzy vault and "lock" it using a set A of elements from some public universe U. If Bob tries to "unlock" the vault using a set B of similar length, he obtains ? only if B is close to A, i.e., only if A and B overlap substantially. In constrast to previous constructions of this flavor, ours possesses the useful feature of order invariance, meaning that the ordering of A and B is immaterial to the functioning of the vault. As we show, our scheme enjoys provable security against a computationally unbounded attacker. Fuzzy vaults have potential application to the problem of protecting data in a number of real-world, error-prone environments. These include systems in which personal information serves to authenticate users for, e.g., the purposes of password recovery, and also to biometric authentication systems, in which readings are inherently noisy as a result of the refractory nature of image capture and processing.

540 citations

Journal ArticleDOI
TL;DR: A general technique for the efficient computation of pairings on Jacobians of supersingular curves is presented, which is called the eta pairing, and which leads to a new algorithm which is about twice as fast as the Duursma–Lee method.
Abstract: We present a general technique for the efficient computation of pairings on Jacobians of supersingular curves. This formulation, which we call the eta pairing, generalizes results of Duursma and Lee for computing the Tate pairing on supersingular elliptic curves in characteristic 3. We then show how our general technique leads to a new algorithm which is about twice as fast as the Duursma---Lee method. These ideas are applied to elliptic and hyperelliptic curves in characteristic 2 with very efficient results. In particular, the hyperelliptic case is faster than all previously known pairing algorithms.

449 citations

Performance
Metrics
No. of papers from the Journal in previous years
YearPapers
202372
2022227
2021167
2020135
2019177
2018154