We present a lattice-based stateless signature scheme provably secure in the standard model. Our scheme has a constant number of matrices in the public key and a single lattice vector (plus a tag) in the signatures. The best previous lattice-based encryption schemes were the scheme of Ducas and Micciancio (CRYPTO 2014), which required a logarithmic number of matrices in the public key and that ...

We examine the security of several digital signature schemes based on algebraic block codes. It is shown that Xinmei’s digital signature scheme cau be totally broken by a known plaintext attack with complexity O(k3), where t is the dimension of the code used in the scheme. Harn and Wang have proposed a modified version of Xinmei’s scheme that prevents selective forgeries. Their scheme is also s...

Despite the growing growth of technology, handwritten signature has been selected as the first option between biometrics by users. In this paper, a new methodology for offline handwritten signature verification and recognition based on the Shearlet transform and transfer learning is proposed. Since, a large percentage of handwritten signatures are composed of curves and the performance of a sig...

We study the selfadjoint extensions of the spatial part of the D'Alembert operator in a spacetime with two changes of signature. We identify a set of boundary conditions, parametrised by U (2) matrices, which correspond to Dirichlet boundary conditions for the fields, and from which we argue against the suggestion that regions of signature change can isolate singularities.

The signatures of the inner product matrices on a Lie algebra’s highest weight representation are encoded in the representation’s signature character. We show that the signature characters of a finitedimensional Lie algebra’s highest weight representations obey simple difference equations that have a unique solution once appropriate boundary conditions are imposed. We use these results to deriv...

We study the network-wide neighbour discovery problem in wireless networks in which each node in a network must discovery the network interface addresses (NIAs) of its neighbour. We work within the rapid on-off division duplex framework proposed by Guo and Zhang in [5] in which all nodes are assigned different on-off signatures which allow them listen to the transmissions of neighbouring nodes ...

The Welch lower bound on the total-squared-correlation (TSC) of binary signature sets is loose for binary signature sets whose length L is not a multiple of 4. Recently Karystinos and Pados developed new bounds that are better than the Welch bound in those cases, and showed how to achieve the bounds with modiied Hadamard matrices except in a couple of cases. In this paper, we study the open cases.

A recursive method for constructing uniquely decodable codes for overloaded synchronous CDMA systems, Where large signature codes With groWing overloading factors are reconstructed from the small ones. A class of uniquely decod able signature matrices (or encoders) for overloaded synchro nous CDMA are also devised. A decoder for synchronous CDMA systems to extract the user data by a number of c...

This paper describes a new method for authentication and integrity where the ciphertext is obtained using block upper triangular matrices with elements in p Z , in which the discrete logarithm problem (DLP) defined over a finite group is used. In the proposed public key cryptosystem, the encryption requires very few operations and decryption is equivalent to the DLP and, finally, the signature ...