Pages that link to "Item:Q2988877"
From MaRDI portal
The following pages link to Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications (Q2988877):
Displaying 11 items.
- Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier (Q2170049) (← links)
- Rate-1, Linear Time and Additively Homomorphic UC Commitments (Q2829947) (← links)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
- Binary AMD Circuits from Secure Multiparty Computation (Q3179363) (← links)
- Recent Advances in Non-perfect Secret Sharing Schemes (Q3188243) (← links)
- Orion: zero knowledge proof with linear prover time (Q6166953) (← links)
- On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography (Q6487414) (← links)
- On the minimum depth of circuits with linear number of wires encoding good codes (Q6591658) (← links)
- Stochastic secret sharing with 1-bit shares and applications to MPC (Q6652972) (← links)
- Field-agnostic SNARKs from expand-accumulate codes (Q6660301) (← links)