Two-round concurrent 2PC from sub-exponential LWE
From MaRDI portal
Publication:6595674
DOI10.1007/978-981-99-8721-4_3zbMATH Open1546.94048MaRDI QIDQ6595674
Saikrishna Badrinarayanan, Giulio Malavolta, Amit Sahai, Ahmadreza Rahimi, Rex Fernando, Behzad Abdolmaleki
Publication date: 30 August 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- One-message zero knowledge and non-malleable commitments
- Two-message statistically sender-private OT from LWE
- A new approach to round-optimal secure multiparty computation
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Four round secure computation without setup
- Round optimal concurrent MPC via strong simulation
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- Promise zero knowledge and its applications to round optimal MPC
- Candidate iO from homomorphic encryption schemes
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Statistical ZAP arguments
- Statistical Zaps and new oblivious transfer protocols
- Secure multi-party quantum computation with a dishonest majority
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
- Round optimal secure multiparty computation from minimal assumptions
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Two-round maliciously secure computation with super-polynomial simulation
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
- Round-Efficient Black-Box Construction of Composable Multi-Party Computation
- Concurrently Secure Computation in Constant Rounds
- Black-Box Constructions of Composable Protocols without Set-Up
- A Note on Quantum Security for Post-Quantum Cryptography
- Cryptanalysis of the Multilinear Map over the Integers
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Adaptive One-Way Functions and Applications
- A Unified Framework for UC from Only OT
- On Concurrently Secure Computation in the Multiple Ideal Query Model
- Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
- On the Exact Round Complexity of Self-composable Two-Party Computation
- The Exact Round Complexity of Secure Computation
- Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol
- Theory of Cryptography
- Theory of Cryptography
- Round-optimal secure multi-party computation
- Indistinguishability obfuscation from well-founded assumptions
This page was built for publication: Two-round concurrent 2PC from sub-exponential LWE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595674)
