Probabilistically Checkable Arguments

DOI10.1007/978-3-642-03356-8_9zbMath1252.94079OpenAlexW2156708311MaRDI QIDQ3183562

Yael Tauman Kalai, Ran Raz

Publication date: 20 October 2009

Published in: Advances in Cryptology - CRYPTO 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03356-8_9

Mathematics Subject Classification ID

Cryptography (94A60) Information storage and retrieval of data (68P20)

Related Items (12)

Succinct non-interactive arguments via linear interactive proofs ⋮ Interactive Oracle Proofs ⋮ Fiat-Shamir and correlation intractability from strong KDM-secure encryption ⋮ Refereed delegation of computation ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ Knowledge encryption and its applications to simulatable protocols with low round-complexity ⋮ SNARGs for monotone policy batch NP ⋮ The hunting of the SNARK ⋮ Cryptography with certified deletion ⋮ Unnamed Item ⋮ Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems ⋮ Outsourcing Medical Dataset Analysis: A Possible Solution

This page was built for publication: Probabilistically Checkable Arguments