Results 1 to 10 of about 31 (26)
Access structures determined by uniform polymatroids
Journal of Mathematical Cryptology, 2023 In this article, all multipartite access structures obtained from uniform integer polymatroids were investigated using the method developed by Farràs, Martí-Farré, and Padró. They are matroid ports, i.e., they satisfy the necessary condition to be ideal.
Kawa Renata, Kula Mieczysław
doaj +1 more source
On the equivalence of authentication codes and robust (2, 2)-threshold schemes
Journal of Mathematical Cryptology, 2020 In this paper, we show a “direct” equivalence between certain authentication codes and robust threshold schemes. It was previously known that authentication codes and robust threshold schemes are closely related to similar types of designs, but direct ...
Paterson Maura B., Stinson Douglas R.
doaj +1 more source
The mF mode of authenticated encryption with associated data
Journal of Mathematical Cryptology, 2022 In recent years, the demand for lightweight cryptographic protocols has grown immensely. To fulfill this necessity, the National Institute of Standards and Technology (NIST) has initiated a standardization process for lightweight cryptographic encryption.
Chakraborty Bishwajit, Nandi Mridul
doaj +1 more source
Journal of Mathematical Cryptology, 2020 At ProvSec 2013, Minematsu presented the circulant hash, an almost-xor universal hash using only the xor and rotation operations. The circulant hash is a variant of Carter and Wegman’s H3 hash as well as Krawczyk’s Toeplitz hash, both of which are hashes
Araujo Filipe, Neves Samuel
doaj +1 more source
Infinite secret sharing – Examples
Journal of Mathematical Cryptology, 2014 The motivation for extending secret sharing schemes to cases when either the set of players is infinite or the domain from which the secret and/or the shares are drawn is infinite or both, is similar to the case when switching to abstract probability ...
Dibert Alexander, Csirmaz László
doaj +1 more source
Journal of Mathematical Cryptology, 2020 Secret sharing is an important building block in cryptography. All explicit secret sharing schemes which are known to have optimal complexity are multi-linear, thus are closely related to linear codes.
Csirmaz Laszlo
doaj +1 more source
Towards efficient private distributed computation on unbounded input streams
Journal of Mathematical Cryptology, 2015 In the problem of private “swarm” computing, n agents wish to securely and distributively perform a computation on common inputs, in such a way that even if the entire memory contents of some of them are exposed, no information is revealed about the ...
Dolev Shlomi +4 more
doaj +1 more source
Persistent asymmetric password-based key exchange
Journal of Mathematical Cryptology, 2014 Asymmetric password based key exchange is a key exchange protocol where a client and a server share a low entropic password while the server additionally owns a high entropic secret with respect to a public key. There are simple solutions for this, e.g.,
Jiang Shaoquan
doaj +1 more source
Context-Aware Access Control Model for Privacy Support in Mobile-Based Assisted Living
Journal of Intelligent Systems, 2015 The average lifetime of people in advanced countries is significantly increased in the XXI century. The number of old and dependent people is rising due many innovations in health care: new technologies, medicine, and a lot of innovative devices that ...
Smirnov Alexander +3 more
doaj +1 more source
A survey and refinement of repairable threshold schemes
Journal of Mathematical Cryptology, 2018 We consider repairable threshold schemes (RTSs), which are threshold schemes that enable a player to securely reconstruct a lost share with help from their peers.
Laing Thalia M., Stinson Douglas R.
doaj +1 more source