[PDF] Top 20 Candidate Multilinear Maps from Ideal Lattices
Has 10000 "Candidate Multilinear Maps from Ideal Lattices" found on our website. Below are the top 20 most common "Candidate Multilinear Maps from Ideal Lattices".
Candidate Multilinear Maps from Ideal Lattices
... pal ideal lattices (Section ...principal ideal lattices (compared to general ideal lattices) to preserve ...Principal ideal lattices cer- tainly arise in our scheme ... See full document
57
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 - ... See full document
9
Sieving for Shortest Vectors in Ideal Lattices: a Practical Perspective
... Since the late 1990s, there has been increasing interest in constructing cryptographic functions with security based on the computational hardness of lattice problems, initiated by works such as [2, 3, 26]. Lattice-based ... See full document
20
Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation From Degree-5 Multilinear Maps
... Our assumptions do not require any low-level encodings of 0 to be given to the adversary, and we thus believe them to be instantiable using existing candidate multilinear maps. Indeed, because of ... See full document
58
Security Analysis of Multilinear Maps over the Integers
... cryptographic multilinear maps by gen- eralizing cryptographic bilinear ...construct multilinear maps sat- isfying cryptographic ...first candidate multilinear maps, ... See full document
27
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
Identity-Based Key-Encapsulation Mechanism from Multilinear Maps
... In this paper we present an IB-KEM construction based on groups with a multilin- ear map [13]. We present our IB-KEM in a generic “leveled” multilinear map setting and prove its security in the selective-ID model. ... See full document
10
Cryptanalysis of GGH15 Multilinear Maps
... Classical and quantum security. The parameters of GGH13 were chosen heuristically so that computing (classically and quantumly) the discrete-log of an encoding should be hard. In particular it is easy to see that g has ... See full document
33
Implementing Candidate Graded Encoding Schemes from Ideal Lattices
... Table 1. Computing a κ-level asymmetric multilinear maps with our implementation without encodings of zero. Column λ gives the minimum security level we accepted, column λ 1 gives the actually expected ... See full document
23
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 ...a multilinear map ... See full document
24
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 ...no candidate multilinear map for enabling promising ... See full document
6
On the Equivalence of Obfuscation and Multilinear Maps
... the candidate construction of indistinguishability obfuscation (iO) [BGI + 01] of Garg et ...upon Multilinear Jigsaw Puzzles, a variant of multilinear maps ...of multilinear maps ... See full document
19
Multilinear maps via secret ring
... Abstract. Garg, Gentry and Halevi (GGH13) described the first candi- date multilinear maps using ideal lattices. However, Hu and Jia recently presented an efficient attack on the GGH13 map, ... See full document
18
Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness
... mathematical candidate iO construction, and since then several additional candidates have been proposed and studied [GGH13a, CLT13, GGH15, CLT15, Hal15, BR14, BGK + 14, PST14, AGIS14], [BMSZ16, CHL + 15, BWZ14, ... See full document
108
Compact Attribute-Based Encryption and Signcryption for General Circuits from Multilinear Maps
... recently candidate constructions of ABE were limited to restricted class of decryption policies, namely, polynomial-size Boolean formulas or circuits with fan-out one [GPSW06], ... See full document
25
New Constructions of Revocable Identity-Based Encryption from Multilinear Maps
... Identity-Based Encryption and Its Extensions. IBE, introduced by Shamir [37], can solve the key man- agement problem of PKE since it uses an identity string as a public key instead of using a random value. The first IBE ... See full document
40
Immunizing Multilinear Maps Against Zeroizing Attacks
... Remark 4.6 (Updating the Secret-Encoding Operation). Technically, the public-encoding exten- sion we have just described also requires a minor change to the original secret-encoding procedure, for the following reason. ... See full document
36
Graph-Induced Multilinear Maps from Lattices
... begin from some variant of homomorphic encryption and use public-key encryption as the encoding ...(graded) multilinear maps have expanded much further, supporting applications such as witness ... See full document
29
Ideal Multilinear Maps Based on Ideal Lattices
... of multilinear maps has been a long-standing open problem since ...bilinear maps, such as [SOK00, Jou00, BF01, Sma03], have influenced research on cryptographic multilinear maps [BS03, ... See full document
22
Multilinear Maps Using Ideal Lattices without Encodings of Zero
... of multilinear maps, which is an extension of bilinear ...bilinear maps, such as [SOK00, Jou00, BF03, Sma03] and multilinear maps [BS03, RS09, PTT10, ...different from bilinear ... See full document
28
Related subjects