On succinct non-interactive secure computation with malicious security
From MaRDI portal
Cites work
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Batch arguments to NIZKs from one-way functions
- Black-box constant-round secure 2PC with succinct communication
- Boosting batch arguments and RAM delegation
- Correlation intractability and SNARGs from sub-exponential DDH
- Credibility in private set membership
- Distinguisher-dependent simulation in two rounds and its applications
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient non-interactive secure computation
- Foundations of Cryptography
- From FE combiners to secure MPC and back
- Fully homomorphic encryption using ideal lattices
- How to delegate computations publicly
- Laconic conditional disclosure of secrets and applications
- Laconic function evaluation and applications
- Laconic oblivious transfer and its applications
- Non-interactive delegation and batch NP verification from standard computational assumptions
- On the communication complexity of secure function evaluation with long output
- On the existence of extractable one-way functions
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- SNARGs for \(\mathcal{P}\) from LWE
- SNARGs for P from sub-exponential DDH and QR
- Succinct non-interactive secure computation
- The hunting of the SNARK
- Verifiable private information retrieval
This page was built for publication: On succinct non-interactive secure computation with malicious security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299834)
