Results 31 to 40 of about 120 (52)

Searchable encryption with randomized ciphertext and randomized keyword search

Journal of Mathematical Cryptology
The notion of public-key encryption with keyword search (PEKS) was introduced to search over encrypted data without performing any decryption. In this article, we propose a PEKS scheme in which both the encrypted keyword and the trapdoor are randomized ...
Calderini Marco, Longo Riccardo, Sala Massimiliano, Villa Irene   +3 more
doaj   +1 more source

Universal secure rank-metric coding schemes with optimal communication overheads

, 2017
We study the problem of reducing the communication overhead from a noisy wire-tap channel or storage system where data is encoded as a matrix, when more columns (or their linear combinations) are available.
Martínez-Peñas, Umberto
core   +1 more source

Infinite Secret Sharing -- Examples [PDF]

, 2012
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 ...
Csirmaz, László, Dibert, Alexander
core   +1 more source

Collision Times in Multicolor Urn Models and Sequential Graph Coloring With Applications to Discrete Logarithms [PDF]

, 2016
Consider an urn model where at each step one of $q$ colors is sampled according to some probability distribution and a ball of that color is placed in an urn. The distribution of assigning balls to urns may depend on the color of the ball.
Bhattacharya, Bhaswar B.
core   +2 more sources

Smaller public keys for MinRank-based schemes

Journal of Mathematical Cryptology
MinRank is an NP-complete problem in linear algebra whose characteristics make it attractive to build post-quantum cryptographic primitives. Several MinRank-based digital signature schemes have been proposed.
Di Scala Antonio J., Sanna Carlo
doaj   +1 more source

Efficiency of SIDH-based signatures (yes, SIDH)

Journal of Mathematical Cryptology
In this note, we assess the efficiency of a supersingular isogeny Diffie-Hellman (SIDH)-based digital signature built on a weaker variant of a recent identification protocol proposed by Basso et al.
Ghantous Wissam, Pintore Federico, Veroni Mattia   +2 more
doaj   +1 more source

Stream cipher based on quasigroup string transformations in $Z_p^*$

, 2004
In this paper we design a stream cipher that uses the algebraic structure of the multiplicative group $\bbbz_p^*$ (where p is a big prime number used in ElGamal algorithm), by defining a quasigroup of order $p-1$ and by doing quasigroup string ...
Gligoroski, Danilo
core   +1 more source

Compartmented Threshold RSA Based on the Chinese Remainder Theorem [PDF]

, 2008
In this paper we combine the compartmented secret sharing schemes based on the Chinese remainder theorem with the RSA scheme in order to obtain, as a novelty, a dedicated solution for compartmented threshold decryption or compartmented threshold digital ...
Manuela Grindei, Sorin Iftene, Stefan Ciobaca   +2 more
core  

How to share secrets simultaneously [PDF]

, 2011
Each member of a team consisting of $n$ person has a secret. The $k$ out of $n$ simultaneous threshold secret sharing requires that any group of $k$ members should be able to recover the secret of the other $n-k$ members, while any group of $k-1$ or less
Laszlo Csirmaz
core  

Using shifted conjugacy in braid-based cryptography

, 2006
Conjugacy is not the only possible primitive for designing braid-based protocols. To illustrate this principle, we describe a Fiat--Shamir-style authentication protocol that be can be implemented using any binary operation that satisfies the left self ...
Dehornoy, Patrick
core   +1 more source