Pages that link to "Item:Q2829958"
From MaRDI portal
The following pages link to Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials (Q2829958):
Displaying 14 items.
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (Q2104242) (← links)
- Threshold Schnorr with stateless deterministic signing from standard assumptions (Q2120070) (← links)
- Somewhere statistically binding commitment schemes with applications (Q2145407) (← links)
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials (Q2423846) (← links)
- Succinct Diophantine-satisfiability arguments (Q2691605) (← links)
- Public-key generation with verifiable randomness (Q2692338) (← links)
- Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System (Q4922899) (← links)
- ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines (Q5087274) (← links)
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings (Q5097051) (← links)
- Hashing Garbled Circuits for Free (Q5270371) (← links)
- Card-based zero-knowledge proof for the nearest neighbor property: zero-knowledge proof of ABC end view (Q6112013) (← links)
- Efficient zero-knowledge arguments and digital signatures \textit{via} sharing conversion \textit{in the head} (Q6550638) (← links)
- Sigma protocols from verifiable secret sharing and their applications (Q6562568) (← links)
- Hybrid zero-knowledge from garbled circuits and circuit-based composition of \(\Sigma \)-protocols (Q6660381) (← links)
