Threshold and Revocation Encryptions via Threshold Trapdoor Function

04/11/2018
by   Binbin Tu, et al.
0

We introduce a cryptographic primitive named threshold trapdoor function (TTDF), from which we give generic constructions of threshold and revocation encryptions under adaptive corruption model. Then, we show TTDF can be instantiated under the decisional Diffie-Hellman (DDH) assumption and the learning with errors (LWE) assumption. By combining the instantiations of TTDF with the generic constructions, we obtain threshold and revocation encryptions which compare favorably over existing schemes. The experimental results show that our proposed schemes are practical.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/25/2018

Subadditive threshold in proof of stake system

Two subadditive threshold are proposed for proof stake systems: one is r...
research
01/03/2018

On Periodicity Lemma for Partial Words

We investigate the function L(h,p,q), called here the threshold function...
research
02/26/2016

Cortical Computation via Iterative Constructions

We study Boolean functions of an arbitrary number of input variables tha...
research
01/14/2013

Fano schemes of generic intersections and machine learning

We investigate Fano schemes of conditionally generic intersections, i.e....
research
12/27/2020

Towards Threshold Key Exchange Protocols

Threshold schemes exist for many cryptographic primitives like signature...
research
03/15/2018

Relaxed Locally Correctable Codes in Computationally Bounded Channels

Error-correcting codes that admit local decoding and correcting algorith...
research
12/27/2020

Foresight AND Hindsight

To model is to represent. The threshold of decidability defines two epis...

Please sign up or login with your details

Forgot password? Click here to reset