A Novel Construction of Constrained Verifiable Random Functions
Constrained verifiable random functions (VRFs) were introduced by Fuchsbauer. In a constrained VRF, one can drive a constrained key skS from the master secret key sk, where S is a subset of the domain. Using the constrained key skS, one can compute function values at points which are not in the set...
Main Authors: | Muhua Liu, Ping Zhang, Qingtao Wu |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi-Wiley
2019-01-01
|
Series: | Security and Communication Networks |
Online Access: | http://dx.doi.org/10.1155/2019/4187892 |
Similar Items
-
Distributed Functional Signature with Function Privacy and Its Application
by: Muhua Liu, et al.
Published: (2021-01-01) -
On the Verified-by-Construction Approach
by: Butler, Michael
Published: (2006) -
Statically Aggregate Verifiable Random Functions and Application to E-Lottery
by: Bei Liang, et al.
Published: (2020-12-01) -
Distributed Constrained Stochastic Subgradient Algorithms Based on Random Projection and Asynchronous Broadcast over Networks
by: Junlong Zhu, et al.
Published: (2017-01-01) -
On verifiable function sharing
by: Blunden, Mark Alexander
Published: (1997)