Pages that link to "Item:Q1701448"
From MaRDI portal
The following pages link to Two-message witness indistinguishability and secure computation in the plain model from new assumptions (Q1701448):
Displaying 32 items.
- One-message zero knowledge and non-malleable commitments (Q1629409) (← links)
- Two-message statistically sender-private OT from LWE (Q1631337) (← links)
- Pattern matching on encrypted streams (Q1633445) (← links)
- Statistical witness indistinguishability (and more) in two messages (Q1653073) (← links)
- Distinguisher-dependent simulation in two rounds and its applications (Q1678369) (← links)
- Non-interactive secure computation from one-way functions (Q1710666) (← links)
- Statistical ZAP arguments (Q2055672) (← links)
- Statistical Zaps and new oblivious transfer protocols (Q2055674) (← links)
- Multiparty reusable non-interactive secure computation from LWE (Q2056764) (← links)
- Unbounded multi-party computation from learning with errors (Q2056765) (← links)
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments (Q2056787) (← links)
- Succinct non-interactive secure computation (Q2119013) (← links)
- Two-round oblivious transfer from CDH or LPN (Q2119032) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Compressible FHE with applications to PIR (Q2175949) (← links)
- Witness-indistinguishable arguments with \(\varSigma\)-protocols for bundled witness spaces and its application to global identities (Q2218976) (← links)
- Offline witness encryption with semi-adaptive security (Q2229274) (← links)
- Individual simulations (Q2691606) (← links)
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers (Q2692389) (← links)
- Cryptographic group actions and applications (Q2692390) (← links)
- Secure quantum computation with classical communication (Q2695622) (← 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)
- Two-round maliciously secure computation with super-polynomial simulation (Q2695653) (← links)
- Blockchains enable non-interactive MPC (Q2697855) (← links)
- Amortizing rate-1 OT and applications to PIR and PSI (Q2697889) (← links)
- Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
- Algebraic restriction codes and their applications (Q6066762) (← links)
- Round-optimal black-box secure computation from two-round malicious OT (Q6114280) (← links)
- Concurrently composable non-interactive secure computation (Q6135409) (← links)
- Statistically sender-private OT from LPN and derandomization (Q6163969) (← links)
- Two-round concurrent 2PC from sub-exponential LWE (Q6595674) (← links)
