Results 31 to 40 of about 116 (50)

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

Cross-primitive comparison in CP-ABE

Journal of Mathematical Cryptology
Ciphertext-Policy Attribute-Based Encryption (CP-ABE) is a cornerstone technique for fine-grained access control in encrypted data sharing, with pairing-based schemes having established the de facto standard.
Gasparini Lorenzo, Onofri Elia, Palmucci Martina, Pedicini Marco   +3 more
doaj   +1 more source

Secret Sharing Schemes with a large number of players from Toric Varieties [PDF]

, 2016
A general theory for constructing linear secret sharing schemes over a finite field $\Fq$ from toric varieties is introduced. The number of players can be as large as $(q-1)^r-1$ for $r\geq 1$.
Hansen, Johan P.
core  

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

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

Maps R:Z/nZ → Z/n^2Z and some cryptographic applications [PDF]

, 2005
In his master thesis [8]，the first author has studied the RSA signatures with several types of redundancy functions. In this paper， we shall introduce these redundancy functions and investigate arithmetic properties of these redundancy functions and the ...
1028, 60466/profile-ja.html, 70194777, Katayama, Shin-ichi, Yasui, Hiroharu, カタヤマ, シンイチ, ヤスイ, ヒロハル, ヤスイ, ヒロハル, 片山, 真一   +8 more
core  

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

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

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