FOLEAGE: F₄OLE-based multi-party computation for Boolean circuits
From MaRDI portal
Publication:6965203
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- Advances in Cryptology - CRYPTO 2003
- Amortized complexity of information-theoretically secure MPC revisited
- An Algorithm for the Machine Calculation of Complex Fourier Series
- An Extension of Eklundh's Matrix Transposition Algorithm and Its Application in Digital Image Processing
- Concise Encyclopedia of Coding Theory
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
- Correlated pseudorandom functions from variable-density LPN
- Correlated pseudorandomness from expand-accumulate codes
- Correlated pseudorandomness from the hardness of quasi-abelian decoding
- Distributed Point Functions and Their Applications
- Efficient Encryption From Random Quasi-Cyclic Codes
- Efficient multiparty protocols using circuit randomization
- Efficient pseudorandom correlation generators: silent OT extension and more
- Expand-convolute codes for pseudorandom correlation generators from LPN
- Function secret sharing
- Half-tree: halving the cost of tree expansion in COT and DPF
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 1256767 (Why is no real title available?)
- Improved Garbled Circuit: Free XOR Gates and Applications
- Multiparty Computation from Somewhat Homomorphic Encryption
- Overdrive: making SPDZ great again
- Pseudorandom correlation functions from variable-density LPN, revisited
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
- The Fast Fourier Transform
- The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
- Two party RSA key generation. (Extended abstract)
Cited in
(15)- Row reduction techniques for n-party garbling
- Efficient pseudorandom correlation generators over \(\mathbb{Z}/p^k\mathbb{Z} \)
- Stationary syndrome decoding for improved PCGs
- Information set decoding for ring-linear codes
- Efficient pseudorandom correlation generators for any finite field
- Multi-key homomorphic secret sharing
- Non-interactive distributed point functions
- Practical cryptanalysis of pseudorandom correlation generators based on quasi-abelian syndrome decoding
- Pseudorandom correlation functions from Ring-LWR
- Pseudorandom correlation generators for multiparty Beaver triples over \(\mathbb{F}_2\)
- Block-accumulate codes: accelerated linear codes for PCGs and ZK
- Faster pseudorandom correlation generators via Walsh-Hadamard transform
- Dishonest-majority secure computation via PIR-authenticated multiplication triples
- Fast PCGs for batch-authenticated multiplication triples
- Post-quantum public-key pseudorandom correlation functions for OT
This page was built for publication: FOLEAGE: \(\mathbb{F}_4\)OLE-based multi-party computation for Boolean circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6965203)