Probabilistically Checkable Arguments

DOI10.1007/978-3-642-03356-8_9MaRDI QIDQ3183562zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Are PCPs inherent in efficient arguments?
• Polylogarithmic two-round argument systems
• Interactive PCP
• Automata, Languages and Programming
• Spooky interaction and its discontents: compilers for succinct two-message argument systems

Cited in

(20)

• Untangling the security of Kilian's protocol: upper and lower bounds
• Knowledge encryption and its applications to simulatable protocols with low round-complexity
• SNARGs for monotone policy batch NP
• Interactive PCP
• Fiat-Shamir and correlation intractability from strong KDM-secure encryption
• Efficient Probabilistically Checkable Debates
• Succinct non-interactive arguments via linear interactive proofs
• Outsourcing medical dataset analysis: a possible solution
• Relativized succinct arguments in the ROM do not exist
• Interactive oracle proofs
• Cryptography with certified deletion
• Spooky interaction and its discontents: compilers for succinct two-message argument systems
• Predictable arguments of knowledge
• Are PCPs inherent in efficient arguments?
• Probabilistically checkable arguments for all NP
• scientific article; zbMATH DE number 7250162 (Why is no real title available?)
• The hunting of the SNARK
• Polylogarithmic two-round argument systems
• Encoding functions with constant online rate, or how to compress garbled circuit keys
• Refereed delegation of computation

This page was built for publication: Probabilistically Checkable Arguments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183562)