Extractable witness encryption for KZG commitments and efficient laconic OT
From MaRDI portal
Cites work
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- Aggregatable subvector commitments for stateless cryptocurrencies
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate witness encryption from lattice techniques
- Constant-Size Commitments to Polynomials and Their Applications
- Efficient laconic cryptography from learning with errors
- Garbled protocols and two-round MPC from bilinear maps
- How to run Turing machines on encrypted data
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- Laconic oblivious transfer and its applications
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Mr NISC: multiparty reusable non-interactive secure computation
- Multiparty reusable non-interactive secure computation from LWE
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- PointProofs, revisited
- The algebraic group model and its applications
- Towards witness encryption without multilinear maps
- Vector commitments and their applications
- Witness encryption and its applications
- Witness encryption and null-iO from evasive LWE
Cited in
(3)
This page was built for publication: Extractable witness encryption for KZG commitments and efficient laconic OT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6965316)