Verifiable private information retrieval

DOI10.1007/978-3-031-22368-6_1MaRDI QIDQ6169548

Yael Tauman Kalai, Omer Paneth, Shany Ben-David

Publication date: 14 August 2023

Published in: Theory of Cryptography (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cites Work

• On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments
• Witness indistinguishability for any single-round argument with applications to access control
• Somewhere statistical soundness, post-quantum security, and SNARGs
• On the Existence of Extractable One-Way Functions
• Efficient Non-interactive Secure Computation
• Delegating RAM Computations
• Non-interactive delegation and batch NP verification from standard computational assumptions
• How to delegate computations publicly
• Succinct delegation for low-space non-deterministic computation
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
• Recursive composition and bootstrapping for SNARKS and proof-carrying data

This page was built for publication: Verifiable private information retrieval