The following pages link to Statistical ZAP arguments (Q2055672):
Displaying 23 items.
- Statistical witness indistinguishability (and more) in two messages (Q1653073) (← links)
- Statistical ZAPR arguments from bilinear maps (Q2055670) (← links)
- Statistical Zaps and new oblivious transfer protocols (Q2055674) (← links)
- Non-interactive zero knowledge from sub-exponential DDH (Q2056667) (← links)
- Post-quantum multi-party computation (Q2056694) (← links)
- (Commit-and-prove) predictable arguments with privacy (Q2096627) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (Q2104242) (← links)
- Compact ring signatures from learning with errors (Q2120080) (← links)
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Secure MPC: laziness leads to GOD (Q2691583) (← links)
- Post-quantum resettably-sound zero knowledge (Q2695624) (← links)
- The round complexity of quantum zero-knowledge (Q2695629) (← links)
- Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness (Q2695641) (← links)
- Statistical ZAPs from group-based assumptions (Q2695645) (← links)
- Applied Cryptography and Network Security (Q4680934) (← links)
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge (Q6045075) (← links)
- Algebraic restriction codes and their applications (Q6066762) (← links)
- Logarithmic-size (linkable) threshold ring signatures in the plain model (Q6113965) (← links)
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) (Q6114266) (← links)
- Compact accountable ring signatures in the plain model (Q6573648) (← links)
- Two-round concurrent 2PC from sub-exponential LWE (Q6595674) (← links)
- Witness semantic security (Q6637541) (← links)
