BitGC made (more) efficient
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- \textsf{BitGC}: garbled circuits with 1 bit per gate
- A proof of security of Yao's protocol for two-party computation
- A unified framework for succinct garbling from homomorphic secret sharing
- Advances in Cryptology - CRYPTO 2003
- Algebraic attacks against random local functions and their countermeasures
- Authenticated BitGC for actively secure rate-one 2PC
- Better concrete security for half-gates garbling (in the multi-instance setting)
- Bootstrapping for HElib
- Candidate one-way functions based on expander graphs
- Efficient homomorphic conversion between (ring) LWE ciphertexts
- Fast pseudorandom functions based on expander graphs
- Faster homomorphic linear transformations in HElib
- Flexor: Flexible garbling for XOR gates that beats free-XOR
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Homomorphic secret sharing from lattices without FHE
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1951605 (Why is no real title available?)
- Identity-based encryption from the Diffie-Hellman assumption
- Improved Garbled Circuit: Free XOR Gates and Applications
- Low-bandwidth mixed arithmetic in VOLE-based ZK from low-degree PRGs
- Lower bounds for garbled circuits from Shannon-type information inequalities
- More on average case vs approximation complexity
- On ideal lattices and learning with errors over rings
- On the hardness of the NTRU problem
- On tweakable correlation robust hashing against key leakages
- Privacy-free garbled circuits for formulas: size zero and information-theoretic
- Privacy-free garbled circuits with applications to efficient zero-knowledge
- Pseudorandom functions and lattices
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Reusable garbled circuits and succinct functional encryption
- Revisiting the Concrete Security of Goldreich’s Pseudorandom Generator
- Scooby: improved multi-party homomorphic secret sharing based on FHE
- Secure two-party computation is practical
- Silent circuit relinearisation: sublinear-size (Boolean and arithmetic) garbled circuits from DCR
- Stacked garbling for disjunctive zero-knowledge proofs
- Stronger security for reusable garbled circuits, general definitions and attacks
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- Worst-case subexponential attacks on PRGs of constant degree or constant locality
This page was built for publication: BitGC made (more) efficient
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299819)
