Verifiable Random Function: Cryptography, Michael O. Rabin, Pseudo-Random Function, Key (Cryptography), Bilinear Map -
-20% with code BOOKS
Shipping in 15-21 days
30-day return policy
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, ever ... Full description
You May Also Like
Description
More Information
| Publisher | OmniScriptum |
|---|---|
| Release year | 2026 |
| Cover type | Softcover |
| EAN | 9786131157103 |