Pages that link to "Item:Q5451038"
From MaRDI portal
The following pages link to Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems (Q5451038):
Displaying 11 items.
- On \(d\)-multiplicative secret sharing (Q604627) (← links)
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN (Q2056771) (← links)
- A geometric approach to homomorphic secret sharing (Q2061949) (← links)
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
- On the power of rewinding simulators in functional encryption (Q2407055) (← links)
- On the Communication Required for Unconditionally Secure Multiplication (Q2829225) (← links)
- Worst-Case to Average-Case Reductions for Subclasses of P (Q5098780) (← links)
- Automata, Languages and Programming (Q5716770) (← links)
- Sublinear secure computation from new assumptions (Q6114267) (← links)
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs (Q6581781) (← links)
- Efficient and generic methods to achieve active security in private information retrieval and more advanced database search (Q6637539) (← links)
