Query-reusable proof systems

DOI10.1007/978-3-031-91134-7_12MaRDI QIDQ6891315zbMATH OpenFDO

Authors Yuval Ishai, Eyal Kushilevitz, Varun Narayanan, Rafail Ostrovsky, Akash Shah

Publication date 2 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-91134-7_12

zbMATH Keywords

probabilistic proof systems

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Cryptography (94A60)

Cites work

• scientific article; zbMATH DE number 5485433 (Why is no real title available?)
• scientific article; zbMATH DE number 1256635 (Why is no real title available?)
• scientific article; zbMATH DE number 1559565 (Why is no real title available?)
• A note on non-interactive zero-knowledge from CDH
• Founding Cryptography on Oblivious Transfer – Efficiently
• New constructions of reusable designated-verifier NIZKs
• Non-interactive batch arguments for NP from standard assumptions
• Non-interactive zero knowledge from sub-exponential DDH
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• Probabilistically checkable proofs of proximity with zero-knowledge
• Reusable non-interactive secure computation
• The hunting of the SNARK
• Universal classes of hash functions

This page was built for publication: Query-reusable proof systems

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