Two-round adaptively secure MPC from isogenies, LPN, or CDH
From MaRDI portal
(Redirected from Publication:6157520)
Recommendations
Cites work
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- A Framework for Efficient and Composable Oblivious Transfer
- A proof of security of Yao's protocol for two-party computation
- Adaptive versus non-adaptive security of multi-party protocols
- Adaptively secure MPC with sublinear communication complexity
- Adaptively secure multi-party computation with dishonest majority
- Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
- Better two-round adaptive multi-party computation
- Bit commitment using pseudorandomness
- Compact, efficient and UC-secure isogeny-based oblivious transfer
- Constant ciphertext-rate non-committing encryption from standard assumptions
- Cryptographic group actions and applications
- CSI-FiSh: efficient isogeny based signatures through class group computations
- CSIDH: an efficient post-quantum commutative group action
- Distinguisher-dependent simulation in two rounds and its applications
- Efficient and round-optimal oblivious transfer and commitment with adaptive security
- Efficient oblivious transfer protocols
- Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
- Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
- Faster algorithms for isogeny problems using torsion point images
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 1256784 (Why is no real title available?)
- Improved non-committing encryption with applications to adaptively secure protocols
- Multiparty generation of an RSA modulus
- Non-committing encryption with quasi-optimal ciphertext-rate based on the DDH problem
- On Black-Box Complexity of Universally Composable Security in the CRS Model
- Optimal-rate non-committing encryption
- Rational isogenies from irrational endomorphisms
- Smooth projective hashing and two-message oblivious transfer
- Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
- Two round multiparty computation via multi-key FHE
- Two-message statistically sender-private OT from LWE
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
- Two-round adaptively secure multiparty computation from standard assumptions
- Two-round multiparty secure computation from minimal assumptions
- Two-round oblivious transfer from CDH or LPN
- Two-round secure MPC from indistinguishability obfuscation
- Universally composable two-party and multi-party secure computation
- Verifiable delay functions from supersingular isogenies and pairings
Cited in
(9)- Two-round adaptively secure multiparty computation from standard assumptions
- Reusable two-round MPC from LPN
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
- Round-optimal oblivious transfer and MPC from computational CSIDH
- Statistical security in two-party computation revisited
- Triply adaptive UC NIZK
- Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT
- Robustly reusable fuzzy extractor from isogeny
- New proof systems and an OPRF from CSIDH
This page was built for publication: Two-round adaptively secure MPC from isogenies, LPN, or CDH
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157520)
