High Quality Content by WIKIPEDIA articles! In cryptography, the concept of a verifiable random function was introduced by Micali, Rabin, and Vadhan. It is a pseudo-random function that provides publicly verifiable proofs of its outputs' correctness. Given an input value x, the owner of the secret key SK can compute the function value y = FSK(x) and the proof pSK(x). Using the proof and the public key, everyone can check that the value y = FSK(x) was indeed computed correctly, yet this information cannot be used to find the secret key.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.