Efficient non-interactive zero-knowledge Proofs
Doctor en Ciencias, Mención Computación === Non-Interactive Zero-Knowledge (NIZK) proofs, are proofs that yield nothing beyond their validity. As opposed to the interactive variant, NIZK proofs consist of only one message and are more suited for high-latency scenarios and for building inherently non...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en |
| Published: |
Universidad de Chile
2017
|
| Subjects: | |
| Online Access: | http://repositorio.uchile.cl/handle/2250/144465 |