[PDF] Top 20 New multilinear maps from ideal lattices
Has 10000 "New multilinear maps from ideal lattices" found on our website. Below are the top 20 most common "New multilinear maps from ideal lattices".
New multilinear maps from ideal lattices
... suffered from the weak discrete logarithm attack presented by authors themselves ...procedure from [GGH13a] is replaced by a quadratic (or higher-degree) ... See full document
20
New Constructions of Revocable Identity-Based Encryption from Multilinear Maps
... parameters from O(N + λ ) to O(log N + λ ) group elements by using the BWZ-PKBE scheme [12], which has short public ...a new direction to build an efficient RIBE scheme and its ... See full document
40
Efficient Key-policy Attribute-based Encryption for General Boolean Circuits from Multilinear Maps
... leveled multilinear maps [6] or on the LWE problem [7, ...a new KP-ABE scheme based on a very particular and simple form of leveled multilinear maps, called chained multilinear ... See full document
19
CONSTRUCTION OF NESTED REAL IDEAL LATTICES FOR INTERFERENCE CHANNEL CODING
... real lattices constructed through extension fields to develop a new methodology to perform a real-valued channel quantiza- tion in order to realize interference alignment (IA) [1] onto a real ideal ... See full document
30
Compact Attribute-Based Encryption and Signcryption for General Circuits from Multilinear Maps
... on lattices, while others [GGH + 13b], [GGHZ14], [Att14] employ multilinear map [GGH13a], [CLT13], ...the multilinear map-based scheme of [BGG + 14]), the number of ciphertext components proliferates ... See full document
25
Security Analysis of Multilinear Maps over the Integers
... Abstract. At Crypto 2013, Coron, Lepoint, and Tibouchi (CLT) proposed a practical Graded Encod- ing Scheme (GES) over the integers, which has very similar cryptographic features to ideal multilinear ... See full document
27
Multilinear maps via secret ring
... Garg, Gentry, and Halevi (GGH13) described the first candidate construction of multilinear maps from ideal lattices [16]. Following the framework of GGH13, Coron, Lepoint, and Tibouchi ... See full document
18
Zeroizing without zeroes: Cryptanalyzing multilinear maps without encodings of zero
... [GGH13a] Sanjam Garg, Craig Gentry, and Shai Halevi. Candidate multilinear maps from ideal lattices. In Thomas Johansson and Phong Q. Nguyen, editors, Advances in Cryptology - EUROCRYPT ... See full document
9
Immunizing Multilinear Maps Against Zeroizing Attacks
... The new re-randomization procedure invoked by ...distribution from the procedure ...the new setup procedure for public-encoding (Section 4.3.1), we choose new randomizer lattices ...our ... See full document
36
Two-message Key Exchange with Strong Security from Ideal Lattices
... Generic TMKE Scheme. Our construction is similar to the KF scheme (see Figure 1), but in our new KEM based TMKE construction, we need two kinds of KEM. The first KEM is required to satisfy IND-CPA and ... See full document
26
Cryptanalysis of Two Candidate Fixes of Multilinear Maps over the Integers
... Now, level-0 encodings can be turned in level-k encodings for any k 6 κ using (powers of) a public level-1 encoding y of 1 = (1, . . . , 1) ∈ R. Without loss of generality and for simplicity, we assume k = 1 as in ... See full document
6
Attribute-Based Encryption for Circuits from Multilinear Maps
... Using ideal lattices they produced a candidate mechanism that would approximate or be the moral equivalent of multilinear maps for many ...study new constructions using a ... See full document
24
Strongly Secure Authenticated Key Exchange from Ideal Lattices
... The traditional KE protocols include: KE based on discrete logarithm problems, KE based on RSA problems, KE based on key encapsulation mechanism (KEM), AKE based on bilinear pairings, and KE based on signature or MAC, ... See full document
25
Implementing Candidate Graded Encoding Schemes from Ideal Lattices
... Abstract. Multilinear maps have become popular tools for designing cryptographic schemes since a first approximate realisation candidate was proposed by Garg, Gentry and Halevi ...approximate ... See full document
23
Cryptanalysis of Gu's ideal multilinear map
... Multilinear maps are a very powerful tool in ...etc. Multilinear maps were first introduced by Boneh and Silverberg in 2003 ...candidate multilinear map for enabling promising ... See full document
6
General Circuit Realizing Compact Revocable Attribute-Based Encryption from Multilinear Maps
... employing multilinear map [GGH13a], [CLT13], [CLT15], we have adopted a new technique [BGW05], [BWZ14] for enforcing direct user revocation in the context of ... See full document
23
Sieving for Shortest Vectors in Ideal Lattices: a Practical Perspective
... algorithm from a practical point of ...ideas from both Milde and Schneider [41] and Ishiguro et ...deviate from [41] how sampled and reduced vectors are ...sample new vectors and collect ... See full document
20
On the Equivalence of Obfuscation and Multilinear Maps
... conclude from our results that constructions of iO must be based on candidates for multilinear ...a new method for constructing iO without multilinear maps is found, this method would ... See full document
19
Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness
... The seed for a ∆RG consists of one public and two private components, and perturbation- resilience is required even when the adversary has access to the public component of the seed. Furthermore, the use of cubic (as ... See full document
108
Cryptanalysis of GGH15 Multilinear Maps
... Multilinear maps. For the past couple of years, cryptographic multilinear maps have found numerous applications in the design of cryptographic protocols, the most salient example of which is ... See full document
33
Related subjects