Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
From MaRDI portal
Publication:5451038
DOI10.1007/11535218_24zbMATH Open1145.68396OpenAlexW1582319069MaRDI QIDQ5451038FDOQ5451038
Authors: Omer Barkol, Yuval Ishai 
Publication date: 17 March 2008
Published in: Advances in Cryptology – CRYPTO 2005 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11535218_24
Recommendations
Database theory (68P15) Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)
Cited In (15)
- Worst-Case to Average-Case Reductions for Subclasses of P
- On \(d\)-multiplicative secret sharing
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- On the communication required for unconditionally secure multiplication
- On the power of rewinding simulators in functional encryption
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\)
- Sublinear-communication secure multiparty computation does not require FHE
- Sublinear secure computation from new assumptions
- How should we solve search problems privately?
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
- Efficient and generic methods to achieve active security in private information retrieval and more advanced database search
- A geometric approach to homomorphic secret sharing
- Automata, Languages and Programming
- Private decision tree evaluation with constant rounds via (only) SS-3PC over ring
- How Should We Solve Search Problems Privately?
This page was built for publication: Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451038)
