Authenticated BitGC for actively secure rate-one 2PC
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1834654 (Why is no real title available?)
- scientific article; zbMATH DE number 7706037 (Why is no real title available?)
- (Leveled) fully homomorphic encryption without bootstrapping
- A Unified Approach to MPC with Preprocessing Using OT
- A new approach to practical active-secure two-party computation
- Actively secure half-gates with minimum overhead under duplex networks
- 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
- Authenticated garbling from simple correlations
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient pseudorandom correlation generators for any finite field
- Efficient pseudorandom correlation generators: silent OT extension and more
- Efficient secure two-party computation using symmetric cut-and-choose
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
- Faster secure two-party computation in the single-execution setting
- Foundations of Cryptography
- Founding Cryptography on Oblivious Transfer – Efficiently
- Fully homomorphic encryption using ideal lattices
- High-performance multi-party computation for binary circuits based on oblivious transfer
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic encryption: from private-key to public-key
- Homomorphic secret sharing from lattices without FHE
- Improved alternating-moduli PRFs and post-quantum signatures
- Interactive line-point zero-knowledge with sublinear communication and linear computation
- LEGO for Two-Party Secure Computation
- Laconic function evaluation and applications
- Low cost constant round MPC combining BMR and oblivious transfer
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- MiniLEGO: efficient secure two-party computation from general assumptions
- Multiparty Computation from Somewhat Homomorphic Encryption
- Non-interactive secure computation based on cut-and-choose
- On ideal lattices and learning with errors over rings
- On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
- Optimizing authenticated garbling for faster secure two-party computation
- Overdrive: making SPDZ great again
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Pseudorandom functions and lattices
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Round-optimal and communication-efficient multiparty computation
- Sampling graphs without forbidden subgraphs and unbalanced expanders with negligible error
- Secure arithmetic computation with constant computational overhead
- Secure two-party computation via cut-and-choose oblivious transfer
- Secure two-party computation with reusable bit-commitments, via a cut-and-choose with forge-and-lose technique (extended abstract)
- Security and composition of multiparty cryptographic protocols
- Semi-homomorphic encryption and multiparty computation
- Short pairing-based non-interactive zero-knowledge arguments
- Succinct non-interactive secure computation
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- Two-output secure computation with malicious adversaries
- \textsf{BitGC}: garbled circuits with 1 bit per gate
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
Cited in
(2)
This page was built for publication: Authenticated BitGC for actively secure rate-one 2PC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6863886)
