Results 11 to 20 of about 26 (26)
Journal of Mathematical Cryptology, 2018 In this paper, we construct some cartesian authentication codes from geometries over finite commutative rings. We only assume the uniform probability distribution over the set of encoding rules in order to be able to compute the probabilities of ...
Jirakitpuwapat Wachirapong +4 more
doaj +1 more source
On the optimality of non-linear computations for symmetric key primitives
Journal of Mathematical Cryptology, 2018 A block is an n-bit string, and a (possibly keyed) block-function is a non-linear mapping that maps one block to another, e.g., a block-cipher. In this paper, we consider various symmetric key primitives with ℓ{\ell} block inputs and raise the following ...
Chakraborti Avik +2 more
doaj +1 more source
Dynamic-FROST: Schnorr threshold signatures with a flexible committee
Journal of Mathematical CryptologyThreshold signatures enable any subgroup of predefined cardinality tt out of a committee of nn participants to generate a valid, aggregated signature.
Cimatti Annalisa +7 more
doaj +1 more source
Signcryption schemes with insider security in an ideal permutation model
Journal of Mathematical Cryptology, 2019 Signcryption aims to provide both confidentiality and authentication of messages more efficiently than performing encryption and signing independently. The “Commit-then-Sign & Encrypt” (CtS&E) method allows to perform encryption and signing in parallel ...
Bansal Tarun Kumar +2 more
doaj +1 more source
A fundamental flaw in the ++AE authenticated encryption mode
Journal of Mathematical Cryptology, 2018 In this article, we analyse a block cipher mode of operation for authenticated encryption known as ++AE (plus-plus-AE). We show that this mode has a fundamental flaw: the scheme does not verify the most significant bit of any block in the plaintext ...
Qahur Al Mahri Hassan +4 more
doaj +1 more source
Journal of Mathematical Cryptology, 2018 Composite order pairing setting has been used to achieve cryptographic functionalities beyond what is attainable in prime order groups. However, such pairings are known to be significantly slower than their prime order counterparts.
Chatterjee Sanjit +2 more
doaj +1 more source
A secure anonymous proxy signcryption scheme
Journal of Mathematical Cryptology, 2017 We introduce a new cryptographic primitive identity-based anonymous proxy signcryption which provides anonymity to the proxy sender while also providing a mechanism to the original sender to expose the identity of the proxy sender in case of misuse.
Saraswat Vishal +2 more
doaj +1 more source
Rigorous upper bounds on data complexities of block cipher cryptanalysis
Journal of Mathematical Cryptology, 2017 Statistical analysis of symmetric key attacks aims to obtain an expression for the data complexity which is the number of plaintext-ciphertext pairs needed to achieve the parameters of the attack. Existing statistical analyses invariably use some kind of
Samajder Subhabrata, Sarkar Palash
doaj +1 more source
mRLWE-CP-ABE: A revocable CP-ABE for post-quantum cryptography
Journal of Mathematical CryptologyWe address the problem of user fast revocation in the lattice-based Ciphertext Policy Attribute-Based Encryption (CP-ABE) by extending the scheme originally introduced by Zhang and Zhang [Zhang J, Zhang Z.
Cianfriglia Marco +2 more
doaj +1 more source
Differential experiments using parallel alternative operations
Journal of Mathematical CryptologyThe use of alternative operations in differential cryptanalysis, or alternative notions of differentials, is lately receiving increasing attention. Recently, Civino et al.
Calderini Marco +2 more
doaj +1 more source