Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems

DOI10.1007/11535218_24zbMath1145.68396OpenAlexW1582319069MaRDI QIDQ5451038

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

Mathematics Subject Classification ID

Database theory (68P15) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (9)

Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2\)] ⋮ On the power of rewinding simulators in functional encryption ⋮ On \(d\)-multiplicative secret sharing ⋮ Worst-Case to Average-Case Reductions for Subclasses of P ⋮ Sublinear-communication secure multiparty computation does not require FHE ⋮ Sublinear secure computation from new assumptions ⋮ Breaking the circuit size barrier for secure computation under quasi-polynomial LPN ⋮ A geometric approach to homomorphic secret sharing ⋮ On the Communication Required for Unconditionally Secure Multiplication

This page was built for publication: Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems