Algebraic blinding and cryptographic trilinear maps

02/18/2020
by   Ming-Deh A. Huang, et al.
0

It has been shown recently that cryptographic trilinear maps are sufficient for achieving indistinguishability obfuscation. In this paper we develop algebraic blinding techniques for constructing such maps. An earlier approach involving Weil restriction can be regarded as a special case of blinding in our framework. However, the techniques developed in this paper are more general, more robust, and easier to analyze. We demonstrate this approach in the construction of trilinear maps based on elliptic curves.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/19/2019

Weil descent and cryptographic trilinear maps

It has recently been shown that cryptographic trilinear maps are suffici...
research
07/09/2018

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

We describe a framework for constructing an efficient non-interactive ke...
research
10/08/2018

Trilinear maps for cryptography II

We continue to study the construction of cryptographic trilinear maps in...
research
11/07/2020

Constructing Cryptographic Multilinear Maps Using Affine Automorphisms

The point of this paper is to use affine automorphisms from algebraic ge...
research
03/27/2018

Trilinear maps for cryptography

We construct cryptographic trilinear maps that involve simple, non-ordin...
research
08/27/2021

Pairing for Greenhorn: Survey and Future Perspective

Pairing is the most powerful tool in cryptography that maps two points o...
research
12/10/2021

Algebraic Properties of Subquasigroups and Construction of Cryptographically Suitable Finite Quasigroups

In this paper, we identify many important properties and develop criteri...

Please sign up or login with your details

Forgot password? Click here to reset