On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments

DOI10.1007/978-3-319-70503-3_9zbMath1412.94198OpenAlexW2766830205MaRDI QIDQ1690273

Omer Paneth, Guy N. Rothblum

Publication date: 19 January 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-70503-3_9

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (12)

SNARGs for P from sub-exponential DDH and QR ⋮ Incrementally verifiable computation via incremental PCPs ⋮ Non-interactive publicly-verifiable delegation of committed programs ⋮ SNARGs for monotone policy batch NP ⋮ Verifiable private information retrieval ⋮ Somewhere statistical soundness, post-quantum security, and SNARGs ⋮ Fully-succinct publicly verifiable delegation from constant-size assumptions ⋮ No-signaling linear PCPs ⋮ Unnamed Item ⋮ No-signaling linear PCPs ⋮ Constant-Round Interactive Proofs for Delegating Computation ⋮ Delegation with updatable unambiguous proofs and PPAD-hardness

This page was built for publication: On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments