Results 21 to 30 of about 120 (52)
On the security of joint signature and encryption revisited
Journal of Mathematical Cryptology, 2016 In 2002, An et al. [1] proposed three generic conversions of signcryption, ℰt𝒮${\mathcal{E}t\mathcal{S}}$, 𝒮tℰ${\mathcal{S}t\mathcal{E}}$ and 𝒞tℰ&𝒮${\mathcal{C}t\mathcal{E}\&\mathcal{S}}$ from the primitive encryption scheme and signature scheme ...
Nandi Mridul, Pandit Tapas
doaj +1 more source
The complexity of the connected graph access structure on seven participants
Journal of Mathematical Cryptology, 2017 In this paper, we study an important problem in secret sharing that determines the exact value or bound for the complexity. First, we use the induced subgraph complexity of the graph G with access structure Γ to obtain a lower bound on the complexity of ...
Hadian Dehkordi Massoud, Safi Ali
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
Predicate signatures from pair encodings via dual system proof technique
Journal of Mathematical Cryptology, 2019 Recently, Attrapadung (Eurocrypt 2014) proposed a generic framework for fully (adaptively) secure predicate encryption (PE) based on a new primitive, called pair encodings.
Nandi Mridul, Pandit Tapas
doaj +1 more source
A generalization of the Mignotte's scheme over Euclidean domains and applications to secret image sharing [PDF]
, 2019 Secret sharing scheme is an efficient method to hide secret key or secret image by partitioning it into parts such that some predetermined subsets of partitions can recover the secret but remaining subsets cannot.
Ozbek, Ibrahim +2 more
core +2 more sources
Journal of Mathematical Cryptology, 2017 Cryptographic identification protocols enable a prover to prove its identity to a verifier. A subclass of such protocols are shared-secret challenge-response identification protocols in which the prover and the verifier share the same secret and the ...
Asghar Hassan Jameel, Kaafar Mohamed Ali
doaj +1 more source
On the representability of the biuniform matroid [PDF]
, 2013 Every biuniform matroid is representable over all sufficiently large fields. But it is not known exactly over which finite fields they are representable, and the existence of efficient methods to find a representation for every given biuniform matroid ...
Ball, Simeon Michael +3 more
core +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
Multicoloring of Graphs to Secure a Secret [PDF]
, 2018 Vertex coloring and multicoloring of graphs are a well known subject in graph theory, as well as their applications. In vertex multicoloring, each vertex is assigned some subset of a given set of colors. Here we propose a new kind of vertex multicoloring,
Vojković, Tanja +2 more
core +3 more sources
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