DeepAI AI Chat
Log In Sign Up

Efficient Multilinear Map from Graded Encoding Scheme

by   Majid Salimi, et al.

Though the multilinear maps have many cryptographic applications, secure and efficient construction of such maps is an open problem. Many multilinear maps like GGH, GGH15, CLT, and CLT15 have been and are being proposed, while none of them is both secure and efficient. The construction of some multilinear maps is based on the Graded Encoding Scheme (GES), where, the necessity of announcing zero-testing parameter and encoding of zero has destroyed the security of the multilinear map. Attempt is made to propose a new GES, where, instead of encoding an element, the users can obtain the encoding of an associated but unknown random element. In this new setting, there is no need to publish the encodings of zero and one. This new GES provides the actual functionality of the usual GES and can be applied in constructing a secure and efficient multilinear map and a multi-party non-interactive key exchange (MP-NIKE) scheme. We also improve the MP-NIKE scheme of <cit.> and turn it into an ID-based MP-NIKE scheme.


page 1

page 2

page 3

page 4


Full-Resilient Memory-Optimum Multi-Party Non-Interactive Key Exchange

Multi-Party Non-Interactive Key Exchange (MP-NIKE) is a fundamental cryp...

Asymptotically secure All-or-nothing Quantum Oblivious Transfer

We present a device independently secure quantum scheme for p-threshold ...

Multiparty Non-Interactive Key Exchange and More From Isogenies on Elliptic Curves

We describe a framework for constructing an efficient non-interactive ke...

The Twin Conjugacy Search Problem and Applications

We propose a new computational problem over the noncommutative group, ca...

Using Five Cards to Encode Each Integer in ℤ/6ℤ

Research in secure multi-party computation using a deck of playing cards...

New Classes of Quantum Codes Associated with Surface Maps

If the cyclic sequences of face types at all vertices in a map are the s...

Three-Pass Identification Scheme Based on MinRank Problem with Half Cheating Probability

In Asiacrypt 2001, Courtois proposed the first three-pass zero-knowledge...