Scaling Verifiable Computation Using Efficient Set Accumulators
Year: 2019
Type: preprint
Source: IACR Cryptology ePrint Archive
Authors: Alex Ozdemir, Riad S. Wahby, Barry Whitehat, Dan Boneh
Institution: Stanford University
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W3003685986
