Fully malicious authenticated PIR

DOI10.1007/978-3-031-68400-5_4MaRDI QIDQ6653043zbMATH OpenFDO

Authors Marian Dietz, Stefano Tessaro

Publication date 13 December 2024

Full work available at URL https://doi.org/10.1007/978-3-031-68400-5_4

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Theory of data (68Pxx)

Cites work

• scientific article; zbMATH DE number 1261806 (Why is no real title available?)
• scientific article; zbMATH DE number 1302834 (Why is no real title available?)
• scientific article; zbMATH DE number 1304086 (Why is no real title available?)
• scientific article; zbMATH DE number 2086729 (Why is no real title available?)
• Can we access a database both locally and privately?
• Compressible FHE with applications to PIR
• Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
• Efficient secure two-party computation using symmetric cut-and-choose
• How to correct errors in multi-server PIR
• Information Security
• Multi-server PIR with full error detection and limited error correction
• Robust information-theoretic private information retrieval
• Secure two-party computation via cut-and-choose oblivious transfer
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Simulatable Adaptive Oblivious Transfer
• Towards doubly efficient private information retrieval
• Universal Arguments and their Applications
• Verifiable multi-server private information retrieval
• Verifiable private information retrieval
• Verifiable single-server private information retrieval
• Verifiable single-server private information retrieval from LWE with binary errors

This page was built for publication: Fully malicious authenticated PIR

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