Efficient and generic methods to achieve active security in private information retrieval and more advanced database search

DOI10.1007/978-3-031-58740-5_4MaRDI QIDQ6637539

Kaoru Kurosawa, Reo Eriguchi, Koji Nuida

Publication date: 13 November 2024

Searching and sorting (68P10) Database theory (68P15) Data encryption (aspects in computer science) (68P25)

Cites Work

Unnamed Item
Unnamed Item
Refereed delegation of computation
On locally decodable codes, self-correctable codes, and \(t\)-private PIR
On \(d\)-multiplicative secret sharing
Yet another compiler for active security or: efficient MPC over arbitrary rings
The rise of Paillier: homomorphic secret sharing and public-key silent OT
A geometric approach to homomorphic secret sharing
The price of active security in cryptographic protocols
Sublinear GMW-style compiler for MPC with preprocessing
Large message homomorphic secret sharing from DCR and applications
How to correct errors in multi-server PIR
Homomorphic secret sharing from lattices without FHE
Robust information-theoretic private information retrieval
Breaking the Circuit Size Barrier for Secure Computation Under DDH
2-Server PIR with Sub-Polynomial Communication
Function Secret Sharing
Private information retrieval
A Geometric Approach to Information-Theoretic Private Information Retrieval
Fully Homomorphic Encryption over the Integers
Ottimizzazione Combinatoria
Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
From Secrecy to Soundness: Efficient Verification via Secure Computation
The Capacity of Private Information Retrieval from Byzantine and Colluding Databases
Multi-Client Non-interactive Verifiable Computation
3-Query Locally Decodable Codes of Subexponential Length
CNF-FSS and Its Applications
Fully homomorphic encryption using ideal lattices
Verifiably Multiplicative Secret Sharing
Achieving Privacy in Verifiable Computation with Multiple Servers – Without FHE and without Pre-processing
Distributed Point Functions and Their Applications
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers
On the optimal communication complexity of error-correcting multi-server PIR
Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN

This page was built for publication: Efficient and generic methods to achieve active security in private information retrieval and more advanced database search