scientific article; zbMATH DE number 1263215
From MaRDI portal
Publication:4234087
Cited in
(16)- Reliable communication over highly connected noisy networks
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Garbling XOR gates ``for free in the standard model
- Linear time adaptive arithmetic coding
- Linear time encodable and list decodable codes
- Construction of expanders and superconcentrators using Kolmogorov complexity
- The complexity of error-correcting codes
- Fast interactive coding against adversarial noise
- Actively secure garbled circuits with constant communication overhead in the plain model
- Oblivious transfer with constant computational overhead
- On sparse parity check matrices (extended abstract)
- Revisiting time-space tradeoffs for function inversion
- Lightweight transparent zero-knowledge proofs for cross-domain statements
- Explicit time and space efficient encoders exist only with random access
- Highly symmetric expanders
- A note on the decoding complexity of error-correcting codes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4234087)
