Results 11 to 20 of about 81 (63)
New approach to practical leakage-resilient public-key cryptography
Journal of Mathematical Cryptology, 2020 We present a new approach to construct several leakage-resilient cryptographic primitives, including leakage-resilient public-key encryption (PKE) schemes, authenticated key exchange (AKE) protocols and low-latency key exchange (LLKE) protocols.
Chakraborty Suvradip +2 more
doaj +1 more source
Towards a Ring Analogue of the Leftover Hash Lemma
Journal of Mathematical Cryptology, 2020 The leftover hash lemma (LHL) is used in the analysis of various lattice-based cryptosystems, such as the Regev and Dual-Regev encryption schemes as well as their leakage-resilient counterparts. The LHL does not hold in the ring setting, when the ring is
Dachman-Soled Dana +3 more
doaj +1 more source
Another look at normal approximations in cryptanalysis
Journal of Mathematical Cryptology, 2016 Statistical analysis of attacks on symmetric ciphers often requires assuming the normal behaviour of a test statistic. Typically such an assumption is made in an asymptotic sense.
Samajder Subhabrata, Sarkar Palash
doaj +1 more source
(In)Security of Ring-LWE Under Partial Key Exposure
Journal of Mathematical Cryptology, 2020 We initiate the study of partial key exposure in Ring-LWE (RLWE)-based cryptosystems. Specifically, we (1) Introduce the search and decision Leaky R-LWE assumptions (Leaky R-SLWE, Leaky R-DLWE), to formalize the hardness of search/decision RLWE under ...
Dachman-Soled Dana +3 more
doaj +1 more source
Security analysis of Modified Rivest Scheme
Journal of Mathematical Cryptology, 2014 The Modified Rivest Scheme (MRS) is an additive homomorphic scheme recently used in many applications which demands third party processing of encrypted data. The present study carries out a comprehensive security analysis of MRS.
Haridas Deepthi +2 more
doaj +1 more source
Journal of Mathematical Cryptology, 2018 In this paper, we construct some cartesian authentication codes from geometries over finite commutative rings. We only assume the uniform probability distribution over the set of encoding rules in order to be able to compute the probabilities of ...
Jirakitpuwapat Wachirapong +4 more
doaj +1 more source
Dynamic-FROST: Schnorr threshold signatures with a flexible committee
Journal of Mathematical CryptologyThreshold signatures enable any subgroup of predefined cardinality tt out of a committee of nn participants to generate a valid, aggregated signature.
Cimatti Annalisa +7 more
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
mRLWE-CP-ABE: A revocable CP-ABE for post-quantum cryptography
Journal of Mathematical CryptologyWe address the problem of user fast revocation in the lattice-based Ciphertext Policy Attribute-Based Encryption (CP-ABE) by extending the scheme originally introduced by Zhang and Zhang [Zhang J, Zhang Z.
Cianfriglia Marco +2 more
doaj +1 more source
Signcryption schemes with insider security in an ideal permutation model
Journal of Mathematical Cryptology, 2019 Signcryption aims to provide both confidentiality and authentication of messages more efficiently than performing encryption and signing independently. The “Commit-then-Sign & Encrypt” (CtS&E) method allows to perform encryption and signing in parallel ...
Bansal Tarun Kumar +2 more
doaj +1 more source