The following pages link to Elette Boyle (Q734047):
Displayed 50 items.
- Sequential entry in many-to-one matching markets (Q734048) (← links)
- Must the communication graph of MPC protocols be an expander? (Q775967) (← links)
- Limits of practical sublinear secure computation (Q775973) (← links)
- Exploring the boundaries of topology-hiding computation (Q1653090) (← links)
- Can we access a database both locally and privately? (Q1690289) (← links)
- Recent advances in function and homomorphic secret sharing (invited talk) (Q1746821) (← links)
- Securing Abe's mix-net against malicious verifiers via witness indistinguishability (Q1796796) (← links)
- Function secret sharing for mixed-mode and fixed-point secure computation (Q2056774) (← links)
- Efficient pseudorandom correlation generators from ring-LPN (Q2096531) (← links)
- Topology-hiding communication from minimal assumptions (Q2119056) (← links)
- Sublinear GMW-style compiler for MPC with preprocessing (Q2128572) (← links)
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
- Secure multiparty computation with sublinear preprocessing (Q2170009) (← links)
- Secure computation with preprocessing via function secret sharing (Q2175917) (← links)
- Is information-theoretic topology-hiding computation possible? (Q2175925) (← links)
- Permuted puzzles and cryptographic hardness (Q2175950) (← links)
- Leakage-resilient coin tossing (Q2251154) (← links)
- Homomorphic secret sharing from lattices without FHE (Q2292864) (← links)
- Zero-knowledge proofs on secret-shared data via fully linear PCPs (Q2304915) (← links)
- Efficient pseudorandom correlation generators: silent OT extension and more (Q2304930) (← links)
- Fully leakage-resilient signatures (Q2392093) (← links)
- Efficient fully secure computation via distributed zero-knowledge proofs (Q2691587) (← links)
- Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation (Q2697852) (← links)
- Limits of Extractability Assumptions with Distributional Auxiliary Input (Q2795973) (← links)
- Oblivious Parallel RAM and Applications (Q2799095) (← links)
- Is There an Oblivious RAM Lower Bound? (Q2800584) (← links)
- Breaking the Circuit Size Barrier for Secure Computation Under DDH (Q2835599) (← links)
- Secure Computation against Adaptive Auxiliary Information (Q2845680) (← links)
- Function Secret Sharing (Q2948389) (← links)
- Fully Leakage-Resilient Signatures (Q3003376) (← links)
- Leakage-Resilient Coin Tossing (Q3095326) (← links)
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs (Q3457093) (← links)
- Communication Locality in Secure Multi-party Computation (Q4910288) (← links)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- (Q5002694) (← links)
- (Q5090388) (← links)
- Functional Signatures and Pseudorandom Functions (Q5402990) (← links)
- Multiparty computation secure against continual memory leakage (Q5415547) (← links)
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation (Q5738973) (← links)
- On Extractability Obfuscation (Q5746332) (← links)
- Cryptography from Information Loss. (Q5875788) (← links)
- Correction to: ``Topology-hiding communication from minimal assumptions'' (Q6054730) (← links)
- Sublinear-communication secure multiparty computation does not require FHE (Q6061356) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
- Programmable distributed point functions (Q6111543) (← links)
- Sublinear secure computation from new assumptions (Q6114267) (← links)
- (Q6126253) (← links)
- Oblivious transfer with constant computational overhead (Q6138086) (← links)
- Correlated pseudorandomness from expand-accumulate codes (Q6162058) (← links)