Purpose As the core technology of blockchain, various consensus mechanisms have
emerged to satisfy the demands of different application scenarios. Since determining the …

Service replication distributes an application over many processes for tolerating faults,
attacks, and misbehavior among a subset of the processes. The established state-machine …

We provide a formal treatment of security of digital signatures against subversion attacks
(SAs). Our model of subversion generalizes previous work in several directions, and is …

Multi-client functional encryption (MCFE) allows ℓ clients to encrypt ciphertexts (C _ t, 1, C _
t, 2, ..., C _ t, ℓ) under some label. Each client can encrypt his own data X_i for a label t using …

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 …

In this work, we introduce the first practical post-quantum verifiable random function (VRF)
that relies on well-known (module) lattice problems, namely Module-SIS and Module-LWE …

We propose a trustless blockchain-based protocol for secure and decentralized generation
of secret random numbers. In our protocol, which can be implemented as a smart contract, a …

The question whether there exist verifiable random functions with exponential-sized input
space and full adaptive security based on a non-interactive, constant-size assumption is a …