Results 1 to 10 of about 120 (52)
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
Message Randomization and Strong Security in Quantum Stabilizer-Based Secret Sharing for Classical Secrets [PDF]
, 2020 We improve the flexibility in designing access structures of quantum stabilizer-based secret sharing schemes for classical secrets, by introducing message randomization in their encoding procedures.
Matsumoto, Ryutaroh
core +2 more sources
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
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
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
On Burst Error Correction and Storage Security of Noisy Data [PDF]
, 2011 Secure storage of noisy data for authentication purposes usually involves the use of error correcting codes. We propose a new model scenario involving burst errors and present for that several constructions.Comment: to be presented at MTNS ...
Fontein, Felix +4 more
core +2 more sources
Generalized threshold secret sharing and finite geometry [PDF]
, 2021 In the history of secret sharing schemes many constructions are based on geometric objects. In this paper we investigate generalizations of threshold schemes and related finite geometric structures.
Ligeti, Peter +2 more
core +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
Quantum Strongly Secure Ramp Secret Sharing [PDF]
, 2014 Quantum secret sharing is a scheme for encoding a quantum state (the secret) into multiple shares and distributing them among several participants. If a sufficient number of shares are put together, then the secret can be fully reconstructed.
Matsumoto, Ryutaroh, Zhang, Paul
core +2 more sources