Results 31 to 40 of about 2,231 (134)
A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
Journal of Mathematical Cryptology, 2019 Over the past decade, the hybrid lattice-reduction and meet-in-the middle attack (called hybrid attack) has been used to evaluate the security of many lattice-based cryptographic schemes such as NTRU, NTRU Prime, BLISS and more.
Wunderer Thomas
doaj +1 more source
Depth optimized efficient homomorphic sorting [PDF]
, 2015 We introduce a sorting scheme which is capable of efficiently sorting encrypted data without the secret key. The technique is obtained by focusing on the multiplicative depth of the sorting circuit alongside the more traditional metrics such as number of
A Chatterjee +8 more
core +1 more source
Security considerations for Galois non-dual RLWE families [PDF]
, 2017 We explore further the hardness of the non-dual discrete variant of the Ring-LWE problem for various number rings, give improved attacks for certain rings satisfying some additional assumptions, construct a new family of vulnerable Galois number fields ...
D Micciancio +13 more
core +2 more sources
A general construction for monoid-based knapsack protocols [PDF]
, 2014 We present a generalized version of the knapsack protocol proposed by D. Naccache and J. Stern at the Proceedings of Eurocrypt (1997). Our new framework will allow the construction of other knapsack protocols having similar security features.
Micheli, Giacomo, Schiavina, Michele
core +1 more source
A Survey on Homomorphic Encryption Schemes: Theory and Implementation
, 2017 Legacy encryption systems depend on sharing a key (public or private) among the peers involved in exchanging an encrypted message. However, this approach poses privacy concerns.
Acar, Abbas +3 more
core +1 more source
A Non-commutative Cryptosystem Based on Quaternion Algebras
, 2017 We propose BQTRU, a non-commutative NTRU-like cryptosystem over quaternion algebras. This cryptosystem uses bivariate polynomials as the underling ring.
Bagheri, Khadijeh +2 more
core +1 more source
Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search [PDF]
, 2013 By applying Grover's quantum search algorithm to the lattice algorithms of Micciancio and Voulgaris, Nguyen and Vidick, Wang et al., and Pujol and Stehl\'{e}, we obtain improved asymptotic quantum results for solving the shortest vector problem.
A. Ambainis +39 more
core +2 more sources
Secret Sharing for Cloud Data Security
, 2017 Cloud computing helps reduce costs, increase business agility and deploy solutions with a high return on investment for many types of applications. However, data security is of premium importance to many users and often restrains their adoption of cloud ...
Attasena, Varunya +2 more
core +1 more source
International Journal of Communication Systems, Volume 38, Issue 8, 25 May 2025.Overview of blockchain supported multisignature algorithm for IoV. ABSTRACT The Internet of Vehicles (IoV) has emerged as a promising application capable of enhancing transportation efficiency and providing a variety of mobile services to drivers. This IoV enables real‐time data sharing among vehicles and infrastructure, allowing for better traffic ...
Dushyant Kumar Yadav +3 more
wiley +1 more source
How to obtain a lattice basis from a discrete projected space [PDF]
, 2005 International audienceEuclidean spaces of dimension n are characterized in discrete spaces by the choice of lattices. The goal of this paper is to provide a simple algorithm finding a lattice onto subspaces of lower dimensions onto which these discrete ...
A. Aldroubi +6 more
core +3 more sources