Pages that link to "Item:Q2988877"

The following pages link to Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications (Q2988877):

Displaying 10 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)
• Actively secure arithmetic computation and VOLE with constant computational overhead (Q6061358) (← links)
• Brakedown: linear-time and field-agnostic SNARKs for R1CS (Q6145784) (← links)
• Orion: zero knowledge proof with linear prover time (Q6166953) (← links)
• How to recover a secret with \(O(n)\) additions (Q6186593) (← links)