Pages that link to "Item:Q2829957"
From MaRDI portal
The following pages link to How to Prove Knowledge of Small Secrets (Q2829957):
Displaying 8 items.
- Lattice-based zero-knowledge arguments for additive and multiplicative relations (Q831178) (← links)
- Efficient lattice-based polynomial evaluation and batch ZK arguments (Q832321) (← links)
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
- Practical non-interactive publicly verifiable secret sharing with thousands of parties (Q2170010) (← links)
- Efficient, actively secure MPC with a dishonest majority: a survey (Q2232208) (← links)
- Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography (Q5041168) (← links)
- One-Shot Verifiable Encryption from Lattices (Q5738881) (← links)
- Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack (Q5738887) (← links)
