Verifiable Random Function: Cryptography, Michael O. Rabin, Pseudo-Random Function, Key (Cryptography), Bilinear Map -
-40% koodiga BOOKS
Saadetis 15-21 tööpäeva jooksul
30-päevane tagastamisõigus
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 ... Täielik kirjeldus
Võib-olla meeldib sulle ka
Kirjeldus
Lisateave
| Kirjastaja | OmniScriptum |
|---|---|
| Väljalaskeaasta | 2026 |
| Kaanetüüp | Pehme kaanega |
| EAN | 9786131157103 |