Building Usable Witness Encryption

12/08/2021
by   Gavin Uberti, et al.
0

Witness encryption using multilinear maps was first proposed in 2013, and has continued to evolve since. In this paper, we build on an open-source multilinear map implementation by Carmer and Malozemoff of the graded encoding scheme CLT13 with asymmetric modifications. Using this map, we created the world's first ciphertext encoded with a candidate witness encryption scheme. Finally, using a reduction from Sudoku to Exact Cover, we encrypted the private key to a Bitcoin wallet with 22,700 Satoshi using a Sudoku.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/16/2021

An analogue of the ElGamal scheme based on the Markovski algorithm

We give an analogue of the ElGamal encryption system based on the Markov...
research
08/17/2018

Confidential Encrypted Data Hiding and Retrieval Using QR Authentication System

Now, security and authenticity of data is a big challenge. To solve this...
research
12/11/2018

Secure and Private Implementation of Dynamic Controllers Using Semi-Homomorphic Encryption

This paper presents a secure and private implementation of linear time-i...
research
08/16/2022

A New Scheme for Image Compression and Encryption Using ECIES, Henon Map, and AEGAN

Providing security in the transmission of images and other multimedia da...
research
01/28/2023

An Unbounded Fully Homomorphic Encryption Scheme Based on Ideal Lattices and Chinese Remainder Theorem

We propose an unbounded fully homomorphic encryption scheme, i.e. a sche...
research
09/06/2020

Efficiency Improvements for Encrypt-to-Self

Recent work by Pijnenburg and Poettering (ESORICS'20) explores the novel...
research
03/30/2023

ACM with Overlapping Partitions: Implementation and Periodicity Analysis

The Arnold Cat Map (ACM) is a popular chaotic map used in image encrypti...

Please sign up or login with your details

Forgot password? Click here to reset