MIRAGE: Succinct Arguments for Randomized Algorithms with Applications to Universal zk-SNARKs.
Ahmed E. KosbaDimitrios PapadopoulosCharalampos PapamanthouDawn SongPublished in: USENIX Security Symposium (2020)
Keyphrases
- randomized algorithms
- pac learning
- black box
- lower bound
- approximation algorithms
- uniform distribution
- sample complexity
- worst case
- randomized algorithm
- sample size
- practical problems
- learning algorithm
- learning problems
- learning theory
- vc dimension
- upper bound
- data mining
- multiple agents
- membership queries
- special case
- constant factor
- theoretical analysis
- online learning