\textsf{BitGC}: garbled circuits with 1 bit per gate
From MaRDI portal
Publication:6891183
Cites work
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- A proof of security of Yao's protocol for two-party computation
- An efficient protocol for secure two-party computation in the presence of malicious adversaries
- Attribute-based encryption for circuits of unbounded depth from lattices
- Authenticated BitGC for actively secure rate-one 2PC
- Boosting verifiable computation on encrypted data
- Candidate one-way functions based on expander graphs
- Cryptography with constant computational overhead
- Exploring crypto dark matter: new simple PRF candidates and their applications
- FINAL: faster FHE instantiated with NTRU and LWE
- Flexible and efficient verifiable computation on encrypted data
- Flexor: Flexible garbling for XOR gates that beats free-XOR
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic message authenticators
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Garbling scheme for formulas with constant size of garbled gates
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic secret sharing from lattices without FHE
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1834654 (Why is no real title available?)
- Identity-based encryption from the Diffie-Hellman assumption
- Improved alternating-moduli PRFs and post-quantum signatures
- Improved Garbled Circuit: Free XOR Gates and Applications
- Improved security for a ring-based fully homomorphic encryption scheme
- Indistinguishability obfuscation for Turing machines with unbounded memory
- Laconic function evaluation and applications
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- On ideal lattices and learning with errors over rings
- On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
- On the asymptotic complexity of solving LWE
- On the hardness of the NTRU problem
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Practical homomorphic MACs for arithmetic circuits
- Pseudorandom functions and lattices
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Public-key cryptography from different assumptions
- Reusable garbled circuits and succinct functional encryption
- Rinocchio: SNARKs for ring arithmetic
- Sampling graphs without forbidden subgraphs and unbalanced expanders with negligible error
- Secure two-party computation is practical
- Stronger security for reusable garbled circuits, general definitions and attacks
- Succinct garbling and indistinguishability obfuscation for RAM programs
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Succinct randomized encodings and their applications
- 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
Cited in
(5)
This page was built for publication: \textsf{BitGC}: garbled circuits with 1 bit per gate
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891183)
