Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Verifiable random functions with Boolean function constraints

  • 63 Accesses

This is a preview of subscription content, log in to check access.


  1. 1

    Micali S, Rabin M, Vadhan S. Verifiable random functions. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science. New York: IEEE, 1999. 120–130

  2. 2

    Dodis Y, Yampolskiy A. A verifiable random function with short proofs and keys. In: Public Key Cryptography. New York: Springer, 2005. 416–431

  3. 3

    Kuchta V, Manulis M. Unique aggregate signatures with applications to distributed verifiable random functions. In: Proceedings of the International Conference on Cryptology and Network Security. New York: Springer, 2013. 251–270

  4. 4

    Hofheinz D, Jager T. Verifiable random functions from standard assumptions. In: Proceedings of the Theory of Cryptography Conference. New York: Springer, 2016. 336–362

  5. 5

    Antezana J, Marzo J, Olsen J F. Zeros of random functions generated with de branges kernels. Int Math Res Not, 2016, 2016: rnw078

Download references


This work was supported by National Natural Science Foundation of China (Grant Nos. 61370187, 61472032), NSFC-Genertec Joint Fund For Basic Research (Grant No. U1636104) and Joint Research Fund for Overseas Chinese Scholars and Scholars in Hong Kong and Macao (Grant No. 61628201).

Author information

Correspondence to Yan Zhu.

Electronic supplementary material

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Wang, Q., Feng, R. & Zhu, Y. Verifiable random functions with Boolean function constraints. Sci. China Inf. Sci. 61, 039105 (2018). https://doi.org/10.1007/s11432-017-9228-6

Download citation