Search
Search Results
-
New NTRU Records with Improved Lattice Bases
The original NTRU cryptosystem from 1998 can be considered the starting point of the great success story of lattice-based cryptography. Modern NTRU...
-
Attack on lattice shortest vector problem using K-Nearest Neighbour
Lattice-based cryptography is now the most effective and adaptable branch of post-quantum cryptography. The prime number factoring assumption or the...
-
The irreducible vectors of a lattice:
The main idea behind lattice sieving algorithms is to reduce a sufficiently large number of lattice vectors with each other so that a set of short...
-
Neighborhood based concept lattice
With the expansion of database, the complexity of concept lattices grows rapidly. Therefore, the compression of formal concepts becomes particularly...
-
Monometrics on Lattice Betweenness Using Fuzzy Implications
In the recent past, monometrics w.r.t. a ternary relation defined on a set, called the betweenness relation, have garnered a lot of attention for...
-
Lattice-Based Programmable Hash Functions and Applications
Driven by the open problem raised by Hofheinz and Kiltz (J Cryptol 25(3):484–527, 2012), we study the formalization of lattice-based programmable...
-
-
Revisiting Lattice Tiling Decomposition and Dithered Quantisation
A lattice tiling decomposition induces dual operations: quantisation and wrap**, which map the Euclidean space to the lattice and to one of its...
-
Logarithmic-Size (Linkable) Ring Signatures from Lattice Isomorphism Problems
The Lattice Isomorphism Problem (LIP) asks whether two given lattices are isomorphic via an orthogonal linear transformation. At Eurocrypt 2022,...
-
Verification of NP-Hardness Reduction Functions for Exact Lattice Problems
This paper describes the formal verification of NP-hardness reduction functions of two key problems relevant in algebraic lattice theory: the closest...
-
Algorithms for Extracting Non-lattice Substructures
One of the desirable properties of the resulting graph structure is that the subsumption relationship (is-a hierarchy) should form a lattice [81]....
-
Syntactic Concept Lattice Models for Infinitary Action Logic
We introduce models for infinitary action logic, i.e., the infinitary extension of multiplicative-additive Lambek calculus with the Kleene star, on...
-
Multiscale modeling of functionally graded shell lattice metamaterials for additive manufacturing
In this work, an experimentally validated multiscale modeling framework for additively manufactured shell lattice structures with graded parameters...
-
Threshold Raccoon: Practical Threshold Signatures from Standard Lattice Assumptions
Threshold signatures improve both availability and security of digital signatures by splitting the signing key into N shares handed out to different...
-
Lattice point of view for argumentation framework
The main purpose of this article is to develop a lattice point of view for the study of argumentation framework extensions. We first characterize...
-
Existence of Large Sublattices Isomorphic to Boolean Algebra in a Candidate Lattice
Abstract—Algebraic machine learning has emerged as a way to overcome the need to generate a (potentially exponential) lattice of all candidates (as,...
-
Brief Announcement: Fully Lattice Linear Algorithms
This paper focuses on analyzing and differentiating between lattice linear problems and lattice linear algorithms. It introduces a new class of...
-
A New Revocable Attribute Based Encryption on Lattice
In this paper we propose a new Lattice-based Revocable Attribute Based Encryption (RL-ABE) scheme in the cloud. We use Ciphertext-Policy Attribute...
-
Fast Practical Lattice Reduction Through Iterated Compression
We introduce a new lattice basis reduction algorithm with approximation guarantees analogous to the LLL algorithm and practical performance that far...