Non-interactive Secure 2PC in the Offline/Online and Batch Settings
From MaRDI portal
Publication:5270370
DOI10.1007/978-3-319-56617-7_15zbMath1415.94451OpenAlexW2592087229MaRDI QIDQ5270370
Publication date: 23 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56617-7_15
Related Items (10)
On the round complexity of black-box secure MPC ⋮ Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact ⋮ Pattern matching on encrypted streams ⋮ Round-optimal black-box protocol compilers ⋮ Black-box reusable NISC with random oracles ⋮ Efficient and scalable universal circuits ⋮ Private polynomial commitments and applications to MPC ⋮ Non-interactive secure computation from one-way functions ⋮ On the exact round complexity of secure three-party computation ⋮ Succinct non-interactive secure computation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- More efficient oblivious transfer extensions
- On the Complexity of Additively Homomorphic UC Commitments
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
- Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation
- Improved OT Extension for Transferring Short Secrets
- Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys
- FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR
- Amortizing Garbled Circuits
- Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
- Additively Homomorphic UC Commitments with Optimal Amortized Overhead
- More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
- Two Halves Make a Whole
- Two-Output Secure Computation with Malicious Adversaries
- Efficient Non-interactive Secure Computation
- Actively Secure OT Extension with Optimal Overhead
- Improved Garbled Circuit: Free XOR Gates and Applications
- A Framework for Efficient and Composable Oblivious Transfer
- Founding Cryptography on Oblivious Transfer – Efficiently
- LEGO for Two-Party Secure Computation
- Universally-Composable Two-Party Computation in Two Rounds
- Secure Two-Party Computation Is Practical
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions
- How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation
- Non-Interactive Secure Computation Based on Cut-and-Choose
- Advances in Cryptology - CRYPTO 2003
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Efficient Two Party and Multi Party Computation Against Covert Adversaries
- A Permutation Network
- Public Key Cryptography - PKC 2006
This page was built for publication: Non-interactive Secure 2PC in the Offline/Online and Batch Settings
