Two-round concurrent 2PC from sub-exponential LWE
From MaRDI portal
Recommendations
Cites work
- A new approach to round-optimal secure multiparty computation
- A note on quantum security for post-quantum cryptography
- A unified framework for UC from only OT
- Adaptive One-Way Functions and Applications
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Authenticated key exchange secure against dictionary attacks
- Black-box constructions of composable protocols without set-up
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Candidate iO from homomorphic encryption schemes
- Concurrently secure computation in constant rounds
- Constant-round black-box construction of composable multi-party computation protocol
- Cryptanalysis of the multilinear map over the integers
- Four round secure computation without setup
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- scientific article; zbMATH DE number 2009954 (Why is no real title available?)
- scientific article; zbMATH DE number 7650430 (Why is no real title available?)
- Indistinguishability obfuscation from semantically-secure multilinear encodings
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
- On concurrently secure computation in the multiple ideal query model
- On the exact round complexity of self-composable two-party computation
- One-message zero knowledge and non-malleable commitments
- Post-zeroizing obfuscation: new mathematical tools, and the case of evasive circuits
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- Promise zero knowledge and its applications to round optimal MPC
- Round optimal concurrent MPC via strong simulation
- Round optimal secure multiparty computation from minimal assumptions
- Round-efficient black-box construction of composable multi-party computation
- Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
- Round-optimal secure multi-party computation
- Secure multi-party quantum computation with a dishonest majority
- Statistical ZAP arguments
- Statistical Zaps and new oblivious transfer protocols
- The Exact Round Complexity of Secure Computation
- Theory of Cryptography
- Theory of Cryptography
- Two-message statistically sender-private OT from LWE
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- Two-round maliciously secure computation with super-polynomial simulation
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
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)
