The following pages link to Antigoni Polychroniadou (Q775972):
Displaying 22 items.
- Limits of practical sublinear secure computation (Q775973) (← links)
- Two-round adaptively secure multiparty computation from standard assumptions (Q1629408) (← links)
- Laconic oblivious transfer and its applications (Q1678362) (← links)
- Four round secure computation without setup (Q1690211) (← links)
- More is less: perfectly secure oblivious algorithms in the multi-server setting (Q1710668) (← links)
- Constant-overhead unconditionally secure multiparty computation over binary fields (Q2056769) (← links)
- Succinct non-interactive secure computation (Q2119013) (← links)
- ATLAS: efficient and scalable MPC in the honest majority setting (Q2128563) (← links)
- Unconditional communication-efficient MPC via Hall's marriage theorem (Q2128564) (← links)
- Efficient Leakage Resilient Circuit Compilers (Q2790050) (← links)
- Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE) (Q2798800) (← links)
- On the Communication Required for Unconditionally Secure Multiplication (Q2829225) (← links)
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (Q3179364) (← links)
- Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits (Q3457092) (← links)
- A Coding-Theoretic Approach to Recovering Noisy RSA Keys (Q4911597) (← links)
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation (Q5261693) (← links)
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (Q5738764) (← links)
- The Exact Round Complexity of Secure Computation (Q5739211) (← links)
- Round-optimal secure multi-party computation (Q5916238) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← links)
- LERNA: secure single-server aggregation via key-homomorphic masking (Q6595686) (← links)
- Phoenix: secure computation in an unstable network with dropouts and comebacks (Q6642390) (← links)
