Skip to main content

Homomorphic Secret Sharing: Secure Computation and Beyond

Searching for OpenAIRE data...

Publications

Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs

Author(s): Elette Boyle, Niv Gilboa, Yuval Ishai, and Ariel Nof
Published in: 2020

Lightweight Techniques for Private Heavy Hitters

Author(s): Dan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa, and Yuval Ishai
Published in: 2021

Breaking the Circuit Size Barrier for Secure Computation under Quasi-Polynomial LPN

Author(s): Geoffroy Couteau and Pierre Meyer
Published in: 2021

Function Secret Sharing for Mixed-Mode and Fixed-Point Secure Computation

Author(s): Elette Boyle, Nishanth Chandran, Niv Gilboa, Divya Gupta, Yuval Ishai, Nishant Kumar, and Mayank Rathee
Published in: 2021

Breaking the O(sqrt n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per-Party

Author(s): Elette Boyle, Ran Cohen, and Aarushi Goel
Published in: 2021

Topology-Hiding Communication from Minimal Assumptions

Author(s): Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, and Tal Moran
Published in: 2020

Correlated Pseudorandom Functions from Variable-Density LPN

Author(s): Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl
Published in: 2020

Efficient Pseudorandom Correlation Generators from Ring-LPN

Author(s): Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl
Published in: 2020