Elette Boyle

From MaRDI portal
Person:734047

Available identifiers

zbMath Open boyle.eletteMaRDI QIDQ734047

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61262532024-04-09Paper
Breaking the O(√ n)-Bit Barrier2024-03-26Paper
Arithmetic sketching2024-02-02Paper
Oblivious transfer with constant computational overhead2024-01-16Paper
Sublinear-communication secure multiparty computation does not require FHE2023-12-08Paper
Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party2023-11-21Paper
Correction to: ``Topology-hiding communication from minimal assumptions2023-10-25Paper
Sublinear secure computation from new assumptions2023-08-14Paper
Programmable distributed point functions2023-07-07Paper
Must the communication graph of MPC protocols be an expander?2023-07-05Paper
Correlated pseudorandomness from expand-accumulate codes2023-06-28Paper
Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation2023-04-13Paper
Efficient fully secure computation via distributed zero-knowledge proofs2023-03-29Paper
https://portal.mardi4nfdi.de/entity/Q58757882023-02-03Paper
Efficient pseudorandom correlation generators from ring-LPN2022-11-09Paper
Secure multiparty computation with sublinear preprocessing2022-08-30Paper
https://portal.mardi4nfdi.de/entity/Q50903882022-07-18Paper
Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2\)]2022-05-18Paper
Sublinear GMW-style compiler for MPC with preprocessing2022-04-22Paper
Topology-hiding communication from minimal assumptions2022-03-23Paper
Function secret sharing for mixed-mode and fixed-point secure computation2021-12-08Paper
https://portal.mardi4nfdi.de/entity/Q50026942021-07-28Paper
https://portal.mardi4nfdi.de/entity/Q49932842021-06-15Paper
Must the communication graph of MPC protocols be an expander?2020-06-30Paper
Limits of practical sublinear secure computation2020-06-30Paper
Secure computation with preprocessing via function secret sharing2020-04-30Paper
Is information-theoretic topology-hiding computation possible?2020-04-30Paper
Permuted puzzles and cryptographic hardness2020-04-30Paper
Zero-knowledge proofs on secret-shared data via fully linear PCPs2020-03-09Paper
Efficient pseudorandom correlation generators: silent OT extension and more2020-03-09Paper
Homomorphic secret sharing from lattices without FHE2020-02-06Paper
Securing Abe's mix-net against malicious verifiers via witness indistinguishability2018-10-17Paper
Exploring the boundaries of topology-hiding computation2018-07-17Paper
Recent advances in function and homomorphic secret sharing (invited talk)2018-04-26Paper
Can we access a database both locally and privately?2018-01-19Paper
Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation2017-06-13Paper
Breaking the Circuit Size Barrier for Secure Computation Under DDH2016-11-30Paper
Is There an Oblivious RAM Lower Bound?2016-04-15Paper
Oblivious Parallel RAM and Applications2016-04-08Paper
Limits of Extractability Assumptions with Distributional Auxiliary Input2016-03-23Paper
Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs2015-12-10Paper
Function Secret Sharing2015-09-30Paper
Leakage-resilient coin tossing2014-07-11Paper
Multiparty computation secure against continual memory leakage2014-05-13Paper
Functional Signatures and Pseudorandom Functions2014-03-25Paper
On Extractability Obfuscation2014-02-18Paper
Secure Computation against Adaptive Auxiliary Information2013-09-02Paper
Fully leakage-resilient signatures2013-08-01Paper
Communication Locality in Secure Multi-party Computation2013-03-18Paper
Leakage-Resilient Coin Tossing2011-10-28Paper
Fully Leakage-Resilient Signatures2011-05-27Paper
Sequential entry in many-to-one matching markets2009-10-19Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Elette Boyle