{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T16:10:04Z","timestamp":1748707804031,"version":"3.41.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319260587"},{"type":"electronic","value":"9783319260594"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26059-4_3","type":"book-chapter","created":{"date-parts":[[2015,11,27]],"date-time":"2015-11-27T16:59:56Z","timestamp":1448643596000},"page":"43-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Constrained Verifiable Random Functions from Indistinguishability Obfuscation"],"prefix":"10.1007","author":[{"given":"Bei","family":"Liang","sequence":"first","affiliation":[]},{"given":"Hongda","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jinyong","family":"Chang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,28]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-642-01001-9_32","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"M Abdalla","year":"2009","unstructured":"Abdalla, M., Catalano, D., Fiore, D.: Verifiable random functions from identity-based key encapsulation. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 554\u2013571. Springer, Heidelberg (2009)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44647-8_1","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"B Barak","year":"2001","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S.P., Yang, K.: On the (im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 1\u201318. Springer, Heidelberg (2001)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/978-3-642-00457-5_33","volume-title":"Theory of Cryptography","author":"Z Brakerski","year":"2009","unstructured":"Brakerski, Z., Goldwasser, S., Rothblum, G.N., Vaikuntanathan, V.: Weak verifiable random functions. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 558\u2013576. Springer, Heidelberg (2009)"},{"key":"3_CR4","unstructured":"Blum, M.: Coin flipping by telephone-a protocol for solving impossible problems. In: COMPCON, pp. 133\u2013137. IEEE Computer Society (1982)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/978-3-662-46497-7_16","volume-title":"Theory of Cryptography","author":"N Bitansky","year":"2015","unstructured":"Bitansky, N., Paneth, O.: ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015, Part II. LNCS, vol. 9015, pp. 401\u2013427. Springer, Heidelberg (2015)"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-42045-0_15","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Waters, B.: Constrained pseudorandom functions and their applications. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part II. LNCS, vol. 8270, pp. 280\u2013300. Springer, Heidelberg (2013)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/978-3-642-28914-9_36","volume-title":"Theory of Cryptography","author":"D Fiore","year":"2012","unstructured":"Fiore, D., Schr\u00f6der, D.: Uniqueness is a different story: impossibility of verifiable random functions from trapdoor permutations. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 636\u2013653. Springer, Heidelberg (2012)"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/978-3-319-10879-7_7","volume-title":"Security and Cryptography for Networks","author":"G Fuchsbauer","year":"2014","unstructured":"Fuchsbauer, G.: Constrained verifiable random functions. In: Abdalla, M., De Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 95\u2013114. Springer, Heidelberg (2014)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: FOCS (2013)","DOI":"10.1109\/FOCS.2013.13"},{"issue":"4","key":"3_CR10","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/3-540-48071-4_16","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"S Goldwasser","year":"1993","unstructured":"Goldwasser, S., Ostrovsky, R.: Invariant signatures and non-interactive zero-knowledge proofs are equivalent. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 228\u2013245. Springer, Heidelberg (1993)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1007\/978-3-642-13190-5_33","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"S Hohenberger","year":"2010","unstructured":"Hohenberger, S., Waters, B.: Constructing verifiable random functions with large input spaces. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 656\u2013672. Springer, Heidelberg (2010)"},{"key":"3_CR13","unstructured":"Jager, T.: Verifiable random functions from weaker assumptions. Cryptology ePrint Archive, Report 2014\/799 (2014)"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-540-24676-3_35","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"S Jarecki","year":"2004","unstructured":"Jarecki, S.: Handcuffing big brother: an abuse-resilient transaction escrow scheme. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 590\u2013608. Springer, Heidelberg (2004)"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/3-540-45708-9_38","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"A Lysyanskaya","year":"2002","unstructured":"Lysyanskaya, A.: Unique signatures and verifiable random functions from the DH-DDH separation. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 597\u2013612. Springer, Heidelberg (2002)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/3-540-44647-8_32","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"S Micali","year":"2001","unstructured":"Micali, S., Reyzin, L.: Soundness in the public-key model. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 542\u2013565. Springer, Heidelberg (2001)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Micali, S., Rabin, M., Vadhan, S.: Verifiable random functions. In: Proceedings of 40th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 120\u2013130. IEEE Computer Society Press (1999)","DOI":"10.1109\/SFFCS.1999.814584"},{"issue":"2","key":"3_CR18","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. J. Cryptology 4(2), 151\u2013158 (1991)","journal-title":"J. Cryptology"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: STOC, pp. 475\u2013484 (2014)","DOI":"10.1145\/2591796.2591825"}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26059-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T15:43:58Z","timestamp":1748706238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26059-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319260587","9783319260594"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26059-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}