A Novel Construction of Constrained Verifiable Random Functions

<div>Circuit <span class="nowrap"><svg height="12.1958pt" id="M273" style="vertical-align:-3.181479pt" version="1.1" viewbox="-0.0498162 -9.01432 15.4459 12.1958" width="15.4459pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M449 645C392 682 336 687 293 687C136 687 37 594 37 499C37 397 122 342 207 329C176 273 159 217 159 158C159 48 247 -15 356 -15C417 -15 478 3 530 39S626 128 626 187C626 256 580 290 508 290C402 290 311 187 311 65L333 63C344 171 423 247 491 247C528 247 562 225 562 173C562 97 470 15 360 15C284 15 243 61 243 125C243 176 255 240 312 324C552 324 781 473 781 594C781 642 748 669 685 669C547 669 336 527 229 361C151 369 78 413 78 501C78 604 200 657 301 657C336 657 381 657 437 626L449 645ZM331 355C443 513 593 632 690 632C723 632 740 619 740 592C740 534 671 464 576 416C501 377 411 354 332 354L331 355Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,10.361,3.132)"><path d="M389 0V32C297 38 291 46 291 118V635C234 613 175 595 109 583V556L161 554C203 552 207 547 207 497V118C207 46 201 38 110 32V0H389Z"></path></g></svg>.</span></div>

Security and Communication Networks

A Novel Construction of Constrained Verifiable Random Functions

Figure 1