Secure two-party computation is practical
From MaRDI portal
Publication:3650696
Recommendations
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- Secure Multiparty AES
- Faster secure two-party computation in the single-execution setting
- Techniques for Efficient Secure Computation Based on Yao’s Protocol
- A new approach to practical active-secure two-party computation
Cited in
(73)- On compiling Boolean circuits optimized for secure multi-party computation
- On multiparty garbling of arithmetic circuits
- Secure two-party computation via cut-and-choose oblivious transfer
- Constant-round maliciously secure two-party computation in the RAM model
- High-performance multi-party computation for binary circuits based on oblivious transfer
- Stacked garbling. Garbled circuit proportional to longest execution path
- Better concrete security for half-gates garbling (in the multi-instance setting)
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- Full-threshold actively-secure multiparty arithmetic circuit garbling
- Adaptive security of practical garbling schemes
- Garbled circuits with sublinear evaluator
- Privacy-preserving naive Bayes classifiers secure against the substitution-then-comparison attack
- Secure two-party computation in a quantum world
- Efficient, actively secure MPC with a dishonest majority: a survey
- Privacy-preserving self-helped medical diagnosis scheme based on secure two-party computation in wireless sensor networks
- On the power of secure two-party computation
- Efficient constant-round multi-party computation combining BMR and SPDZ
- Fast garbling of circuits under standard assumptions
- Fully homomorphic SIMD operations
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
- On the Power of Secure Two-Party Computation
- Linicrypt: a model for practical cryptography
- From oblivious AES to efficient and secure database join in the multiparty setting
- Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces
- A new approach to practical active-secure two-party computation
- Secure two-party computation: a visual way
- How to circumvent the two-ciphertext lower bound for linear garbling schemes
- Garbling XOR gates ``for free in the standard model
- Constant-round maliciously secure two-party computation in the RAM model
- More efficient constant-round multi-party computation from BMR and SHE
- scientific article; zbMATH DE number 4191075 (Why is no real title available?)
- Secure multiparty computation goes live
- Garbled circuits as randomized encodings of functions: a primer
- Automatic protocol selection in secure two-party computations
- Efficient lookup-table protocol in secure multiparty computation
- Faster secure two-party computation in the single-execution setting
- Non-interactive secure 2PC in the offline/online and batch settings
- Hashing garbled circuits for free
- Practical Two-Party Computation Based on the Conditional Gate
- SecGDB: graph encryption for exact shortest distance queries with efficient updates
- Block cipher invariants as eigenvectors of correlation matrices
- Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption
- Breaking and fixing garbled circuits when a gate has duplicate input wires
- Faster secure multi-party computation of AES and DES using lookup tables
- A new approach to garbled circuits
- Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption
- Breaking the size barrier: universal circuits meet lookup tables
- Composable oblivious pseudo-random functions via garbled circuits
- Efficient arithmetic in garbled circuits
- Garbled circuit lookup tables with logarithmic number of ciphertexts
- How to garble mixed circuits that combine Boolean and arithmetic computations
- Lower bounds for garbled circuits from Shannon-type information inequalities
- Row reduction techniques for n-party garbling
- (1/ )-rate Boolean garbling scheme from generic groups
- Bitwise garbling schemes. A model with \(\frac{3}{2}\lambda \)-bit lower bound of ciphertexts
- A unified framework for succinct garbling from homomorphic secret sharing
- Towards building scalable constant-round MPC from minimal assumptions via round collapsing
- \textsf{BitGC}: garbled circuits with 1 bit per gate
- \textsc{Leap}: a fast, lattice-based OPRF with application to private set intersection
- TinyLabels: how to compress garbled circuit input labels, efficiently
- On the adaptive security of Free-XOR-based garbling schemes in the plain model
- Efficient mixed garbling from homomorphic secret sharing and GGM-tree
- Securely instantiating `Half Gates' garbling in the standard model
- An efficient toolkit for computing third-party private set intersection
- Can we beat three halves lower bound? (Im)possibility of reducing communication cost for garbled circuits
- Analysis on sliced garbling via algebraic approach
- Reducing garbled circuit size while preserving circuit gate privacy
- New framework for structure-aware PSI from distributed function secret sharing
- Efficient garbled pseudorandom functions and lookup tables from minimal assumption
- BitGC made (more) efficient
- Succinct garbled circuits with low-depth garbling algorithms
- Amortizing Circuit-PSI in the multiple sender/receiver setting
This page was built for publication: Secure two-party computation is practical
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3650696)
