In this paper, we focus on the constructions of adaptively secure identity-based encryption
(IBE) from lattices and verifiable random function (VRF) with large input spaces. Existing …

Abstract Verifiable Random Functions (VRFs) as introduced by Micali, Rabin and Vadhan
are a special form of Pseudo Random Functions (PRFs) wherein a secret key holder can …

Verifiable random functions (VRFs) are pseudorandom functions where the owner of the
seed, in addition to computing the function's value y at any point x, can also generate a non …

This paper introduces the first registered functional encryption RFE scheme tailored for
linear functions. Distinctly different from classical functional encryption (FE), RFE addresses …

This paper focuses on addressing the prevalent issues related to established Verifiable
Random Function (VRF) schemes and presents our novel VRF scheme. Our proposed …

Cryptographic combiners allow one to combine many candidates for a cryptographic
primitive, possibly based on different computational assumptions, into another candidate …

A verifiable random function (VRF) is a pseudorandom function, where outputs can be
publicly verified. That is, given an output value together with a proof, one can check that the …

We provide a novel smart contract-based Verifiable Random Function (VRF) scheme that
addresses the challenges associated with existing frameworks. Our suggested distributed …

Predicates are used in cryptography as a fundamental tool to control the disclosure of
secrets. However, how to embed a particular predicate into a cryptographic primitive is …

Functional encryption (FE) combiners allow one to combine many candidates for a
functional encryption scheme, possibly based on different computational assumptions, into …