Verifiable random functions with Boolean function constraints

  • Qianwen Wang
  • Rongquan Feng
  • Yan Zhu



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).

Supplementary material

11432_2017_9228_MOESM1_ESM.pdf (357 kb)
Supplementary material, approximately 357 KB.


  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–130Google Scholar
  2. 2.
    Dodis Y, Yampolskiy A. A verifiable random function with short proofs and keys. In: Public Key Cryptography. New York: Springer, 2005. 416–431Google Scholar
  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–270CrossRefGoogle Scholar
  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–362CrossRefGoogle Scholar
  5. 5.
    Antezana J, Marzo J, Olsen J F. Zeros of random functions generated with de branges kernels. Int Math Res Not, 2016, 2016: rnw078CrossRefGoogle Scholar

Copyright information

© Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.School of Mathematical SciencesPeking UniversityBeijingChina
  2. 2.School of Computer and Communication EngineeringUniversity of Science and Technology BeijingBeijingChina

Personalised recommendations