Non-interactive secure computation with constant communication overhead
From MaRDI portal
Cites work
- (1/ )-rate Boolean garbling scheme from generic groups
- \textsf{BitGC}: garbled circuits with 1 bit per gate
- A unified framework for succinct garbling from homomorphic secret sharing
- Actively secure garbled circuits with constant communication overhead in the plain model
- Actively secure half-gates with minimum overhead under duplex networks
- Advances in Cryptology - CRYPTO 2003
- Amortized complexity of information-theoretically secure MPC revisited
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- Authenticated garbling from simple correlations
- Bitwise garbling schemes. A model with \(\frac{3}{2}\lambda \)-bit lower bound of ciphertexts
- Black-box reusable NISC with random oracles
- Breaking the circuit size barrier for secure computation under DDH
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Correlated pseudorandom functions from variable-density LPN
- Cross and clean: amortized garbled circuits with constant overhead
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient non-interactive secure computation
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Founding Cryptography on Oblivious Transfer – Efficiently
- Fully homomorphic encryption using ideal lattices
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Improved Garbled Circuit: Free XOR Gates and Applications
- Low cost constant round MPC combining BMR and oblivious transfer
- Lower bounds for garbled circuits from Shannon-type information inequalities
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
- Nearly-linear size holographic proofs
- Non-interactive secure computation based on cut-and-choose
- On the round complexity of black-box secure MPC
- Optimizing authenticated garbling for faster secure two-party computation
- Proximity gaps for Reed-Solomon codes
- Public Key Cryptography - PKC 2006
- Reusable non-interactive secure computation
- Round-optimal black-box protocol compilers
- Round-optimal black-box secure computation from two-round malicious OT
- Secure computation using leaky correlations (asymptotically optimal constructions)
- Secure multiparty computation with minimal interaction
- Silent circuit relinearisation: sublinear-size (Boolean and arithmetic) garbled circuits from DCR
- Simple PCPs with poly-log rate and query complexity
- Stacked garbling. Garbled circuit proportional to longest execution path
- 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
This page was built for publication: Non-interactive secure computation with constant communication overhead
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299816)
