SNARGs for P from LWE
From MaRDI portal
Publication:6943536
Cited in
(27)- Incrementally verifiable computation for NP from standard assumptions
- Rate-1 statistical non-interactive zero-knowledge
- Sometimes-decryptable homomorphic encryption from sub-exponential DDH
- Fully homomorphic encryption with chosen-ciphertext security from LWE
- Succinct arguments for \textsf{BatchQMA} and friends under 8 rounds
- Functional commitments and SNARGs for P/poly from SIS
- Towards a white-box secure Fiat-Shamir transformation
- How to prove false statements: practical attacks on Fiat-Shamir
- Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
- Simultaneous-message and succinct secure computation
- Scalable distributed agreement from LWE: Byzantine agreement, broadcast, and leader election
- On the black-box complexity of correlation intractability
- Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
- Chosen ciphertext security via BARGs
- Monotone-policy BARGs and more from BARGs and quadratic residuosity
- Black-box timed commitments from time-lock puzzles
- Monotone policy BARGs from BARGs and additively homomorphic encryption
- Batching adaptively-sound SNARGs for NP
- Homomorphic secret sharing with verifiable evaluation
- Key-homomorphic and aggregate verifiable random functions
- ABE for circuits with \(\mathsf{poly}(\lambda)\)-sized keys from LWE
- On succinct non-interactive secure computation with malicious security
- A new paradigm for server-aided MPC
- Round-optimal compiler for semi-honest to malicious oblivious transfer via CIH
- Boosting SNARKs and rate-1 barrier in arguments of knowledge
- Simple attacks against (extended) Fiat-Shamir
- Pairing-based functional commitments for circuits with shorter parameters
This page was built for publication: SNARGs for \(\mathcal{P}\) from LWE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6943536)
