Improved efficient arguments. (Preliminary version)
From MaRDI portal
Recommendations
Cited in
(17)- Fast approximate probabilistically checkable proofs
- Privacy-preserving verifiable delegation of polynomial and matrix functions
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency
- Time- and space-efficient arguments from groups of unknown order
- Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions
- Universal Arguments and their Applications
- scientific article; zbMATH DE number 708806 (Why is no real title available?)
- Multikey fully homomorphic encryption and applications
- Efficient algorithms for secure outsourcing of bilinear pairings
- Efficient computation outsourcing for inverting a class of homomorphic functions
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
- On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
- Are PCPs inherent in efficient arguments?
- Approximate lower bound arguments
- Instance compression, revisited
- Lower bounding update frequency in short accumulators and vector commitments
- Preliminary arrangements of arguments in lazy evaluation
This page was built for publication: Improved efficient arguments. (Preliminary version)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4343444)