Batch verification and proofs of proximity with polylog overhead

DOI10.1007/978-3-030-64378-2_5OpenAlexW3115192023MaRDI QIDQ2119040

Guy N. Rothblum, Ron D. Rothblum

Publication date: 23 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-64378-2_5

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (2)

Non-interactive batch arguments for NP from standard assumptions ⋮ Batch arguments for \textsf{NP} and more from standard bilinear group assumptions

This page was built for publication: Batch verification and proofs of proximity with polylog overhead